da

main.go

func main() {
	// build and run Dijkstra's algorithm on graph
	graph := buildGraph()
	city := os.Args[1]
	dijkstra(graph, city)

	// display the nodes
	for _, node := range graph.Nodes {
		fmt.Printf("Shortest time from %s to %s is %d\n",
			city, node.name, node.value)
		for n := node; n.through != nil; n = n.through {
			fmt.Print(n, " <- ")
		}
		fmt.Println(city)
		fmt.Println()
	}
}