Table of Contents - RDoc Documentation

::[] — RGL::DirectedAdjacencyGraph

::[] — RGL::Edge::DirectedEdge

::included — RGL::GraphVisitor

::new — RGL::DirectedAdjacencyGraph

::new — RGL::Edge::DirectedEdge

::new — RGL::BellmanFordVisitor

::new — RGL::BellmanFordAlgorithm

::new — RGL::Graph::TarjanSccVisitor

::new — RGL::DijkstraAlgorithm

::new — RGL::EdgePropertiesMap

::new — RGL::EdmondsKarpAlgorithm

::new — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator

::new — RGL::MutableGraph::MutableGraphParser

::new — RGL::ImplicitGraph

::new — RGL::PrimAlgorithm

::new — RGL::DOT::Port

::new — RGL::DOT::Node

::new — RGL::DOT::Graph

::new — RGL::DOT::Digraph

::new — RGL::DOT::Subgraph

::new — RGL::DOT::Edge

::new — RGL::TopsortIterator

::new — RGL::BFSIterator

::new — RGL::GraphVisitor

#<< — 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

#assert_match — TestDot

#assert_match — Test::Unit::TestCase

#assert_no_match — Test::Unit::TestCase

#at_beginning? — RGL::TopsortIterator

#at_end? — RGL::BFSIterator

#attach_distance_map — RGL::GraphVisitor

#aux — TestTraversal

#basic_add_edge — RGL::DirectedAdjacencyGraph

#basic_add_edge — RGL::AdjacencyGraph

#bellman_ford_shortest_paths — RGL::Graph

#bfs_example — Object

#bfs_iterator — RGL::Graph

#bfs_search_tree_from — RGL::Graph

#bipartite? — RGL::Graph

#bipartite_sets — RGL::Graph

#complete — Object

#condensation_graph — RGL::Graph

#contains_cycle? — TestCycles

#cycle — Object

#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::AdjacencyGraph

#directed? — RGL::ImplicitGraph

#directed? — RGL::Graph

#distance_to_root — RGL::GraphVisitor::DistanceMapSupport

#divisors — Object

#doc_skip — File

#dotty — RGL::Graph

#each — RGL::Graph

#each_adjacent — RGL::Graph

#each_connected_component — RGL::Graph

#each_edge — 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_property — RGL::EdgePropertiesMap

#edgelist_class= — RGL::DirectedAdjacencyGraph

#edges — RGL::Graph

#edges_filtered_by — RGL::Graph

#empty? — RGL::Graph

#eql? — RGL::Edge::DirectedEdge

#eql? — RGL::Edge::UnDirectedEdge

#eql? — RGL::Graph

#execute — Dependency

#find_files — Dependency

#find_shortest_paths — RGL::DijkstraAlgorithm

#finished_vertex? — RGL::GraphVisitor

#follow_edge? — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator

#from_graphxml — RGL::MutableGraph

#graph_from_dotfile — Object

#graph_from_string — Object

#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::DirectedAdjacencyGraph

#has_vertex? — RGL::Graph

#hash — RGL::Edge::DirectedEdge

#implicit_graph — RGL::Graph

#in_degree — RGL::BidirectionalGraph

#initialize_copy — RGL::DirectedAdjacencyGraph

#inspect — RGL::Edge::DirectedEdge

#length — RGL::GraphIterator

#maximum_flow — RGL::EdmondsKarpAlgorithm

#maximum_flow — RGL::Graph

#minimum_spanning_tree — RGL::PrimAlgorithm

#module_graph — Object

#modulo — Object

#next_vertex — RGL::DFSIterator

#num_comp — RGL::Graph::TarjanSccVisitor

#num_edges — RGL::Graph

#num_vertices — RGL::Graph

#out_degree — RGL::Graph

#partite — Object

#pop — RGL::DOT::Graph

#prim_minimum_spanning_tree — RGL::Graph

#print_dotted_on — RGL::Graph

#print_list — Dependency

#push — RGL::DOT::Graph

#remove_edge — RGL::DirectedAdjacencyGraph

#remove_edge — RGL::AdjacencyGraph

#remove_edge — RGL::MutableGraph

#remove_vertex — RGL::DirectedAdjacencyGraph

#remove_vertex — RGL::MutableGraph

#remove_vertices — RGL::MutableGraph

#reset — RGL::BipartiteBFSIterator

#reset — RGL::DijkstraVisitor

#reset — RGL::EdmondsKarpAlgorithm::EdmondsKarpBFSIterator

#reset — RGL::GraphVisitor

#reset_start — RGL::BipartiteBFSIterator

#reverse — RGL::Edge::DirectedEdge

#reverse — RGL::Graph

#scan — Dependency

#set_source — RGL::DijkstraVisitor

#set_to_begin — RGL::BipartiteBFSIterator

#set_to_begin — RGL::BFSIterator

#setup — TestBellmanFord

#setup — TestComponents

#setup — TestCycles

#setup — TestDijkstraIssue24

#setup — TestDijkstra

#setup — TestDirectedGraph

#setup — TestEdgePropertiesMap

#setup — TestEdmondsKarp

#setup — TestGraph

#setup — TestGraphXML

#setup — TestImplicit

#setup — TestPrim

#setup — TestTransitiveClosure

#setup — TestTraversal

#setup — TestUnDirectedGraph

#shortest_path — RGL::DijkstraAlgorithm

#shortest_path — TestDijkstraIssue24

#shortest_paths — RGL::BellmanFordAlgorithm

#shortest_paths — RGL::DijkstraAlgorithm

#size — RGL::Graph

#strongly_connected_components — RGL::Graph

#tag_start — RGL::MutableGraph::MutableGraphParser

#tear_down — TestGraphXML

#test_0prop — TestDotEdge

#test_0prop — TestDotDirectedEdge

#test_1prop_0comma — TestDotNode

#test_1prop_0comma — TestDotEdge

#test_1prop_0comma — TestDotDirectedEdge

#test_2prop_1comma — TestDotNode

#test_2prop_1comma — TestDotEdge

#test_2prop_1comma — TestDotDirectedEdge

#test_Mrecord_label_no_ports — TestDotNode

#test_Mrecord_label_with_ports — TestDotNode

#test_Mrecord_no_label_no_ports — TestDotNode

#test_Mrecord_no_label_with_ports — TestDotNode

#test_acyclic — TestTraversal

#test_add — TestDirectedGraph

#test_add — TestUnDirectedGraph

#test_add_vertices — TestDirectedGraph

#test_add_vertices — TestUnDirectedGraph

#test_bfs_event_handlers — TestTraversal

#test_bfs_iterator_creation — TestTraversal

#test_bfs_search_tree — TestTraversal

#test_bfs_visiting — TestTraversal

#test_bipartite — TestBipartite

#test_bipartite_sets — TestBipartite

#test_bipartite_sets_for_bipartite_disconnected_graph — TestBipartite

#test_bipartite_sets_for_directed_graph — TestBipartite

#test_bipartite_sets_for_non_bipartite_disconnected_graph — TestBipartite

#test_bipartite_sets_for_non_bipartite_graph — TestBipartite

#test_connected_components — TestComponents

#test_creating_from_array — TestDirectedGraph

#test_cycle — TestImplicit

#test_cycles — TestCycles

#test_depth_first_search_with_parens — TestTraversal

#test_dfs_event_handlers — TestTraversal

#test_dfs_search_as_topsort — TestTraversal

#test_dfs_visit — TestTraversal

#test_dfs_visit_with_parens — TestTraversal

#test_dfs_visiting — TestTraversal

#test_digraph_statement — TestDotDigraph

#test_directed_edge — TestEdge

#test_directed_graph — TestEdgePropertiesMap

#test_directed_graph_validation — TestEdmondsKarp

#test_distance_map — TestTraversal

#test_edge_filtered_graph — TestImplicit

#test_edge_weights_map_object_in_argument — TestDijkstra

#test_edges — TestDirectedGraph

#test_edges — TestUnDirectedGraph

#test_edges_from_to? — TestDirectedGraph

#test_edges_from_to? — TestUnDirectedGraph

#test_edges_to_s — TestGraph

#test_element_containment — TestDotGraph

#test_element_containment — TestDotDigraph

#test_element_containment — TestDotSubgraph

#test_empty — TestImplicit

#test_empty_graph — TestDirectedGraph

#test_empty_graph — TestUnDirectedGraph

#test_equal_source_and_sink — TestEdmondsKarp

#test_equality — TestGraph

#test_graph_statement — TestDotGraph

#test_graphxml — TestGraphXML

#test_label — TestDotPort

#test_label_quoting — TestDotNode

#test_label_quoting — TestDotGraph

#test_label_quoting — TestDotDigraph

#test_label_quoting — TestDotSubgraph

#test_max_flow — TestEdmondsKarp

#test_max_flow_with_lambda_capacities_map — TestEdmondsKarp

#test_merge — TestGraph

#test_minimum_spanning_tree — TestPrim

#test_minimum_spanning_tree_edges — TestPrim

#test_minimum_spanning_tree_for_disconnected_graph — TestPrim

