Gecko [ beacons-mine.com ]

Name	Size	Permission	Date
bigdecimal	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
cgi	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
date	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
digest	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
dl	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
drb	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
io	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
irb	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
net	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
openssl	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
optparse	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
racc	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
rdoc	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
rexml	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
rinda	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
rss	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
runit	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
shell	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
soap	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
test	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
uri	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
webrick	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
wsdl	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
x86_64-linux	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
xmlrpc	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
xsd	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
yaml	[ DIR ]	drwxr-xr-x	2026-02-18 15:11
English.rb	5.6 KB	-rw-r--r--	2007-02-13 04:31
Env.rb	274 B	-rw-r--r--	2007-02-13 04:31
abbrev.rb	2.5 KB	-rw-r--r--	2007-02-13 04:31
base64.rb	3.37 KB	-rw-r--r--	2007-07-16 21:17
benchmark.rb	17.73 KB	-rw-r--r--	2008-02-10 20:54
cgi-lib.rb	6.89 KB	-rw-r--r--	2007-02-13 04:31
cgi.rb	73.74 KB	-rw-r--r--	2009-12-14 08:10
complex.rb	12.84 KB	-rw-r--r--	2009-08-03 11:29
csv.rb	24.46 KB	-rw-r--r--	2007-02-13 04:31
date.rb	53.02 KB	-rw-r--r--	2010-06-08 10:15
date2.rb	128 B	-rw-r--r--	2007-02-13 04:31
debug.rb	20.61 KB	-rw-r--r--	2007-02-13 04:31
delegate.rb	8.81 KB	-rw-r--r--	2009-07-16 06:05
digest.rb	1.12 KB	-rw-r--r--	2007-07-28 06:10
drb.rb	19 B	-rw-r--r--	2007-02-13 04:31
e2mmap.rb	4.04 KB	-rw-r--r--	2007-02-13 04:31
erb.rb	21.38 KB	-rw-r--r--	2009-02-23 23:14
eregex.rb	487 B	-rw-r--r--	2007-02-13 04:31
expect.rb	633 B	-rw-r--r--	2008-02-18 06:47
fileutils.rb	42.23 KB	-rw-r--r--	2011-05-21 03:59
finalize.rb	5.38 KB	-rw-r--r--	2007-02-13 04:31
find.rb	1.84 KB	-rw-r--r--	2007-02-13 04:31
forwardable.rb	6.16 KB	-rw-r--r--	2008-06-06 13:35
ftools.rb	6.17 KB	-rw-r--r--	2007-02-13 04:31
generator.rb	8.1 KB	-rw-r--r--	2008-04-10 16:22
getoptlong.rb	14.88 KB	-rw-r--r--	2007-02-13 04:31
getopts.rb	2.25 KB	-rw-r--r--	2007-02-13 04:31
gserver.rb	6.43 KB	-rw-r--r--	2007-02-13 04:31
importenv.rb	590 B	-rw-r--r--	2007-02-13 04:31
ipaddr.rb	21.96 KB	-rw-r--r--	2008-07-12 20:38
irb.rb	7.43 KB	-rw-r--r--	2009-08-09 14:14
jcode.rb	4.3 KB	-rw-r--r--	2007-02-13 04:31
kconv.rb	8.12 KB	-rw-r--r--	2007-02-13 04:31
logger.rb	17.59 KB	-rw-r--r--	2011-05-30 07:38
mailread.rb	1.28 KB	-rw-r--r--	2007-02-13 04:31
mathn.rb	5.42 KB	-rw-r--r--	2007-02-13 04:31
matrix.rb	27.21 KB	-rw-r--r--	2009-01-24 20:32
md5.rb	411 B	-rw-r--r--	2007-03-06 15:39
mkmf.rb	50.65 KB	-rw-r--r--	2010-12-04 12:04
monitor.rb	7.93 KB	-rw-r--r--	2009-11-25 13:15
mutex_m.rb	2.07 KB	-rw-r--r--	2007-02-13 04:31
observer.rb	5.15 KB	-rw-r--r--	2007-02-13 04:31
open-uri.rb	20.49 KB	-rw-r--r--	2007-10-08 16:46
open3.rb	2.1 KB	-rw-r--r--	2009-12-14 09:58
openssl.rb	575 B	-rw-r--r--	2010-11-22 12:51
optparse.rb	47.12 KB	-rw-r--r--	2009-02-20 17:13
ostruct.rb	3.35 KB	-rw-r--r--	2009-05-26 17:36
parsearg.rb	1.55 KB	-rw-r--r--	2007-02-13 04:31
parsedate.rb	1.33 KB	-rw-r--r--	2007-02-13 04:31
pathname.rb	29.39 KB	-rw-r--r--	2010-11-23 13:51
ping.rb	1.48 KB	-rw-r--r--	2007-02-13 04:31
pp.rb	15.97 KB	-rw-r--r--	2007-06-07 15:36
prettyprint.rb	18.33 KB	-rw-r--r--	2007-02-17 01:23
profile.rb	90 B	-rw-r--r--	2007-02-13 04:31
profiler.rb	1.59 KB	-rw-r--r--	2007-02-13 04:31
pstore.rb	11.15 KB	-rw-r--r--	2008-06-06 13:35
rational.rb	12.05 KB	-rw-r--r--	2010-06-08 10:32
readbytes.rb	835 B	-rw-r--r--	2007-02-13 04:31
resolv-replace.rb	1.55 KB	-rw-r--r--	2008-08-08 07:28
resolv.rb	56.83 KB	-rw-r--r--	2010-12-23 08:52
rss.rb	504 B	-rw-r--r--	2007-10-21 17:49
rubyunit.rb	180 B	-rw-r--r--	2007-02-13 04:31
scanf.rb	20.63 KB	-rw-r--r--	2009-01-20 08:53
securerandom.rb	4.27 KB	-rw-r--r--	2011-12-10 17:47
set.rb	27.08 KB	-rw-r--r--	2008-06-09 14:50
sha1.rb	418 B	-rw-r--r--	2007-03-06 15:39
shell.rb	4.66 KB	-rw-r--r--	2007-02-13 04:31
shellwords.rb	3.99 KB	-rw-r--r--	2008-03-21 17:46
singleton.rb	8.08 KB	-rw-r--r--	2008-07-03 16:44
sync.rb	6.09 KB	-rw-r--r--	2009-02-19 22:11
tempfile.rb	4.86 KB	-rw-r--r--	2008-04-21 15:13
thread.rb	104 B	-rw-r--r--	2007-02-14 01:09
thwait.rb	4.32 KB	-rw-r--r--	2010-06-08 12:38
time.rb	31.58 KB	-rw-r--r--	2008-06-06 13:35
timeout.rb	3 KB	-rw-r--r--	2010-06-08 11:54
tmpdir.rb	3.69 KB	-rw-r--r--	2009-01-26 07:42
tracer.rb	2.73 KB	-rw-r--r--	2007-02-13 04:31
tsort.rb	7.99 KB	-rw-r--r--	2007-02-13 04:31
un.rb	4.54 KB	-rw-r--r--	2007-02-13 04:31
uri.rb	710 B	-rw-r--r--	2008-04-15 15:11
weakref.rb	2.68 KB	-rw-r--r--	2007-02-13 04:31
webrick.rb	811 B	-rw-r--r--	2007-02-13 04:31
yaml.rb	12.36 KB	-rw-r--r--	2008-04-19 17:15

Rename

#!/usr/bin/env ruby
#--
# tsort.rb - provides a module for topological sorting and strongly connected components.
#++
#

#
# TSort implements topological sorting using Tarjan's algorithm for
# strongly connected components.
#
# TSort is designed to be able to be used with any object which can be
# interpreted as a directed graph.
#
# TSort requires two methods to interpret an object as a graph,
# tsort_each_node and tsort_each_child.
#
# * tsort_each_node is used to iterate for all nodes over a graph.
# * tsort_each_child is used to iterate for child nodes of a given node.
#
# The equality of nodes are defined by eql? and hash since
# TSort uses Hash internally.
#
# == A Simple Example
#
# The following example demonstrates how to mix the TSort module into an
# existing class (in this case, Hash). Here, we're treating each key in
# the hash as a node in the graph, and so we simply alias the required
# #tsort_each_node method to Hash's #each_key method. For each key in the
# hash, the associated value is an array of the node's child nodes. This
# choice in turn leads to our implementation of the required #tsort_each_child
# method, which fetches the array of child nodes and then iterates over that
# array using the user-supplied block.
#
# require 'tsort'
# 
# class Hash
# include TSort
# alias tsort_each_node each_key
# def tsort_each_child(node, &block)
# fetch(node).each(&block)
# end
# end
# 
# {1=>[2, 3], 2=>[3], 3=>[], 4=>[]}.tsort
# #=> [3, 2, 1, 4]
# 
# {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}.strongly_connected_components
# #=> [[4], [2, 3], [1]]
#
# == A More Realistic Example
#
# A very simple `make' like tool can be implemented as follows:
#
# require 'tsort'
# 
# class Make
# def initialize
# @dep = {}
# @dep.default = []
# end
# 
# def rule(outputs, inputs=[], &block)
# triple = [outputs, inputs, block]
# outputs.each {|f| @dep[f] = [triple]}
# @dep[triple] = inputs
# end
# 
# def build(target)
# each_strongly_connected_component_from(target) {|ns|
# if ns.length != 1
# fs = ns.delete_if {|n| Array === n}
# raise TSort::Cyclic.new("cyclic dependencies: #{fs.join ', '}")
# end
# n = ns.first
# if Array === n
# outputs, inputs, block = n
# inputs_time = inputs.map {|f| File.mtime f}.max
# begin
# outputs_time = outputs.map {|f| File.mtime f}.min
# rescue Errno::ENOENT
# outputs_time = nil
# end
# if outputs_time == nil ||
# inputs_time != nil && outputs_time <= inputs_time
# sleep 1 if inputs_time != nil && inputs_time.to_i == Time.now.to_i
# block.call
# end
# end
# }
# end
# 
# def tsort_each_child(node, &block)
# @dep[node].each(&block)
# end
# include TSort
# end
# 
# def command(arg)
# print arg, "\n"
# system arg
# end
# 
# m = Make.new
# m.rule(%w[t1]) { command 'date > t1' }
# m.rule(%w[t2]) { command 'date > t2' }
# m.rule(%w[t3]) { command 'date > t3' }
# m.rule(%w[t4], %w[t1 t3]) { command 'cat t1 t3 > t4' }
# m.rule(%w[t5], %w[t4 t2]) { command 'cat t4 t2 > t5' }
# m.build('t5')
#
# == Bugs
#
# * 'tsort.rb' is wrong name because this library uses
# Tarjan's algorithm for strongly connected components.
# Although 'strongly_connected_components.rb' is correct but too long.
#
# == References
#
# R. E. Tarjan, "Depth First Search and Linear Graph Algorithms",
# SIAM Journal on Computing, Vol. 1, No. 2, pp. 146-160, June 1972.
#

