module Crystalg::Graph::ShortestPath::Dijkstra(C)

Direct including types

Crystalg::Graph::DirectedGraph(C)

Defined in:

crystalg/graph/shortest_path/dijkstra.cr

Instance Method Summary

#dijkstra(start : NodeID) : Array(Tuple(C, NodeID | Nil) | Nil)
#get_dijkstra_path(node_id : NodeID, dijkstra_result : Array(Tuple(C, NodeID | Nil) | Nil)) : Array(NodeID)

Instance Method Detail

def dijkstra(start : NodeID) : Array(Tuple(C, NodeID | Nil) | Nil) #

[View source]

def get_dijkstra_path(node_id : NodeID, dijkstra_result : Array(Tuple(C, NodeID | Nil) | Nil)) : Array(NodeID) #

[View source]