Skip to content

Forward component blocks directly during recursive graph traversal #35

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
OskarEichler wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Forward component blocks directly during recursive graph traversal #35

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 4 additions & 8 deletions lib/tsort.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -344,16 +344,14 @@ def each_strongly_connected_component(&block) # :yields: nodes
# # [2, 3]
# # [1]
#
def self.each_strongly_connected_component(each_node, each_child) # :yields: nodes
def self.each_strongly_connected_component(each_node, each_child, &block) # :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
each_strongly_connected_component_from(node, each_child, id_map, stack) {|c|
yield c
}
each_strongly_connected_component_from(node, each_child, id_map, stack, &block)
end
}
nil
Expand Down Expand Up @@ -410,7 +408,7 @@ def each_strongly_connected_component_from(node, id_map={}, stack=[], &block) #
# # [2, 3]
# # [1]
#
def self.each_strongly_connected_component_from(node, each_child, id_map={}, stack=[]) # :yields: nodes
def self.each_strongly_connected_component_from(node, each_child, id_map={}, stack=[], &block) # :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
Expand All @@ -423,9 +421,7 @@ def self.each_strongly_connected_component_from(node, each_child, id_map={}, sta
minimum_id = child_id if child_id && child_id < minimum_id
else
sub_minimum_id =
each_strongly_connected_component_from(child, each_child, id_map, stack) {|c|
yield c
}
each_strongly_connected_component_from(child, each_child, id_map, stack, &block)
minimum_id = sub_minimum_id if sub_minimum_id < minimum_id
end
}
Expand Down