lib/rgl/adjacency.rb,998 module RGLRGL18,633 class DirectedAdjacencyGraphDirectedAdjacencyGraph20,645 def initialize (edgelist_class = Set)initialize39,1191 def each_vertex (&b)each_vertex46,1369 def each_adjacent (v, &b) # :nodoc:each_adjacent50,1436 def directed?directed?58,1628 def has_vertex? (v)has_vertex?65,1799 def has_edge? (u, v)has_edge?75,2023 def add_vertex (v)add_vertex84,2242 def add_edge (u, v)add_edge90,2355 def remove_vertex (v)remove_vertex98,2568 def remove_edge (u, v)remove_edge108,2788 def basic_add_edge (u, v)basic_add_edge114,2901 class AdjacencyGraph < DirectedAdjacencyGraph AdjacencyGraph124,3211 def directed? # Always returns false.directed?126,3261 def remove_edge (u, v)remove_edge132,3361 def basic_add_edge (u,v)basic_add_edge139,3486 module GraphGraph146,3623 def to_adjacencyto_adjacency151,3797 def reversereverse162,4177 def to_undirectedto_undirected176,4637 lib/rgl/base.rb,2023 module EnumerableEnumerable10,277 def inject(*argv)inject11,297 module EnumerableEnumerable39,787 def lengthlength46,979 module RGLRGL53,1050 class NotDirectedError < RuntimeError; endNotDirectedError54,1061 class NotUndirectedError < RuntimeError; endNotUndirectedError55,1106 class NoVertexError < IndexError; endNoVertexError57,1154 class NoEdgeError < IndexError; endNoEdgeError58,1194 module EdgeEdge63,1423 class DirectedEdgeDirectedEdge69,1762 def initialize (a,b)initialize78,2009 def eql?(edge)eql?84,2242 def reversereverse90,2390 def to_sto_s99,2702 def to_a; [source,target]; endto_a103,2802 class UnDirectedEdge < DirectedEdgeUnDirectedEdge113,3152 def eql?(edge)eql?114,3192 def hashhash118,3297 def to_s; "(#{source}=#{target})"; endto_s123,3407 module GraphGraph140,4274 def each_vertexeach_vertex147,4502 def each_adjacent (v)each_adjacent155,4787 def each_edge (&block)each_edge167,5315 def each(&block); each_vertex(&block); endeach180,5654 def directed?; false; enddirected?183,5762 def has_vertex?(v); include?(v); end # inherited from enumerablehas_vertex?188,6000 def empty?; num_vertices.zero?; endempty?193,6193 def vertices; to_a; endvertices196,6312 def edge_class; directed? ? DirectedEdge : UnDirectedEdge; endedge_class199,6408 def edgesedges203,6625 def adjacent_vertices (v)adjacent_vertices211,6806 def out_degree (v)out_degree219,7039 def size() # Why not in Enumerable?size226,7166 def num_vertices; size; endnum_vertices232,7330 def num_edges; r = 0; each_edge {|u,v| r +=1}; r; endnum_edges235,7398 def to_sto_s238,7537 def each_edge_auxeach_edge_aux244,7598 module BidirectionalGraphBidirectionalGraph268,8533 def each_in_neighbor (v)each_in_neighbor275,8888 def in_degree (v)in_degree282,9112 def degree (v)degree290,9356 lib/rgl/connected_components.rb,527 module RGLRGL9,261 module GraphGraph11,273 def each_connected_componenteach_connected_component23,720 class TarjanSccVisitor < DFSVisitorTarjanSccVisitor41,1322 def initialize (g)initialize47,1473 def handle_examine_vertex (v)handle_examine_vertex57,1721 def handle_finish_vertex (v)handle_finish_vertex65,1912 def num_compnum_comp85,2561 def min_discover_time (u, v)min_discover_time91,2623 def strongly_connected_componentsstrongly_connected_components129,4218 lib/rgl/dot.rb,309 module RGLRGL11,251 module GraphGraph13,263 def to_dot_graph (params = {})to_dot_graph19,447 def print_dotted_on (params = {}, s = $stdout)print_dotted_on40,1239 def dotty (params = {})dotty47,1453 def write_to_graphic_file (fmt='png', dotfile="graph")write_to_graphic_file58,1744 lib/rgl/graphxml.rb,359 module RGLRGL18,614 module GraphXMLGraphXML27,905 class MutableGraphParserMutableGraphParser29,924 def initialize (graph)initialize35,1017 def tag_start (name, attrs)tag_start39,1080 def MutableGraph.append_features (includingClass)append_features50,1341 def includingClass.from_graphxml (source)from_graphxml55,1473 lib/rgl/implicit.rb,704 module RGLRGL23,730 class ImplicitGraphImplicitGraph25,742 def initializeinitialize39,1182 def directed?directed?48,1440 def each_vertex (&block) # :nodoc:each_vertex52,1491 def each_adjacent (v, &block) # :nodoc:each_adjacent56,1576 def each_edge (&block) # :nodoc:each_edge60,1670 def vertex_iterator (&block)vertex_iterator72,1997 def adjacent_iterator (&block)adjacent_iterator85,2365 def edge_iterator (&block)edge_iterator93,2623 module GraphGraph100,2723 def vertices_filtered_by (&filter)vertices_filtered_by126,3533 def edges_filtered_by (&filter)edges_filtered_by146,4175 def implicit_graphimplicit_graph163,4698 lib/rgl/mutable.rb,382 module RGLRGL5,34 module MutableGraphMutableGraph10,137 def add_vertex (v)add_vertex17,310 def add_edge (u, v)add_edge29,770 def add_vertices (*a)add_vertices35,884 def add_edges (*edges)add_edges43,1127 def remove_vertex (v)remove_vertex53,1512 def remove_edge (u, v)remove_edge63,1831 def remove_vertices (*a)remove_vertices70,1998 lib/rgl/rdot.rb,1493 module DOTDOT10,254 def change_tab (t)change_tab19,428 class DOTSimpleElementDOTSimpleElement118,4745 def initialize (params = {})initialize122,4796 def to_sto_s126,4890 class DOTElement < DOTSimpleElementDOTElement133,4992 def initialize (params = {}, option_list = [])initialize138,5092 def each_optioneach_option149,5451 def each_option_paireach_option_pair153,5515 class DOTPort < DOTSimpleElementDOTPort168,5840 def initialize (params = {})initialize172,5910 def to_sto_s177,6025 class DOTNode < DOTElementDOTNode184,6140 def initialize (params = {}, option_list = NODE_OPTS)initialize188,6182 def each_porteach_port193,6336 def push (thing)push201,6447 def poppop205,6502 def to_s (t = '')to_s209,6540 class DOTSubgraph < DOTElementDOTSubgraph238,7531 def initialize (params = {}, option_list = GRAPH_OPTS)initialize243,7593 def each_nodeeach_node249,7781 def push (thing)push257,7898 def poppop261,7955 def to_s (t = '')to_s265,7993 class DOTDigraph < DOTSubgraphDOTDigraph284,8473 def initialize (params = {}, option_list = GRAPH_OPTS)initialize286,8507 class DOTEdge < DOTElementDOTEdge295,8687 def initialize (params = {}, option_list = EDGE_OPTS)initialize299,8747 def edge_linkedge_link305,8954 def to_s (t = '')to_s309,8992 class DOTDirectedEdge < DOTEdgeDOTDirectedEdge320,9341 def edge_linkedge_link322,9376 lib/rgl/topsort.rb,484 module RGLRGL5,39 class TopsortIteratorTopsortIterator17,521 def initialize (g)initialize21,573 def set_to_begin # :nodoc:set_to_begin26,639 def basic_forward # :nodoc:basic_forward42,1017 def at_beginning?; true; end # :nodoc: FIXMEat_beginning?51,1213 def at_end?; @waiting.empty?; end # :nodoc:at_end?52,1273 module GraphGraph56,1360 def topsort_iteratortopsort_iterator60,1410 def acyclic?acyclic?67,1627 lib/rgl/transitiv_closure.rb,131 module RGLRGL12,362 module GraphGraph14,374 def transitive_closure_floyd_warshaltransitive_closure_floyd_warshal23,721 lib/rgl/traversal.rb,1779 module RGLRGL16,593 module GraphWrapper # :nodoc:GraphWrapper18,605 def initialize (graph)initialize23,743 module GraphIteratorGraphIterator31,1009 module GraphVisitorGraphVisitor66,2413 def initialize (graph)initialize74,2535 def resetreset81,2649 def finished_vertex? (v)finished_vertex?87,2777 def attach_distance_map (map = Hash.new(0))attach_distance_map100,3220 def handle_tree_edge (u, v)handle_tree_edge105,3312 def distance_to_root (v)distance_to_root112,3471 def follow_edge? (u, v) # :nodoc:follow_edge?121,3630 def self.def_event_handler (m)def_event_handler127,3740 def handle_#{m} (#{params})handle_130,3841 def set_#{m}_event_handler (&b)set_134,3968 class BFSIteratorBFSIterator160,4865 def initialize (graph, start=graph.detect{ |x| true })initialize169,5043 def at_beginning? # :nodoc:at_beginning?177,5258 def at_end?at_end?183,5379 def set_to_beginset_to_begin189,5503 def basic_forward # :nodoc:basic_forward195,5685 def next_vertex # :nodoc:next_vertex219,6414 module GraphGraph226,6532 def bfs_iterator (v = self.detect { |x| true})bfs_iterator230,6602 def bfs_search_tree_from (v)bfs_search_tree_from238,6910 class DFSIterator < BFSIteratorDFSIterator258,7523 def next_vertexnext_vertex260,7558 class DFSVisitorDFSVisitor279,8231 module GraphGraph288,8357 def dfs_iterator (v = self.detect { |x| true })dfs_iterator292,8425 def depth_first_search (vis = DFSVisitor.new(self), &b)depth_first_search300,8706 def depth_first_visit (u, vis = DFSVisitor.new(self), &b)depth_first_visit312,9047 def acyclic?acyclic?337,9940 lib/rgl/xx.rb,1766 module EnumerableEnumerable15,316 def inject (*argv)inject17,337 module EnumerableEnumerable47,910 def lengthlength56,1106 module RGLRGL65,1200 class NotDirectedError < RuntimeError; end NotDirectedError67,1212 class NotUndirectedError < RuntimeError; end NotUndirectedError68,1261 class NoVertexError < IndexError; end NoVertexError69,1310 class NoEdgeError < IndexError; endNoEdgeError70,1359 module EdgeEdge76,1600 class DirectedEdgeDirectedEdge84,1940 def initialize (a, b)initialize96,2192 def eql? (edge)eql?104,2441 def reversereverse112,2592 def to_sto_s125,2921 def to_ato_a131,3024 class UnDirectedEdge < DirectedEdgeUnDirectedEdge146,3378 def eql? (edge)eql?148,3419 def hashhash152,3529 def to_sto_s158,3644 module GraphGraph181,4544 def each_vertexeach_vertex190,4775 def each_adjacent (v)each_adjacent199,5049 def each_edge (&block)each_edge212,5565 def each (&block)each226,5916 def directed?directed?232,6039 def has_vertex? (v)has_vertex?240,6291 def empty?empty?248,6495 def verticesvertices254,6625 def edge_classedge_class260,6730 def edgesedges267,6956 def adjacent_vertices (v)adjacent_vertices276,7143 def out_degree (v)out_degree285,7379 def size # Why not in Enumerable?size293,7508 def num_verticesnum_vertices303,7716 def num_edgesnum_edges309,7793 def to_sto_s317,7954 def each_edge_auxeach_edge_aux323,8019 module BidirectionalGraphBidirectionalGraph349,8937 def each_in_neighbor (v)each_in_neighbor359,9301 def in_degree (v)in_degree367,9530 def degree (v)degree376,9775