abstract class Crystalline::Graph::MutableGraph(T, Edge, EdgeList)

Direct Known Subclasses

Defined in:

graph/mutable.cr

Constructors

Instance Method Summary

Instance methods inherited from class Crystalline::Graph::Graph(T, Edge)

==(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

Constructor Detail

def self.new(*other_graphs) #

[View source]

Instance Method Detail

def ==(x) #
Description copied from class Reference

Returns false (other can only be a Value here).


[View source]
def add_edge(u, v) #

[View source]
def add_edges(edges) #

[View source]
def add_vertex(v) #

[View source]
def add_vertices(a) #

[View source]
def each_adjacent(v, &) #

[View source]
def each_vertex(&) #

[View source]
def has_edge?(u, v) #

[View source]
def has_vertex?(v) #

[View source]
abstract def remove_edge(u, v) #

[View source]
def remove_vertex(v) #

[View source]
def remove_vertices(a) #

[View source]