-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhelp.txt
More file actions
78 lines (78 loc) · 4.75 KB
/
Copy pathhelp.txt
File metadata and controls
78 lines (78 loc) · 4.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
usage: colouring.exe [options]
options:
-h print these instructions
-n [integer] set the number of nodes in the graph
default is 10
-M [integer] set the max iterations
default is 50000 (plenty)
this limits the amount of time the agent algorithm can run for
-c [integer] colour lower bound
if you set this parameter, the algorithm will try and colour the graph
with that many colours
if it fails to find a solution, it will increment the number of colours
until it reaches the upper bound
-C [integer] colour upper bound
the default is determined by a brute force centralised approach
this paramter will have no effect if the lower bound is not also set
can be used to ensure that the solution is optimal or to force conflicts
-S [name/path] set the save mode on
flag which sets whether the results are saved to a file called results.csv
the default is false
the name/path is optional, but allows for custom names or paths if included
-A [integer] number of automatic runs
default is 1 (run the program once)
increasing the number will run the program that number of times
can be used to save multiple runs of the same settings
-a [integer] number of agents
sets the number of agents (active nodes) in the colouring algorithm
the default is an agent at every vertex
maximum is the number of nodes in the graph
-m [integer] number of agent moves
sets the number of moves an agent makes on each "turn"
the default is 0 (agents are stationary)
-v set visualise mode on
prints the graph when the colouring is complete
enters the user into an interactive traversal mode
can be useful to help visualise graphs
default is off
-g [generator] set the generator
sets the graph generator function to use
there are currently two different types of graphs you can use
r: random graph; each edge has a p% chance of existing (default)
options:
-p [float] probability (as a floating point number between 0 and 1)
probability that each edge of the graph exists
default is 0.5
o: ring graph; undirected graph where each node has two neighbours
b: bipartite graph; a graph of two disjoint subsets
options:
-s [integer] set one; the number of nodes in the first subset
the default is to split the number of nodes in two
-k [kernel] set the colouring kernel
sets the kernel used to colour the nodes
options include:
m: local minimum (default); applies the local minimum colour
r: random kernel; picks a colour between 1 and max if in conflict
d: colour-blind decrement; decrements colour if in conflict
i: colour-blind increment; increments colour if in conflict
a: amongus kernel; introduces a bad actor (colours with m)
-d [kernel] set the dynamic kernel
sets the kernel used to modify the topology of the graph
options include:
x: no dynamic kernel (default)
e: possibly remove edge
n: possibly remove node
o: remove orphan nodes
t: remove nodes based on a threshold
a: possibly remove the agent, but not the node
-w [kernel] set the movement kernel
sets the kernel used to move agents between nodes
options include:
x: no movement kernel (default)
r: random movement kernel
o: optimal movement kernel
-K [config] set kernel config
sets the kernel config based on the provided string
the string is parsed in the format [colour, dynamic, movement]
for example, the default configuration is 'mxx'
colour-blind decrement with possible edge removal would be 'dex'