class Crystalg::Graph::DirectedGraph(C)

Overview

C: type of cost

Included Modules

Defined in:

crystalg/graph/directed_graph.cr

Constructors

Instance Method Summary

Instance methods inherited from module Crystalg::Graph::ShortestPath::Dijkstra(C)

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

Instance methods inherited from module Crystalg::Graph::ConnectedComponents::CycleDetection

has_cycle? has_cycle?, has_negative_cycle? has_negative_cycle?

Instance methods inherited from class Crystalg::Graph::Graph(C)

size : Int32 size

Constructor Detail

def self.new(size : Int32) #

[View source]

Instance Method Detail

def add(edge : Edge(C)) #

[View source]
def adjacent_nodes(node_id : NodeID) : Array(Tuple(C, NodeID)) #

[View source]
def edges : Array(Edge(C)) #

[View source]
def size : Int32 #

[View source]
def topological_sort : Array(NodeID) #

[View source]