Documentation
¶
Index ¶
- type CityLock
- type World
- func (w World) CityName(city int) string
- func (w *World) DestroyCity(city int)
- func (w *World) LockCity(city int)
- func (w World) NumberOfCities() int
- func (w World) NumberOfRoutes() int
- func (w World) NumberOfRoutesOut(cityId int) int
- func (w World) PrintWorld()
- func (w World) RandomNeighboringCity(cityId int) int
- func (w World) RoutesOut(cityId int) []int
- func (w *World) UnlockCity(city int)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type World ¶
type World struct {
// contains filtered or unexported fields
}
func LoadWorld ¶
Assumption: I dont assume is a planar graph, nor 4-regular. Assumption: routes are two-way but a city recieving a route from the north might a north route goin to another city. Ex.:
Foo south=Bar Bar north=Extra
func (*World) DestroyCity ¶
func (World) NumberOfCities ¶
func (World) NumberOfRoutes ¶
func (World) NumberOfRoutesOut ¶
func (World) PrintWorld ¶
func (w World) PrintWorld()
func (World) RandomNeighboringCity ¶
func (*World) UnlockCity ¶
Source Files
Click to show internal directories.
Click to hide internal directories.