class Crystalline::Graph::AdjacencyGraph(T, EdgeList)
- Crystalline::Graph::AdjacencyGraph(T, EdgeList)
- Crystalline::Graph::MutableGraph(T, Crystalline::Graph::UndirectedEdge(T), EdgeList)
- Crystalline::Graph::Graph(T, Crystalline::Graph::UndirectedEdge(T))
- Reference
- Object
Defined in:
graph/adjacency.crConstructors
Instance Method Summary
Instance methods inherited from class Crystalline::Graph::MutableGraph(T, Crystalline::Graph::UndirectedEdge(T), EdgeList)
==(x)
==,
add_edge(u, v)
add_edge,
add_edges(edges)
add_edges,
add_vertex(v)
add_vertex,
add_vertices(a)
add_vertices,
each_adjacent(v, &)
each_adjacent,
each_vertex(&)
each_vertex,
has_edge?(u, v)
has_edge?,
has_vertex?(v)
has_vertex?,
remove_edge(u, v)
remove_edge,
remove_vertex(v)
remove_vertex,
remove_vertices(a)
remove_vertices
Constructor methods inherited from class Crystalline::Graph::MutableGraph(T, Crystalline::Graph::UndirectedEdge(T), EdgeList)
new(*other_graphs)
new
Instance methods inherited from class Crystalline::Graph::Graph(T, Crystalline::Graph::UndirectedEdge(T))
==(g)
==,
adjacent_vertices(v)
adjacent_vertices,
bfs_iterator(v = self.find do |x|
true
end)
bfs_iterator,
bfs_search_tree_from(v)
bfs_search_tree_from,
dfs_iterator(v = self.find do |x|
true
end)
dfs_iterator,
directed?
directed?,
each(&)
each,
each_adjacent(v, &block : T -> )
each_adjacent,
each_edge(&)
each_edge,
each_vertex(&block : T -> )
each_vertex,
edges
edges,
empty?
empty?,
eql?(g)
eql?,
has_vertex?(v)
has_vertex?,
num_edges
num_edges,
num_vertices
num_vertices,
out_degree(v)
out_degree,
reverse
reverse,
size
size,
to_adjacency
to_adjacency,
to_s(*args, **options)to_s(*args, **options, &) to_s, vertices vertices