#test_missing_capacities_validation — TestEdmondsKarp

#test_missing_edge_weight — TestBellmanFord

#test_missing_edge_weight — TestDijkstra

#test_name — TestDotPort

#test_name_and_label — TestDotPort

#test_name_label_and_nested_ports — TestDotPort

#test_name_quoting — TestDotNode

#test_name_quoting — TestDotGraph

#test_name_quoting — TestDotDigraph

#test_name_quoting — TestDotSubgraph

#test_name_without_label — TestDotNode

#test_negative_capacities_validation — TestEdmondsKarp

#test_negative_cycles — TestBellmanFord

#test_negative_edge_weight — TestDijkstra

#test_negative_edge_weight_with_lambda — TestDijkstra

#test_negative_weights — TestPrim

#test_nested_ports — TestDotPort

#test_nil_properties — TestEdgePropertiesMap

#test_no_label — TestDotNode

#test_no_label — TestDotEdge

#test_no_label — TestDotDirectedEdge

#test_no_name — TestDotNode

#test_no_shape_no_label_no_ports — TestDotNode

#test_no_shape_no_label_with_ports — TestDotNode

#test_non_negative_properties_map — TestEdgePropertiesMap

#test_north_graphs — TestGraphXML

#test_not_bipartite — TestBipartite

#test_not_implemented — TestGraph

#test_option_quoting — TestDotNode

#test_option_quoting — TestDotGraph

#test_option_quoting — TestDotDigraph

#test_option_quoting — TestDotSubgraph

#test_path_for_unreachable_vertex — TestDijkstra

#test_record_label_no_ports — TestDotNode

#test_record_label_with_ports — TestDotNode

#test_record_no_label_no_ports — TestDotNode

#test_record_no_label_with_ports — TestDotNode

#test_remove_edges — TestDirectedGraph

#test_remove_edges — TestUnDirectedGraph

#test_reverse — TestDirectedGraph

#test_reverse — TestUnDirectedGraph

#test_reverse_edges_validation — TestEdmondsKarp

#test_set_edgelist_class — TestGraph

#test_shortest_path_search — TestDijkstraIssue24

#test_shortest_path_search — TestDijkstra

#test_shortest_path_search_with_lambda — TestDijkstra

#test_shortest_path_to_the_source — TestDijkstra

#test_shortest_paths_search — TestBellmanFord

#test_shortest_paths_search — TestDijkstra

#test_shortest_paths_search_with_lambda — TestBellmanFord

#test_shortest_paths_search_with_lambda — TestDijkstra

#test_shortest_paths_search_with_unreachable_vertex — TestBellmanFord

#test_shortest_paths_search_with_unreachable_vertex — TestDijkstra

#test_shortest_paths_with_negative_weights — TestBellmanFord

#test_strong_components — TestComponents

#test_subgraph_statement — TestDotSubgraph

#test_to_adjacency — TestGraph

#test_to_dot_digraph — TestDot

#test_to_dot_graph — TestDot

#test_to_undirected — TestDirectedGraph

#test_topsort — TestTraversal

#test_transitive_closure — TestTransitiveClosure

#test_transitive_closure_undirected — TestTransitiveClosure

#test_transitive_reduction — TestTransitiveClosure

#test_transitive_reduction_undirected — TestTransitiveClosure

#test_undirected_edge — TestEdge

#test_undirected_graph — TestEdgePropertiesMap

#test_unreachable_sink — TestEdmondsKarp

#test_vertex_filtered_graph — TestImplicit

#test_vertices — TestDirectedGraph

#test_vertices — TestUnDirectedGraph

#test_visitor — TestBellmanFord

#test_visitor — TestDijkstra

#test_visitor — TestPrim

#test_with_lambda — TestEdgePropertiesMap

#test_zero_capacities — TestEdmondsKarp

#test_zero_reverse_capacities_validation — TestEdmondsKarp

#to_a — RGL::Edge::DirectedEdge

#to_adjacency — RGL::Graph

#to_dot_graph — RGL::Graph

#to_s — RGL::Edge::DirectedEdge

#to_s — RGL::Edge::UnDirectedEdge

#to_s — RGL::DOT::Port

#to_s — RGL::DOT::Node

#to_s — RGL::DOT::Graph

#to_s — RGL::DOT::Edge

#to_s — RGL::Graph

#to_undirected — RGL::Graph

#topsort_iterator — RGL::Graph

#transitive_closure — RGL::Graph

#transitive_reduction — RGL::Graph

#unquote — Dependency

#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

Table of Contents - RDoc Documentation

Pages

Classes and Modules

Methods