Gecko [ www.corporacionhdm.com.pe ]

Name	Size	Permission	Date
cgi	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
digest	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
drb	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
fiddle	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
io	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
irb	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
json	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
matrix	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
net	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
openssl	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
optparse	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
psych	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
racc	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
rake	[ DIR ]	drwxr-xr-x	2024-03-03 22:53
rbconfig	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
rdoc	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
rexml	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
rinda	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
ripper	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
rss	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
rubygems	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
shell	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
syslog	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
unicode_normalize	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
uri	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
webrick	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
x86_64-linux	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
xmlrpc	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
yaml	[ DIR ]	drwxr-xr-x	2024-03-03 22:43
English.rb	6.42 KB	-rw-r--r--	2014-05-31 19:54
abbrev.rb	3.46 KB	-rw-r--r--	2014-07-11 08:16
base64.rb	2.63 KB	-rw-r--r--	2013-05-19 03:10
benchmark.rb	17.73 KB	-rw-r--r--	2014-09-11 08:09
cgi.rb	9.77 KB	-rw-r--r--	2014-08-07 06:14
cmath.rb	9.34 KB	-rw-r--r--	2015-07-03 19:31
csv.rb	82.45 KB	-rw-r--r--	2014-11-04 03:21
date.rb	980 B	-rw-r--r--	2023-07-26 14:31
debug.rb	29.08 KB	-rw-r--r--	2013-12-14 14:48
delegate.rb	10.71 KB	-rw-r--r--	2014-07-26 17:11
digest.rb	2.79 KB	-rw-r--r--	2023-07-26 14:31
drb.rb	19 B	-rw-r--r--	2009-10-02 10:45
e2mmap.rb	3.77 KB	-rw-r--r--	2014-08-24 07:16
erb.rb	26.35 KB	-rw-r--r--	2014-12-12 10:48
expect.rb	2.14 KB	-rw-r--r--	2023-07-26 14:31
fiddle.rb	1.65 KB	-rw-r--r--	2023-07-26 14:31
fileutils.rb	47.46 KB	-rw-r--r--	2017-03-25 18:24
find.rb	2.48 KB	-rw-r--r--	2014-10-13 07:34
forwardable.rb	8.22 KB	-rw-r--r--	2017-03-25 14:43
getoptlong.rb	15.38 KB	-rw-r--r--	2013-05-19 14:50
ipaddr.rb	17.06 KB	-rw-r--r--	2015-11-24 15:49
irb.rb	20.03 KB	-rw-r--r--	2016-03-28 15:07
json.rb	1.74 KB	-rw-r--r--	2023-07-26 14:31
kconv.rb	5.74 KB	-rw-r--r--	2023-07-26 14:31
logger.rb	20.33 KB	-rw-r--r--	2016-10-27 07:47
mathn.rb	3.84 KB	-rw-r--r--	2014-08-26 12:07
matrix.rb	53.14 KB	-rw-r--r--	2014-11-27 01:03
mkmf.rb	82.59 KB	-rw-r--r--	2023-07-26 14:29
monitor.rb	6.93 KB	-rw-r--r--	2012-11-16 16:55
mutex_m.rb	2 KB	-rw-r--r--	2013-02-20 02:51
observer.rb	5.8 KB	-rw-r--r--	2014-08-27 12:21
open-uri.rb	24.58 KB	-rw-r--r--	2014-12-24 09:11
open3.rb	20.55 KB	-rw-r--r--	2014-11-04 03:09
openssl.rb	528 B	-rw-r--r--	2023-07-26 14:31
optionparser.rb	28 B	-rw-r--r--	2014-05-26 03:25
optparse.rb	52.05 KB	-rw-r--r--	2017-03-25 18:28
ostruct.rb	8.66 KB	-rw-r--r--	2017-03-25 18:35
pathname.rb	15.58 KB	-rw-r--r--	2023-07-26 14:31
pp.rb	14.16 KB	-rw-r--r--	2014-12-05 19:35
prettyprint.rb	15.85 KB	-rw-r--r--	2014-08-22 02:38
prime.rb	13.11 KB	-rw-r--r--	2014-12-10 20:38
profile.rb	205 B	-rw-r--r--	2009-10-02 10:45
profiler.rb	4.51 KB	-rw-r--r--	2013-05-19 23:04
pstore.rb	14.55 KB	-rw-r--r--	2014-07-23 19:31
psych.rb	14.88 KB	-rw-r--r--	2023-07-26 14:31
rake.rb	2.23 KB	-rw-r--r--	2014-12-06 00:22
rdoc.rb	4.96 KB	-rw-r--r--	2014-12-07 01:22
resolv-replace.rb	1.73 KB	-rw-r--r--	2013-03-11 13:47
resolv.rb	72.06 KB	-rw-r--r--	2015-05-19 17:05
ripper.rb	2.53 KB	-rw-r--r--	2023-07-26 14:31
rss.rb	2.84 KB	-rw-r--r--	2011-05-11 10:22
rubygems.rb	31.85 KB	-rw-r--r--	2018-02-16 16:27
scanf.rb	23.54 KB	-rw-r--r--	2014-02-15 01:33
securerandom.rb	9.2 KB	-rw-r--r--	2016-04-22 09:17
set.rb	19.15 KB	-rw-r--r--	2014-08-06 11:28
shell.rb	11.3 KB	-rw-r--r--	2014-08-24 07:16
shellwords.rb	5.96 KB	-rw-r--r--	2014-09-05 10:00
singleton.rb	4.02 KB	-rw-r--r--	2011-05-18 14:09
socket.rb	25.6 KB	-rw-r--r--	2023-07-26 14:31
sync.rb	7.25 KB	-rw-r--r--	2013-05-19 03:10
tempfile.rb	11.11 KB	-rw-r--r--	2014-09-21 01:40
thwait.rb	3.31 KB	-rw-r--r--	2014-08-27 12:10
time.rb	22.25 KB	-rw-r--r--	2015-08-03 19:11
timeout.rb	3.64 KB	-rw-r--r--	2015-08-10 17:08
tmpdir.rb	4.13 KB	-rw-r--r--	2018-03-28 14:34
tracer.rb	6.4 KB	-rw-r--r--	2013-07-18 13:50
tsort.rb	14.27 KB	-rw-r--r--	2014-11-26 10:46
ubygems.rb	268 B	-rw-r--r--	2009-10-02 10:45
un.rb	8.87 KB	-rw-r--r--	2013-07-05 13:43
unicode_normalize.rb	3.16 KB	-rw-r--r--	2015-01-16 02:06
uri.rb	3.07 KB	-rw-r--r--	2014-11-03 00:33
weakref.rb	2.92 KB	-rw-r--r--	2014-07-26 17:12
webrick.rb	6.69 KB	-rw-r--r--	2013-10-05 23:39
xmlrpc.rb	8.49 KB	-rw-r--r--	2013-12-12 03:09
yaml.rb	1.7 KB	-rw-r--r--	2014-06-26 02:52

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.
  #
  #   class G
  #     include TSort
  #     def initialize(g)
  #       @g = g
  #     end
  #     def tsort_each_child(n, &b) @g[n].each(&b) end
  #     def tsort_each_node(&b) @g.each_key(&b) end
  #   end
  #
  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
  #   p graph.tsort #=> [4, 2, 3, 1]
  #
  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
  #   p graph.tsort # raises TSort::Cyclic
  #
  def tsort
    each_node = method(:tsort_each_node)
    each_child = method(:tsort_each_child)
    TSort.tsort(each_node, each_child)
  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.
  #
  # The graph is represented by _each_node_ and _each_child_.
  # _each_node_ should have +call+ method which yields for each node in the graph.
  # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
  #
  # If there is a cycle, TSort::Cyclic is raised.
  #
  #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   p TSort.tsort(each_node, each_child) #=> [4, 2, 3, 1]
  #
  #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   p TSort.tsort(each_node, each_child) # raises TSort::Cyclic
  #
  def TSort.tsort(each_node, each_child)
    TSort.tsort_each(each_node, each_child).to_a
  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.
 #
 # class G
 # include TSort
 # def initialize(g)
 # @g = g
 # end
 # def tsort_each_child(n, &b) @g[n].each(&b) end
 # def tsort_each_node(&b) @g.each_key(&b) end
 # end
 #
 # graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
 # graph.tsort_each {|n| p n }
 # #=> 4
 # # 2
 # # 3
 # # 1
 #
 def tsort_each(&block) # :yields: node
 each_node = method(:tsort_each_node)
 each_child = method(:tsort_each_child)
 TSort.tsort_each(each_node, each_child, &block)
 end