module TSort
 class Cyclic < StandardError
 end

#
 # Returns a topologically sorted array of nodes.
 # The array is sorted from children to parents, i.e.
 # the first element has no child and the last node has no parent.
 #
 # If there is a cycle, TSort::Cyclic is raised.
 #
 def tsort
 result = []
 tsort_each {|element| result << element}
 result
 end

#
 # The iterator version of the #tsort method.
 # <tt>obj.tsort_each</tt> is similar to <tt>obj.tsort.each</tt>, but
 # modification of _obj_ during the iteration may lead to unexpected results.
 #
 # #tsort_each returns +nil+.
 # If there is a cycle, TSort::Cyclic is raised.
 #
 def tsort_each # :yields: node
 each_strongly_connected_component {|component|
 if component.size == 1
 yield component.first
 else
 raise Cyclic.new("topological sort failed: #{component.inspect}")
 end
 }
 end

#
 # Returns strongly connected components as an array of arrays of nodes.
 # The array is sorted from children to parents.
 # Each elements of the array represents a strongly connected component.
 #
 def strongly_connected_components
 result = []
 each_strongly_connected_component {|component| result << component}
 result
 end

#
 # The iterator version of the #strongly_connected_components method.
 # <tt>obj.each_strongly_connected_component</tt> is similar to
 # <tt>obj.strongly_connected_components.each</tt>, but
 # modification of _obj_ during the iteration may lead to unexpected results.
 #
 #
 # #each_strongly_connected_component returns +nil+.
 #
 def each_strongly_connected_component # :yields: nodes
 id_map = {}
 stack = []
 tsort_each_node {|node|
 unless id_map.include? node
 each_strongly_connected_component_from(node, id_map, stack) {|c|
 yield c
 }
 end
 }
 nil
 end

