You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
.about("Runs leiden over a provided edge list and outputs the results")
18
17
.arg(
19
-
Arg::with_name(SOURCE_EDGES)
18
+
Arg::new(SOURCE_EDGES)
20
19
.help("The edge list that defines the graph's connections")
21
20
.required(true)
22
21
.index(1),
23
22
)
24
23
.arg(
25
-
Arg::with_name(OUTPUT)
24
+
Arg::new(OUTPUT)
26
25
.help("The output for the communities detected")
27
26
.required(true)
28
27
.index(2),
29
28
)
30
29
.arg(
31
-
Arg::with_name(SEPARATOR)
32
-
.short("s")
30
+
Arg::new(SEPARATOR)
31
+
.short('s')
33
32
.help("The character to split the edge list on")
34
-
.takes_value(true)
33
+
.action(ArgAction::Set)
35
34
.default_value("\t"),
36
35
)
37
36
.arg(
38
-
Arg::with_name(SOURCE_INDEX)
39
-
.takes_value(true)
37
+
Arg::new(SOURCE_INDEX)
38
+
.action(ArgAction::Set)
40
39
.help("0-based index of source column from edge file")
41
40
.default_value("0"),
42
41
)
43
42
.arg(
44
-
Arg::with_name(TARGET_INDEX)
45
-
.takes_value(true)
43
+
Arg::new(TARGET_INDEX)
44
+
.action(ArgAction::Set)
46
45
.help("0-based index of target column from edge file")
47
46
.default_value("1"),
48
47
)
49
48
.arg(
50
-
Arg::with_name(WEIGHT_INDEX)
51
-
.takes_value(true)
49
+
Arg::new(WEIGHT_INDEX)
50
+
.action(ArgAction::Set)
52
51
.help("0-based index of weight column from edge file")
53
52
)
54
53
.arg(
55
-
Arg::with_name(SEED)
56
-
.takes_value(true)
54
+
Arg::new(SEED)
55
+
.action(ArgAction::Set)
57
56
.help("A seed value to start the PRNG")
58
57
.long("seed"),
59
58
)
60
59
.arg(
61
-
Arg::with_name(ITERATIONS)
62
-
.takes_value(true)
60
+
Arg::new(ITERATIONS)
61
+
.action(ArgAction::Set)
63
62
.help("Leiden is an inherently recursive algorithm, however it may find itself (due to randomness) at a localized maximum. Setting iterations to a number larger than 1 may allow you to jump out of a local maximum and continue until a better optimum partitioning is found (note that any n > 1 will mean that leiden will be run again for a minimum of n-1 more times, though it may be run for many more than that")
64
-
.short("i")
63
+
.short('i')
65
64
.default_value("1"),
66
65
)
67
66
.arg(
68
-
Arg::with_name(RESOLUTION)
69
-
.takes_value(true)
67
+
Arg::new(RESOLUTION)
68
+
.action(ArgAction::Set)
70
69
.help("")
71
-
.short("r")
70
+
.short('r')
72
71
.default_value("1.0")
73
72
)
74
73
.arg(
75
-
Arg::with_name(RANDOMNESS)
76
-
.takes_value(true)
74
+
Arg::new(RANDOMNESS)
75
+
.action(ArgAction::Set)
77
76
.help("")
78
77
.default_value("1E-2"),
79
78
)
80
79
.arg(
81
-
Arg::with_name(QUALITY)
82
-
.takes_value(true)
80
+
Arg::new(QUALITY)
81
+
.action(ArgAction::Set)
83
82
.help("Quality function to use")
84
-
.short("q")
85
-
.possible_value("modularity")
86
-
.possible_value("cpm")
83
+
.short('q')
84
+
.value_parser(["modularity","cpm"])
87
85
.default_value("modularity"),
88
86
)
89
87
.arg(
90
-
Arg::with_name(HAS_HEADER)
88
+
Arg::new(HAS_HEADER)
91
89
.help("Flag must be added if the source file contains a header line")
0 commit comments