Gecko [ www.corporacionhdm.com.pe ]

Name	Size	Permission	Date
cgi	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
date	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
digest	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
dl	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
drb	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
fiddle	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
irb	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
json	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
matrix	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
net	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
openssl	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
optparse	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
psych	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
racc	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
rake	[ DIR ]	drwxr-xr-x	2024-03-03 22:50
rbconfig	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
rdoc	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
rexml	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
rinda	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
ripper	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
rss	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
rubygems	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
shell	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
syck	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
test	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
uri	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
webrick	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
x86_64-linux	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
xmlrpc	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
yaml	[ DIR ]	drwxr-xr-x	2024-03-03 22:48
English.rb	5.59 KB	-rw-r--r--	2009-10-02 10:45
abbrev.rb	2.57 KB	-rw-r--r--	2011-05-18 21:19
base64.rb	2.63 KB	-rw-r--r--	2009-10-02 10:45
benchmark.rb	18 KB	-rw-r--r--	2011-06-28 06:09
cgi.rb	9.3 KB	-rw-r--r--	2011-05-16 21:21
cmath.rb	7.22 KB	-rw-r--r--	2011-07-30 14:53
complex.rb	380 B	-rw-r--r--	2009-08-16 15:34
csv.rb	82.66 KB	-rw-r--r--	2011-07-21 21:40
date.rb	946 B	-rw-r--r--	2011-05-21 12:25
debug.rb	23.23 KB	-rw-r--r--	2011-06-28 11:45
delegate.rb	9.74 KB	-rw-r--r--	2011-07-27 19:56
digest.rb	2.24 KB	-rw-r--r--	2011-05-16 20:52
dl.rb	176 B	-rw-r--r--	2010-06-12 15:28
drb.rb	19 B	-rw-r--r--	2009-10-02 10:45
e2mmap.rb	3.8 KB	-rw-r--r--	2011-05-19 00:07
erb.rb	25.72 KB	-rw-r--r--	2012-12-13 05:24
expect.rb	1.33 KB	-rw-r--r--	2011-08-26 23:54
fiddle.rb	928 B	-rw-r--r--	2011-08-16 00:51
fileutils.rb	45.32 KB	-rw-r--r--	2012-02-25 08:11
find.rb	2.03 KB	-rw-r--r--	2011-05-18 21:19
forwardable.rb	7.64 KB	-rw-r--r--	2011-05-22 02:14
getoptlong.rb	15.38 KB	-rw-r--r--	2011-05-19 00:07
gserver.rb	8.83 KB	-rw-r--r--	2013-10-31 14:40
ipaddr.rb	24.92 KB	-rw-r--r--	2013-04-11 02:31
irb.rb	8.34 KB	-rw-r--r--	2011-05-19 00:07
json.rb	1.74 KB	-rw-r--r--	2011-08-30 02:25
kconv.rb	5.74 KB	-rw-r--r--	2010-12-07 11:47
logger.rb	20.85 KB	-rw-r--r--	2011-05-19 00:07
mathn.rb	6.52 KB	-rw-r--r--	2011-08-26 23:54
matrix.rb	47.65 KB	-rw-r--r--	2011-07-09 19:11
mkmf.rb	68.9 KB	-rw-r--r--	2014-02-06 05:20
monitor.rb	6.94 KB	-rw-r--r--	2011-06-17 22:33
mutex_m.rb	1.61 KB	-rw-r--r--	2011-05-19 00:07
observer.rb	5.69 KB	-rw-r--r--	2011-05-16 21:53
open-uri.rb	25.84 KB	-rw-r--r--	2014-02-24 03:43
open3.rb	20.64 KB	-rw-r--r--	2011-05-18 21:19
openssl.rb	547 B	-rw-r--r--	2011-07-25 06:38
optparse.rb	51.13 KB	-rw-r--r--	2014-02-14 04:52
ostruct.rb	6.49 KB	-rw-r--r--	2012-02-24 14:49
pathname.rb	14.21 KB	-rw-r--r--	2011-08-26 23:54
pp.rb	13.31 KB	-rw-r--r--	2010-08-01 14:09
prettyprint.rb	9.63 KB	-rw-r--r--	2011-08-02 15:25
prime.rb	13.98 KB	-rw-r--r--	2011-06-01 00:21
profile.rb	205 B	-rw-r--r--	2009-10-02 10:45
profiler.rb	1.59 KB	-rw-r--r--	2009-10-02 10:45
pstore.rb	15.81 KB	-rw-r--r--	2011-10-10 23:14
psych.rb	9.82 KB	-rw-r--r--	2012-08-07 20:50
rake.rb	2.02 KB	-rw-r--r--	2011-06-29 03:09
rational.rb	308 B	-rw-r--r--	2009-09-24 00:42
rdoc.rb	4.29 KB	-rw-r--r--	2013-02-06 08:00
resolv-replace.rb	1.74 KB	-rw-r--r--	2010-10-29 22:02
resolv.rb	59.91 KB	-rw-r--r--	2014-02-14 06:56
ripper.rb	91 B	-rw-r--r--	2009-10-02 10:45
rss.rb	2.84 KB	-rw-r--r--	2011-05-11 10:22
rubygems.rb	34.13 KB	-rw-r--r--	2013-12-22 04:38
scanf.rb	23.53 KB	-rw-r--r--	2011-05-20 12:22
securerandom.rb	8.46 KB	-rw-r--r--	2012-05-07 11:25
set.rb	29.91 KB	-rw-r--r--	2012-02-10 08:28
shell.rb	5.9 KB	-rw-r--r--	2011-05-19 00:07
shellwords.rb	3.88 KB	-rw-r--r--	2012-02-12 07:51
singleton.rb	4.02 KB	-rw-r--r--	2011-05-18 14:09
socket.rb	23.22 KB	-rw-r--r--	2014-01-30 12:04
syck.rb	13.91 KB	-rw-r--r--	2010-07-19 04:54
sync.rb	6.87 KB	-rw-r--r--	2011-06-29 03:09
tempfile.rb	10.42 KB	-rw-r--r--	2013-10-31 14:44
thread.rb	6.59 KB	-rw-r--r--	2014-02-14 03:48
thwait.rb	3.38 KB	-rw-r--r--	2011-06-29 03:09
time.rb	17.03 KB	-rw-r--r--	2013-10-31 14:06
timeout.rb	3.26 KB	-rw-r--r--	2013-04-02 04:09
tmpdir.rb	3.72 KB	-rw-r--r--	2011-05-18 21:19
tracer.rb	6.63 KB	-rw-r--r--	2011-06-29 13:19
tsort.rb	6.79 KB	-rw-r--r--	2009-03-06 04:23
ubygems.rb	268 B	-rw-r--r--	2009-10-02 10:45
un.rb	8.32 KB	-rw-r--r--	2011-05-19 00:07
uri.rb	3.07 KB	-rw-r--r--	2011-05-13 20:03
weakref.rb	2.29 KB	-rw-r--r--	2011-08-26 23:54
webrick.rb	6.8 KB	-rw-r--r--	2011-05-10 23:37
yaml.rb	2.58 KB	-rw-r--r--	2013-05-29 12:00

Rename

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