1
+ {
2
+ "G" : " The graph to run the algorithm on." ,
3
+ "sudo" : " Disable the memory guard." ,
4
+ "log_progress" : " Display progress logging." ,
5
+ "username" : " As an administrator, run the algorithm as a different user, to access also their graphs." ,
6
+ "job_id" : " Identifier for the computation." ,
7
+
8
+ "tolerance" : " Minimum change in scores between iterations." ,
9
+ "concurrency" : " Number of CPU threads to use." ,
10
+ "max_iterations" : " Maximum number of iterations to run." ,
11
+ "scaler" : " Name of the scaler applied on the resulting scores." ,
12
+ "source_nodes" : " List of node ids to use as starting points. Use a list of list pairs to associate each node with a bias > 0." ,
13
+ "orientation" : " The orientation of relationships to consider. Can be 'NATURAL', 'REVERSE', or 'UNDIRECTED'." ,
14
+
15
+ "sampling_size" : " Number of source nodes to consider for computing centrality scores." ,
16
+ "sampling_seed" : " Seed value for the random number generator that selects source nodes." ,
17
+ "damping_factor" : " Probability of a jump to a random node." ,
18
+ "use_wasserman_faust" : " Use the improved Wasserman-Faust formula for closeness computation." ,
19
+ "seed_set_size" : " Number of nodes that maximize the expected spread in the network." ,
20
+ "propagation_probability" : " Probability of a node being activated by an active neighbour node." ,
21
+ "monte_carlo_simulations" : " Number of Monte-Carlo simulations." ,
22
+
23
+ "mutate_property" : " Name of the node property to store the results in." ,
24
+ "write_property" : " Name of the node property to store the results in." ,
25
+
26
+ "node_labels" : " Filter the graph using the given node labels. Nodes with any of the given labels will be included." ,
27
+ "relationship_types" : " Filter the graph using the given relationship types. Relationships with any of the given types will be included." ,
28
+ "relationship_weight_property" : " Name of the property to be used as weights." ,
29
+ }
0 commit comments