class RGL::AdjacencyGraph
AdjacencyGraph
is an undirected Graph
. The methods {DirectedAdjacencyGraph#add_edge} and {DirectedAdjacencyGraph#remove_edge} are reimplemented: if an edge (u,v) is added or removed, then the reverse edge (v,u) is also added or removed.
Public Instance Methods
directed?()
click to toggle source
@return false.
# File lib/rgl/adjacency.rb 144 def directed? 145 false 146 end
remove_edge(u, v)
click to toggle source
Also removes (v,u) @see DirectedAdjacencyGraph#remove_edge
Calls superclass method
RGL::DirectedAdjacencyGraph#remove_edge
# File lib/rgl/adjacency.rb 150 def remove_edge(u, v) 151 super 152 @vertices_dict[v].delete(u) unless @vertices_dict[v].nil? 153 end
Protected Instance Methods
basic_add_edge(u, v)
click to toggle source
Calls superclass method
RGL::DirectedAdjacencyGraph#basic_add_edge
# File lib/rgl/adjacency.rb 157 def basic_add_edge(u, v) 158 super 159 @vertices_dict[v].add(u) # Insert backwards edge 160 end