abstract class CGL::AnyGraph(V)

• CGL::AnyGraph(V)
• Reference
• Object

Direct Known Subclasses

• CGL::AbstractDiGraph(V)
• CGL::AbstractGraph(V)

Defined in:

Instance Method Summary

• #==(other : self)

  Whether self is equal to other.

• #==(other)

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

• #accept(visitor : Visitor(V))
• #add_edge(u : V, v : V)

  Add an edge between vertices u and v.

• #add_edge(edge : AnyEdge(V))

  Add the given edge to the graph.

• #add_vertex(v : V)

  Add a single vertex (a.k.a.

• #breadth_first_search(from vertex : V) : Iterator(V)

  Returns an iterator over vertices from the given source v in a breadth-first search (DFS).

• #breadth_first_search(from vertex : V, &)

  Yields vertices from the given source v in a breadth-first search (DFS).

• #clear

  Empties an AnyGraph and returns it.

• #clone

  Returns a deep copy of self.

• #count_simple_paths(source : V, target : V)

  Count all simple paths between the two given vertices, where a simple path is a path with no repeated nodes.

• #degree_of(v : V) : Int32

  Returns the degree of the given vertex v.

• #density : Float64

  Returns the density of self.

• #depth_first_search(from vertex : V) : Iterator(V)

  Returns an iterator over vertices from the given source v in a depth-first search (DFS).

• #depth_first_search(from vertex : V, &)

  Yields vertices from the given source v in a depth-first search (DFS).

• #depth_first_search(vertex : V, *, colors : Hash(V, Color), &)
• #depth_first_search(&)

  Yields all vertices of self, which are traversed following a depth-first search (DFS) on the whole graph.

• #depth_first_search : Iterator(V)

  Returns an iterator over all vertices of self, which are traversed following a depth-first search (DFS) on the whole graph.

• #directed? : Bool

  Whether self is directed.

• #dup

  Returns a shallow copy of self.

• #each_adjacent(u : V, & : V -> )

  Yields each vertex adjacent to u in the graph.

• #each_adjacent(u : V) : Iterator(V)

  Returns an iterator over each vertex adjacent to u in the graph.

• #each_edge(& : AnyEdge(V) -> )

  Yields each edges in the graph.

• #each_edge : Iterator(AnyEdge(V))

  Returns an iterator over each edge in the graph.

• #each_edge_from(u : V, & : AnyEdge(V) -> )

  Yields each edge incident to u in the graph.

• #each_vertex(& : V -> )

  Yields each vertex of the graph.

• #each_vertex : Iterator(V)

  Returns an iterator over each vertex of the graph.

• #edge(u : V, v : V, &)

  Returns an edge data structure between u and v if present in the graph, otherwise returns the value of the given block.

• #edge(u : V, v : V)

  Returns an edge data structure between u and v if present in the graph, otherwise raises an EdgeError.

• #edge?(u : V, v : V)

  Returns an edge data structure between u and v if present in the graph, otherwise returns nil.

• #edges : Array(AnyEdge(V))

  Returns an array of edges belonging to this graph.

• #empty? : Bool

  Whether the graph is empty.

• #has_edge?(u : V, v : V, weight, label) : Bool

  Whether the edge between u and v with the given attributes is part of the graph.

• #has_edge?(u : V, v : V) : Bool

  Whether the edge between u and v is part of the graph.

• #has_edge?(edge : Labelable) : Bool

  Whether the given edge is part of the graph.

• #has_edge?(edge : Weightable) : Bool

  Whether the given edge is part of the graph.

• #has_edge?(edge : AnyEdge(V)) : Bool

  Whether the given edge is part of the graph.

• #has_vertex?(v : V) : Bool

  Whether the given vertex v is part of the graph.

• #hash(hasher)

  See Object#hash(hasher)

• #in_degree_of(v : V) : Int32

  Returns the incoming degree of the given vertex v.

• #label_of(u : V, v : V)

  Returns the label associated with the given edge if it exists, raises EdgeError otherwise

• #label_of?(u : V, v : V)

  Returns the label associated with the given edge if it exists, otherwise returns nil.

• #labeled? : Bool

  Whether edges are labeled.

• #order : Int32

  Returns the number of vertices in self.

• #out_degree_of(v : V) : Int32

  Returns the outgoing degree of the given vertex v.

• #remove_edge(u : V, v : V)

  Deletes the given edge and returns it, otherwise returns nil.

• #remove_vertex(v : V)

  Remove given vertex v from this graph.

• #shortest_path(source : V, target : V)

  Returns a shortest path between the given vertices.

• #shortest_path_dijkstra(source : V, target : V)

  Returns the shortest weighted path between the given vertices.

• #shortest_path_unweighted(source : V, target : V)

  Returns the shortest unweighted path between the given vertices.

• #size : Int32

  Returns the number of edges in self.

• #subgraph(edges : Enumerable(AnyEdge(V)), *, clone : Bool = false) : AnyGraph(V)

  Returns a subgraph containing the given edges.

• #subgraph(vertices : Enumerable(V), *, clone : Bool = false) : AnyGraph(V)

  Returns a subgraph containing the given vertices as well as the existing edges between those vertices.

• #to_a : Array(AnyEdge(V))

  See #edges.

• #to_dot(path : String)

  Generates a DOT file representing the graph at the given path.

• #to_dot(io : IO)

  Generates a DOT representation of the graph using the given IO.

• #weight_of(u : V, v : V)

  Returns the weight associated with the given edge if it exists, otherwise EdgeError otherwise.

• #weight_of?(u : V, v : V)

  Returns the weight associated with the given edge if it exists, otherwise returns nil.

• #weighted? : Bool

  Whether edges are weighted.

Instance Method Detail

g = CGL::Graph(String).new
g.add_vertex("Hello")

g = Graph(String).new(edges: [{"b", "a"}, {"a", "c"}])
g.each_adjacent("a") do |v|
  puts v
end

b
c

g = DiGraph(String).new(edges: [{"b", "a"}, {"a", "c"}])
g.each_adjacent("a") do |v|
  puts v
end

c

g = CGL::Graph(String).new(edges: [{"a", "b"}, {"b", "c"}])
g.size # => 2
g.remove_vertex("b")
g.size # => 0