Parent

Included Modules

Files

RGL::TopsortIterator

Topological Sort Iterator

The topological sort algorithm creates a linear ordering of the vertices such that if edge (u,v) appears in the graph, then u comes before v in the ordering. The graph must be a directed acyclic graph (DAG).

The iterator can also be applied to undirected graph or to a DG graph which contains a cycle. In this case, the Iterator does not reach all vertices. The implementation of acyclic? uses this fact.

Public Class Methods

new(g) click to toggle source
# File lib/rgl/topsort.rb, line 21
def initialize (g)
  super(g)
  set_to_begin
end

Public Instance Methods

at_beginning?() click to toggle source
# File lib/rgl/topsort.rb, line 51
def at_beginning?; true;            end
at_end?() click to toggle source
# File lib/rgl/topsort.rb, line 52
def at_end?;       @waiting.empty?; end

[Validate]

Generated with the Darkfish Rdoc Generator 2.