#
 # Iterates over strongly connected component in the subgraph reachable from 
 # _node_.
 #
 # Return value is unspecified.
 #
 # #each_strongly_connected_component_from doesn't call #tsort_each_node.
 #
 def each_strongly_connected_component_from(node, id_map={}, stack=[]) # :yields: nodes
 minimum_id = node_id = id_map[node] = id_map.size
 stack_length = stack.length
 stack << node

tsort_each_child(node) {|child|
 if id_map.include? child
 child_id = id_map[child]
 minimum_id = child_id if child_id && child_id < minimum_id
 else
 sub_minimum_id =
 each_strongly_connected_component_from(child, id_map, stack) {|c|
 yield c
 }
 minimum_id = sub_minimum_id if sub_minimum_id < minimum_id
 end
 }

if node_id == minimum_id
      component = stack.slice!(stack_length .. -1)
      component.each {|n| id_map[n] = nil}
      yield component
    end

minimum_id
  end

#
  # Should be implemented by a extended class.
  #
  # #tsort_each_node is used to iterate for all nodes over a graph.
  #
  def tsort_each_node # :yields: node
    raise NotImplementedError.new
  end

#
  # Should be implemented by a extended class.
  #
  # #tsort_each_child is used to iterate for child nodes of _node_.
  #
  def tsort_each_child(node) # :yields: child
    raise NotImplementedError.new
  end
end

if __FILE__ == $0
  require 'test/unit'

class TSortHash < Hash # :nodoc:
 include TSort
 alias tsort_each_node each_key
 def tsort_each_child(node, &block)
 fetch(node).each(&block)
 end
 end

class TSortArray < Array # :nodoc:
 include TSort
 alias tsort_each_node each_index
 def tsort_each_child(node, &block)
 fetch(node).each(&block)
 end
 end

class TSortTest < Test::Unit::TestCase # :nodoc:
 def test_dag
 h = TSortHash[{1=>[2, 3], 2=>[3], 3=>[]}]
 assert_equal([3, 2, 1], h.tsort)
 assert_equal([[3], [2], [1]], h.strongly_connected_components)
 end

def test_cycle
      h = TSortHash[{1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}]
      assert_equal([[4], [2, 3], [1]],
        h.strongly_connected_components.map {|nodes| nodes.sort})
      assert_raise(TSort::Cyclic) { h.tsort }
    end

def test_array
      a = TSortArray[[1], [0], [0], [2]]
      assert_equal([[0, 1], [2], [3]],
        a.strongly_connected_components.map {|nodes| nodes.sort})

a = TSortArray[[], [0]]
      assert_equal([[0], [1]],
        a.strongly_connected_components.map {|nodes| nodes.sort})
    end
  end

end