# The iterator version of the TSort.tsort method.
  #
  # The graph is represented by _each_node_ and _each_child_.
  # _each_node_ should have +call+ method which yields for each node in the graph.
  # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
  #
  #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   TSort.tsort_each(each_node, each_child) {|n| p n }
  #   #=> 4
  #   #   2
  #   #   3
  #   #   1
  #
  def TSort.tsort_each(each_node, each_child) # :yields: node
    return to_enum(__method__, each_node, each_child) unless block_given?

TSort.each_strongly_connected_component(each_node, each_child) {|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.
  #
  #   class G
  #     include TSort
  #     def initialize(g)
  #       @g = g
  #     end
  #     def tsort_each_child(n, &b) @g[n].each(&b) end
  #     def tsort_each_node(&b) @g.each_key(&b) end
  #   end
  #
  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
  #   p graph.strongly_connected_components #=> [[4], [2], [3], [1]]
  #
  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
  #   p graph.strongly_connected_components #=> [[4], [2, 3], [1]]
  #
  def strongly_connected_components
    each_node = method(:tsort_each_node)
    each_child = method(:tsort_each_child)
    TSort.strongly_connected_components(each_node, each_child)
  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.
  #
  # The graph is represented by _each_node_ and _each_child_.
  # _each_node_ should have +call+ method which yields for each node in the graph.
  # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
  #
  #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   p TSort.strongly_connected_components(each_node, each_child)
  #   #=> [[4], [2], [3], [1]]
  #
  #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   p TSort.strongly_connected_components(each_node, each_child)
  #   #=> [[4], [2, 3], [1]]
  #
  def TSort.strongly_connected_components(each_node, each_child)
    TSort.each_strongly_connected_component(each_node, each_child).to_a
  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+.
 #
 # class G
 # include TSort
 # def initialize(g)
 # @g = g
 # end
 # def tsort_each_child(n, &b) @g[n].each(&b) end
 # def tsort_each_node(&b) @g.each_key(&b) end
 # end
 #
 # graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
 # graph.each_strongly_connected_component {|scc| p scc }
 # #=> [4]
 # # [2]
 # # [3]
 # # [1]
 #
 # graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
 # graph.each_strongly_connected_component {|scc| p scc }
 # #=> [4]
 # # [2, 3]
 # # [1]
 #
 def each_strongly_connected_component(&block) # :yields: nodes
 each_node = method(:tsort_each_node)
 each_child = method(:tsort_each_child)
 TSort.each_strongly_connected_component(each_node, each_child, &block)
 end

# The iterator version of the TSort.strongly_connected_components method.
  #
  # The graph is represented by _each_node_ and _each_child_.
  # _each_node_ should have +call+ method which yields for each node in the graph.
  # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
  #
  #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc }
  #   #=> [4]
  #   #   [2]
  #   #   [3]
  #   #   [1]
  #
  #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
  #   each_node = lambda {|&b| g.each_key(&b) }
  #   each_child = lambda {|n, &b| g[n].each(&b) }
  #   TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc }
  #   #=> [4]
  #   #   [2, 3]
  #   #   [1]
  #
  def TSort.each_strongly_connected_component(each_node, each_child) # :yields: nodes
    return to_enum(__method__, each_node, each_child) unless block_given?

id_map = {}
    stack = []
    each_node.call {|node|
      unless id_map.include? node
        TSort.each_strongly_connected_component_from(node, each_child, 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.
  #
  #   class G
  #     include TSort
  #     def initialize(g)
  #       @g = g
  #     end
  #     def tsort_each_child(n, &b) @g[n].each(&b) end
  #     def tsort_each_node(&b) @g.each_key(&b) end
  #   end
  #
  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
  #   graph.each_strongly_connected_component_from(2) {|scc| p scc }
  #   #=> [4]
  #   #   [2]
  #
  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
  #   graph.each_strongly_connected_component_from(2) {|scc| p scc }
  #   #=> [4]
  #   #   [2, 3]
  #
  def each_strongly_connected_component_from(node, id_map={}, stack=[], &block) # :yields: nodes
    TSort.each_strongly_connected_component_from(node, method(:tsort_each_child), id_map, stack, &block)
  end

# Iterates over strongly connected components in a graph.
  # The graph is represented by _node_ and _each_child_.
  #
  # _node_ is the first node.
  # _each_child_ should have +call+ method which takes a node argument
  # and yields for each child node.
  #
  # Return value is unspecified.
  #
  # #TSort.each_strongly_connected_component_from is a class method and
  # it doesn't need a class to represent a graph which includes TSort.
  #
  #   graph = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
  #   each_child = lambda {|n, &b| graph[n].each(&b) }
  #   TSort.each_strongly_connected_component_from(1, each_child) {|scc|
  #     p scc
  #   }
  #   #=> [4]
  #   #   [2, 3]
  #   #   [1]
  #
  def TSort.each_strongly_connected_component_from(node, each_child, id_map={}, stack=[]) # :yields: nodes
    return to_enum(__method__, node, each_child, id_map, stack) unless block_given?

minimum_id = node_id = id_map[node] = id_map.size
 stack_length = stack.length
 stack << node

each_child.call(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 =
 TSort.each_strongly_connected_component_from(child, each_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