Module: RGL

Defined in:

lib/rgl/base.rb,
lib/rgl/dot.rb,
lib/rgl/path.rb,
lib/rgl/prim.rb,
lib/rgl/rdot.rb,
lib/rgl/mutable.rb,
lib/rgl/topsort.rb,
lib/rgl/version.rb,
lib/rgl/dijkstra.rb,
lib/rgl/graphxml.rb,
lib/rgl/implicit.rb,
lib/rgl/adjacency.rb,
lib/rgl/bipartite.rb,
lib/rgl/traversal.rb,
lib/rgl/bellman_ford.rb,
lib/rgl/condensation.rb,
lib/rgl/edmonds_karp.rb,
lib/rgl/path_builder.rb,
lib/rgl/transitivity.rb,
lib/rgl/bidirectional.rb,
lib/rgl/graph_visitor.rb,
lib/rgl/graph_wrapper.rb,
lib/rgl/graph_iterator.rb,
lib/rgl/dijkstra_visitor.rb,
lib/rgl/edge_properties_map.rb,
lib/rgl/connected_components.rb,
lib/rgl/bidirectional_adjacency.rb

Overview

Module RGL defines the namespace for all modules and classes of the graph library. The main module is Graph which defines the abstract behavior of all graphs in the library. Other important modules or classes are:

• Class AdjacencyGraph provides a concrete implementation of an undirected graph.

• Module Edge defines edges of a graph.

• GraphIterator and GraphVisitor provide support for iterating and searching.

• DOT helps to visualize graphs.

Defined Under Namespace

Modules: BidirectionalGraph, DOT, Edge, Graph, GraphIterator, GraphVisitor, GraphWrapper, MutableGraph Classes: AdjacencyGraph, BFSIterator, BellmanFordAlgorithm, BellmanFordVisitor, BidirectionalAdjacencyGraph, BipartiteBFSIterator, DFSIterator, DFSVisitor, DijkstraAlgorithm, DijkstraVisitor, DirectedAdjacencyGraph, EdgePropertiesMap, EdmondsKarpAlgorithm, ImplicitGraph, NoEdgeError, NoVertexError, NonNegativeEdgePropertiesMap, NotDirectedError, NotUndirectedError, PathBuilder, PrimAlgorithm, TopsortIterator

Constant Summary

INFINITY =

positive infinity

1.0 / 0.0

VERSION =

"0.6.5".freeze