Ruby » CommonRuby

  #   p TSort.tsort(each_node, each_child) # raises TSort::Cyclic

  #

  def TSort.tsort(each_node, each_child)

  end

  # The iterator version of the #tsort method.

  #   #   1

  #

  def TSort.tsort_each(each_node, each_child) # :yields: node

    TSort.each_strongly_connected_component(each_node, each_child) {|component|

      if component.size == 1

        yield component.first

  #   #=> [[4], [2, 3], [1]]

  #

  def TSort.strongly_connected_components(each_node, each_child)

  end

  # The iterator version of the #strongly_connected_components method.

  #   #   [1]

  #

  def TSort.each_strongly_connected_component(each_node, each_child) # :yields: nodes

    id_map = {}

    stack = []

    each_node.call {|node|

  #   #   [1]

  #

  def TSort.each_strongly_connected_component_from(node, each_child, id_map={}, stack=[]) # :yields: nodes

    minimum_id = node_id = id_map[node] = id_map.size

    stack_length = stack.length

    stack << node

    r = []

    TSort.tsort_each(each_node, each_child) {|n| r << n }

    assert_equal([4, 2, 3, 1], r)

  end

  def test_s_strongly_connected_components

      r << scc

    }

    assert_equal([[4], [2, 3], [1]], r)

  end

  def test_s_each_strongly_connected_component_from

      r << scc

    }

    assert_equal([[4], [2, 3], [1]], r)

  end

end