Dijkstra.ShortestPath — MethodShortestPath(G, s)Find shortest path in graph G, starting from node s.
Dijkstra.add_edge! — Methodadd_edge!(G, u, v, w)Add edge (u, v) with weight w to graph G.
Dijkstra.generate_random_graph — Methodgenerate_random_graph(nvertices, edge_density, min_weight, max_weight)Generate random graph for test purposes.
Dijkstra.get_adjacent_nodes — Methodget_adjacent_nodes(G, u)Return a set of adjacent nodes to u in graph G.
Dijkstra.get_distance — Methodget_distance(R, u)Given ShortestPath R and node u, find distance. If u is not found from R, return Inf.
Dijkstra.get_edge_weight — Methodget_edge_weight(G, u, v)Return edge (u, v) weight from graph G.
Dijkstra.get_smallest_distance — Methodget_smallest_distance(R, Q)Given ShortestPath R and queue Q, find smallest distance.