world

Documentation

Index

• type CityLock
• type World
  • func LoadWorld(mapFilename string) World
  • func New(worldMap simple.UndirectedGraph, cityIds map[int]string, ...) 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)

Types

type CityLock

type CityLock struct{ sync.Mutex }

type World

type World struct {
	// contains filtered or unexported fields
}

func LoadWorld

func LoadWorld(mapFilename string) World

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 New

func New(worldMap simple.UndirectedGraph, cityIds map[int]string, invCityIds map[string]int) World

func (World) CityName

func (w World) CityName(city int) string

func (*World) DestroyCity

func (w *World) DestroyCity(city int)

func (*World) LockCity

func (w *World) LockCity(city int)

func (World) NumberOfCities

func (w World) NumberOfCities() int

func (World) NumberOfRoutes

func (w World) NumberOfRoutes() int

func (World) NumberOfRoutesOut

func (w World) NumberOfRoutesOut(cityId int) int

func (World) PrintWorld

func (w World) PrintWorld()

func (World) RandomNeighboringCity

func (w World) RandomNeighboringCity(cityId int) int

func (World) RoutesOut

func (w World) RoutesOut(cityId int) []int

func (*World) UnlockCity

func (w *World) UnlockCity(city int)