# SWF finished, output the dependancy graph of each user
# SWF finished, output the dependancy graph of each user
foruser_id,userinusers.items():
foruser_id,userinusers.items():
...
@@ -137,14 +137,16 @@ def main():
...
@@ -137,14 +137,16 @@ def main():
type=str,
type=str,
help='The output folder that will store the graphs')
help='The output folder that will store the graphs')
parser.add_argument(
parser.add_argument(
'--transitive_reduction',
'--no_dynamic_reduction',
action="store_true",
action="store_true",
help='Gives the transitive reduction version of the graphs in output.')
help=
'Unless this option is specified, during the construction of the graph the algorithm dynamically avoids to add an edge between two nodes if a path already exists.'
)
parser.add_argument(
parser.add_argument(
'--dynamic_reduction',
'--transitive_reduction',
action="store_true",
action="store_true",
help=
help=
'While building the graph, dynamically avoids to add an edge between two nodes if a path already exist.'
'Gives the transitive reduction version of the graphs in output (without the option --no_dynamic_reduction, the graphs in output are already minimal in the sense of the transitive reduction).'