Commit bbf2da9f authored by VIGNET Pierre's avatar VIGNET Pierre
Browse files

[cmd] Fix typos; add doc

parent 59cf0ac4
......@@ -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)
......
......@@ -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'])
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment