Directed graph using an adjacency list representation.
Instance methods
add_edge(from : T, to : T)
Adds an edge between two nodes. If the nodes don't exist they will be automatically added.
add_node(name : T)
Add a new node to the graph
empty?
Check if the graph has no nodes
has_edge?(from : T, to : T) : Bool
Check if an edge exists between two nodes
has_node?(name : T) : Bool
Check if a node exists in the graph
neighbors(name : T) : Set(T)
Get the neighbors of a node
nodes
Get all nodes in the graph
size
Returns the number of nodes in the graph