class

AtCoder::Graph(NodeInfo, EdgeInfo)

Inherits Reference / Object

Constructors

new(nodes : Array(NodeInfo))
Source
new(size : Int64, initial_node : NodeInfo = nil)
Source

Instance methods

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
Source
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).

Source
visited
Source