generating adjacency matrix
displaying nodes cadence
generating levels of nodes to start simultaneously
example 1
given the following graph:
the following results were demonstrated:
[dataexplorer1@r02edge cbaUtils]$ bin/testUtils
Nodes cadence
0--->20
0--->30
0--->40
0--->13001
0--->13058
0--->13120
20--->50
30--->50
30--->60
30--->70
40--->70
50--->80
60--->90
70--->90
80--->99999
90--->99999
13000--->13098
13001--->13000
13058--->13000
13098--->13099
13099--->99999
13120--->99999
Adjacency matrix
0 1 1 1 0 0 0 0 0 0 1 1 0 0 1 0
0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Level 0: 20 30 40 13001 13058 13120
Level 1: 50 60 70 13000 99999
Level 2: 80 90 13098
Level 3: 13099 99999
Level 4: 99999
example 2
Given graph:
[dataexplorer1@r02edge cbaUtils]$ bin/testUtils
Nodes cadence
0--->20
0--->30
0--->40
0--->13001
0--->13058
0--->13120
20--->50
30--->50
30--->60
30--->70
40--->70
50--->80
60--->90
70--->90
70--->100
80--->99999
90--->100
100--->110
100--->120
110--->130
120--->130
130--->99999
13000--->13098
13001--->13000
13058--->13000
13098--->13099
13099--->99999
13120--->99999
Adjacency matrix
0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0
0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Level 0: 20 30 40 13001 13058 13120
Level 1: 50 60 70 13000 99999
Level 2: 80 90 100 13098
Level 3: 100 110 120 13099 99999
Level 4: 110 120 130 99999
Level 5: 130 99999
Level 6: 99999
Conclusions
nodes are started in the correct order
nodes having more than one edges are mentioned more than once → this can be disregarded as the running node will ignore the request, or the levels can be checked for the recurring nodes and only unique values should be retained. the search may be costly with 1000 nodes.
