Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
VIGNET Pierre
cadbiom
Commits
bbf2da9f
Commit
bbf2da9f
authored
Jan 21, 2020
by
VIGNET Pierre
Browse files
[cmd] Fix typos; add doc
parent
59cf0ac4
Changes
2
Hide whitespace changes
Inline
Side-by-side
command_line/cadbiom_cmd/solution_sort.py
View file @
bbf2da9f
...
...
@@ -414,6 +414,9 @@ def merge_graphs(graphs):
missing_nodes
=
set
(
graph
.
nodes_iter
())
-
set
(
G
.
nodes_iter
())
if
missing_nodes
:
# Add missing nodes in G from the current graph
# Note: This step is mandatory even if add_edge() automatically adds
# nodes to the graph, because some nodes can be included in any
# transition.
# Build a tuple (node_name, attrs)
G
.
add_nodes_from
((
node
,
graph
.
node
[
node
])
for
node
in
missing_nodes
)
...
...
command_line/cadbiom_cmd/tools/graphs.py
View file @
bbf2da9f
...
...
@@ -195,7 +195,7 @@ def build_graph(solution, steps, transitions):
# Get & make all needed edges ##############################################
LOGGER
.
debug
(
"Build graph for the solution: %s"
,
solution
)
LOGGER
.
debug
(
"Decompiled steps: "
,
steps
)
LOGGER
.
debug
(
"Decompiled steps:
%s
"
,
steps
)
#
# print(transitions['_h_2755'])
# print(transitions['_h_4716'])
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment