class AtCoder::Graph(NodeInfo, EdgeInfo)
- AtCoder::Graph(NodeInfo, EdgeInfo)
- Reference
- Object
Direct Known Subclasses
Defined in:
graph.crConstructors
Instance Method Summary
- #dfs(node : Int64, initial_value : T, &block : Int64, T, NamedTuple(node: Int64, node_info: NodeInfo | Nil, edge: Int64 | Nil, edge_info: EdgeInfo | Nil, parent: Int64), T -> -> ) forall T
-
#dijkstra(start_node)
Performs Dijkstra's Algorithm to calculate the distance of each node from
start_node
. - #visited : Set(Int64)
Constructor Detail
Instance Method Detail
def dfs(node : Int64, initial_value : T, &block : Int64, T, NamedTuple(node: Int64, node_info: NodeInfo | Nil, edge: Int64 | Nil, edge_info: EdgeInfo | Nil, parent: Int64), T -> -> ) forall T
#
def dijkstra(start_node)
#
Performs Dijkstra's Algorithm to calculate the distance of each node from start_node
.
To use this method, EdgeInfo
must implement .zero
and #+(EdgeInfo)
and #>(EdgeInfo)
.