class Sodium::DiGraph(T)
Defined in:
sodium/digraph.cr
Constructors
Instance methods inherited from class Sodium::Graph(T)
/(partition : Hash(T, Enumerable(T)))
/,
[](node : T)
[],
[]?(node : T)
[]?,
add_cycle(nodes : Array(T))
add_cycle,
add_edge(u : T, v : T, **attr)
add_edge,
add_edges_from(list : Enumerable(Tuple(T, T)))
add_edges_from,
add_node(n : T, **attr)
add_node,
add_nodes_from(list : Enumerable(T))
add_nodes_from,
add_path(nodes : Enumerable(T))
add_path,
add_star(nodes : Array(T))
add_star,
add_weighted_edges_from(list : Enumerable(Tuple(T, T, Int32)))
add_weighted_edges_from,
adjacency_list
adjacency_list,
clear
clear,
copy
copy,
degree(node : T)
degree,
edges
edges,
get_edge_data(u : T, v : T)
get_edge_data,
has_edge?(u : T, v : T)
has_edge?,
has_node?(node : T)
has_node?,
neighbours(node)
neighbours,
next
next,
nodes
nodes,
nodes_with_data
nodes_with_data,
nodes_with_selfloops
nodes_with_selfloops,
number_of_edges(list : Enumerable(Tuple(T, T)))
number_of_edges,
number_of_nodes
number_of_nodes,
number_of_selfloops
number_of_selfloops,
order
order,
remove_edge(u : T, v : T)
remove_edge,
remove_edges_from(list : Enumerable(Tuple(T, T)))
remove_edges_from,
remove_node(n : T)
remove_node,
remove_nodes_from(list : Enumerable(T))
remove_nodes_from,
rewind
rewind,
selfloop_edges
selfloop_edges,
selfloop_edges_with_data
selfloop_edges_with_data,
size
size
Constructor methods inherited from class Sodium::Graph(T)
new
new
Constructor Detail