Class: GRATR::UndirectedPseudoGraph

Inherits:
UndirectedGraph show all
Defined in:
lib/gratr/undirected_graph.rb

Overview

This is a UndirectedGraph that allows for parallel edges, but does not allow loops

Instance Method Summary collapse

Methods inherited from UndirectedGraph

#balanced?, #chromatic_number, #degree, #directed?, #edge_class, #interval?, #permutation?, #remove_edge!, #split?, #triangulated?

Methods included from Graph::Comparability

#comparability?, #gamma_decomposition, #transitive_orientation

Methods included from Graph::Biconnected

#biconnected

Methods included from Graph::Search

#acyclic?, #astar, #best_first, #bfs, #bfs_spanning_forest, #bfs_tree_from_vertex, #cyclic?, #dfs, #dfs_spanning_forest, #dfs_tree_from_vertex, #lexicograph_bfs, #method_missing, #pre_search_method_missing, #spanning_forest, #topsort, #tree_from_vertex

Methods included from AdjacencyGraph

#add_edge!, #add_vertex!, #adjacent, #edge?, #edges, #graph_adjacent, included, #remove_edge!, #remove_vertex!, #vertex?, #vertices

Methods included from Graph

#dotty, #to_dot, #to_dot_graph, #write_to_graphic_file

Constructor Details

#initialize(*params) ⇒ UndirectedPseudoGraph

Returns a new instance of UndirectedPseudoGraph.

Raises:

  • (ArgumentError) 


134
135
136
137
138
139
 
# File 'lib/gratr/undirected_graph.rb', line 134

def initialize(*params)
  raise ArgumentError if params.any? do |p| 
   !(p.kind_of? Graph or p.kind_of? Array)
  end
  super(:parallel_edges, *params)
end

Dynamic Method Handling

This class handles dynamic methods through the method_missing method in the class GRATR::Graph::Search