Table of Contents - RGL - Ruby Graph Library
Pages
Classes and Modules
- Enumerable
- Object
- RGL
- RGL::AdjacencyGraph
- RGL::BFSIterator
- RGL::BellmanFordAlgorithm
- RGL::BellmanFordVisitor
- RGL::BidirectionalGraph
- RGL::BipartiteBFSIterator
- RGL::DFSIterator
- RGL::DFSVisitor
- RGL::DOT
- RGL::DOT::Digraph
- RGL::DOT::DirectedEdge
- RGL::DOT::Edge
- RGL::DOT::Element
- RGL::DOT::Graph
- RGL::DOT::Node
- RGL::DOT::Port
- RGL::DOT::Subgraph
- RGL::DijkstraAlgorithm
- RGL::DijkstraVisitor
- RGL::DirectedAdjacencyGraph
- RGL::Edge
- RGL::Edge::DirectedEdge
- RGL::Edge::UnDirectedEdge
- RGL::EdgePropertiesMap
- RGL::EdmondsKarpAlgorithm
- RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator
- RGL::Graph
- RGL::Graph::TarjanSccVisitor
- RGL::GraphIterator
- RGL::GraphVisitor
- RGL::GraphVisitor::ClassMethods
- RGL::GraphVisitor::DistanceMapSupport
- RGL::GraphWrapper
- RGL::ImplicitGraph
- RGL::MutableGraph
- RGL::MutableGraph::MutableGraphParser
- RGL::NoEdgeError
- RGL::NoVertexError
- RGL::NonNegativeEdgePropertiesMap
- RGL::NotDirectedError
- RGL::NotUndirectedError
- RGL::PathBuilder
- RGL::PrimAlgorithm
- RGL::TopsortIterator
Methods
- ::[] — RGL::DirectedAdjacencyGraph
- ::[] — RGL::Edge::DirectedEdge
- ::included — RGL::GraphVisitor
- ::new — RGL::DOT::Port
- ::new — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator
- ::new — RGL::MutableGraph::MutableGraphParser
- ::new — RGL::EdmondsKarpAlgorithm
- ::new — RGL::ImplicitGraph
- ::new — RGL::Graph::TarjanSccVisitor
- ::new — RGL::PrimAlgorithm
- ::new — RGL::GraphVisitor
- ::new — RGL::DijkstraAlgorithm
- ::new — RGL::DOT::Node
- ::new — RGL::DOT::Graph
- ::new — RGL::DOT::Digraph
- ::new — RGL::DOT::Subgraph
- ::new — RGL::DirectedAdjacencyGraph
- ::new — RGL::Edge::DirectedEdge
- ::new — RGL::DOT::Edge
- ::new — RGL::TopsortIterator
- ::new — RGL::BFSIterator
- ::new — RGL::BellmanFordAlgorithm
- ::new — RGL::BellmanFordVisitor
- ::new — RGL::EdgePropertiesMap
- #<< — RGL::DOT::Graph
- #<=> — RGL::Edge::DirectedEdge
- #== — RGL::Edge::DirectedEdge
- #== — RGL::Graph
- #[] — RGL::Edge::DirectedEdge
- #acyclic? — RGL::Graph
- #add_edge — RGL::DirectedAdjacencyGraph
- #add_edge — RGL::MutableGraph
- #add_edges — RGL::MutableGraph
- #add_vertex — RGL::DirectedAdjacencyGraph
- #add_vertex — RGL::MutableGraph
- #add_vertices — RGL::MutableGraph
- #adjacent_iterator — RGL::ImplicitGraph
- #adjacent_vertices — RGL::Graph
- #at_beginning? — RGL::TopsortIterator
- #at_end? — RGL::BFSIterator
- #attach_distance_map — RGL::GraphVisitor
- #basic_add_edge — RGL::AdjacencyGraph
- #basic_add_edge — RGL::DirectedAdjacencyGraph
- #bellman_ford_shortest_paths — RGL::Graph
- #bfs_iterator — RGL::Graph
- #bfs_search_tree_from — RGL::Graph
- #bipartite? — RGL::Graph
- #bipartite_sets — RGL::Graph
- #build_edge_weights_map — RGL::DijkstraAlgorithm
- #check_properties — RGL::EdgePropertiesMap
- #condensation_graph — RGL::Graph
- #cycles — RGL::MutableGraph
- #cycles_with_vertex — RGL::MutableGraph
- #def_event_handler — RGL::GraphVisitor::ClassMethods
- #def_event_handlers — RGL::GraphVisitor::ClassMethods
- #degree — RGL::BidirectionalGraph
- #depth_first_search — RGL::Graph
- #depth_first_visit — RGL::Graph
- #dfs_iterator — RGL::Graph
- #dijkstra_shortest_path — RGL::Graph
- #dijkstra_shortest_paths — RGL::Graph
- #directed? — RGL::DirectedAdjacencyGraph
- #directed? — RGL::ImplicitGraph
- #directed? — RGL::Graph
- #directed? — RGL::AdjacencyGraph
- #distance_to_root — RGL::GraphVisitor::DistanceMapSupport
- #dotty — RGL::Graph
- #each — RGL::Graph
- #each_adjacent — RGL::Graph
- #each_connected_component — RGL::Graph
- #each_edge — RGL::Graph
- #each_edge_aux — RGL::Graph
- #each_element — RGL::DOT::Graph
- #each_in_neighbor — RGL::BidirectionalGraph
- #each_vertex — RGL::DirectedAdjacencyGraph
- #each_vertex — RGL::Graph
- #edge_class — RGL::Graph
- #edge_iterator — RGL::ImplicitGraph
- #edge_link — RGL::DOT::DirectedEdge
- #edge_link — RGL::DOT::Edge
- #edge_property — RGL::EdgePropertiesMap
- #edgelist_class= — RGL::DirectedAdjacencyGraph
- #edges — RGL::Graph
- #edges_filtered_by — RGL::Graph
- #empty? — RGL::Graph
- #eql? — RGL::Edge::UnDirectedEdge
- #eql? — RGL::Graph
- #eql? — RGL::Edge::DirectedEdge
- #eql_edges_set? — RGL::Graph
- #eql_graph? — RGL::Graph
- #eql_vertices_set? — RGL::Graph
- #find_shortest_paths — RGL::DijkstraAlgorithm
- #finished_vertex? — RGL::GraphVisitor
- #follow_edge? — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator
- #from_graphxml — RGL::MutableGraph
- #get_capacity — RGL::EdmondsKarpAlgorithm
- #handle_back_edge — RGL::BipartiteBFSIterator
- #handle_examine_vertex — RGL::Graph::TarjanSccVisitor
- #handle_finish_vertex — RGL::Graph::TarjanSccVisitor
- #handle_forward_edge — RGL::BipartiteBFSIterator
- #handle_tree_edge — RGL::BipartiteBFSIterator
- #handle_tree_edge — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator
- #handle_tree_edge — RGL::GraphVisitor::DistanceMapSupport
- #has_edge? — RGL::DirectedAdjacencyGraph
- #has_vertex? — RGL::Graph
- #has_vertex? — RGL::DirectedAdjacencyGraph
- #hash — RGL::Edge::DirectedEdge
- #implicit_graph — RGL::Graph
- #in_degree — RGL::BidirectionalGraph
- #init — RGL::DijkstraAlgorithm
- #init — RGL::BellmanFordAlgorithm
- #initialize_copy — RGL::DirectedAdjacencyGraph
- #inspect — RGL::Edge::DirectedEdge
- #length — Enumerable
- #maximum_flow — RGL::EdmondsKarpAlgorithm
- #maximum_flow — RGL::Graph
- #min_discover_time — RGL::Graph::TarjanSccVisitor
- #minimum_spanning_tree — RGL::PrimAlgorithm
- #next_vertex — RGL::DFSIterator
- #num_comp — RGL::Graph::TarjanSccVisitor
- #num_edges — RGL::Graph
- #num_vertices — RGL::Graph
- #out_degree — RGL::Graph
- #pop — RGL::DOT::Graph
- #prim_minimum_spanning_tree — RGL::Graph
- #print_dotted_on — RGL::Graph
- #push — RGL::DOT::Graph
- #quote_ID — RGL::DOT::Element
- #quote_label — RGL::DOT::Element
- #relax_edge — RGL::BellmanFordAlgorithm
- #relax_edge — RGL::DijkstraAlgorithm
- #relax_edges — RGL::BellmanFordAlgorithm
- #relax_edges — RGL::DijkstraAlgorithm
- #remove_edge — RGL::MutableGraph
- #remove_edge — RGL::AdjacencyGraph
- #remove_edge — RGL::DirectedAdjacencyGraph
- #remove_vertex — RGL::MutableGraph
- #remove_vertex — RGL::DirectedAdjacencyGraph
- #remove_vertices — RGL::MutableGraph
- #report_missing_property — RGL::EdgePropertiesMap
- #report_negative_property — RGL::NonNegativeEdgePropertiesMap
- #reset — RGL::DijkstraVisitor
- #reset — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator
- #reset — RGL::GraphVisitor
- #reset — RGL::BipartiteBFSIterator
- #reset_start — RGL::BipartiteBFSIterator
- #reverse — RGL::Edge::DirectedEdge
- #reverse — RGL::Graph
- #set_source — RGL::DijkstraVisitor
- #set_to_begin — RGL::BipartiteBFSIterator
- #set_to_begin — RGL::BFSIterator
- #shortest_path — RGL::DijkstraAlgorithm
- #shortest_paths — RGL::BellmanFordAlgorithm
- #shortest_paths — RGL::DijkstraAlgorithm
- #size — RGL::Graph
- #strongly_connected_components — RGL::Graph
- #tag_start — RGL::MutableGraph::MutableGraphParser
- #to_a — RGL::Edge::DirectedEdge
- #to_adjacency — RGL::Graph
- #to_dot_graph — RGL::Graph
- #to_s — RGL::DOT::Node
- #to_s — RGL::Edge::DirectedEdge
- #to_s — RGL::Graph
- #to_s — RGL::DOT::Port
- #to_s — RGL::Edge::UnDirectedEdge
- #to_s — RGL::DOT::Edge
- #to_s — RGL::DOT::Graph
- #to_undirected — RGL::Graph
- #topsort_iterator — RGL::Graph
- #transitive_closure — RGL::Graph
- #transitive_reduction — RGL::Graph
- #validate_capacity — RGL::EdmondsKarpAlgorithm
- #validate_edge_capacities — RGL::EdmondsKarpAlgorithm
- #validate_negative_capacity — RGL::EdmondsKarpAlgorithm
- #validate_property — RGL::NonNegativeEdgePropertiesMap
- #validate_property — RGL::EdgePropertiesMap
- #verify_odd_cycle — RGL::BipartiteBFSIterator
- #vertex_id — RGL::Graph
- #vertex_iterator — RGL::ImplicitGraph
- #vertex_label — RGL::Graph
- #vertices — RGL::Graph
- #vertices_filtered_by — RGL::Graph
- #write_to_graphic_file — RGL::Graph