class

Crystalg::Graph::DirectedGraph(C)

Inherits Crystalg::Graph::ShortestPath::Dijkstra < Crystalg::Graph::ConnectedComponents::CycleDetection < Crystalg::Graph::Graph < Reference < Object

C: type of cost

Constructors

new(size : Int32)

Instance methods

add(edge : Edge(C))

adjacent_nodes(node_id : NodeID) : Array(Tuple(C, NodeID))

edges

size

topological_sort