I was checking the output for a few runs and noticed that the edge counts in the LEDA format section seems wrong.
Attached below is one example output for reference.
P/S: I can (only kind of) see the reason here: the count only increments when there is a reversal edge (i.e., 3rd edge parameter being 1). Could you illustrate what it's actually supposed to represent here? Thank you!
FANMOD 1.1 subgraph enumeration
-------------------------------
Network name: [redacted]
Network type: Directed
Number of nodes: 594
Number of edges: 1073
Number of single edges: 1072
Number of mutual edges: 1
Algorithm: enumeration
Subgraph size: 3
Generated 1000 random networks
with locally constant number of bidirectional edges,
3 exchanges per edge and 3 tries per edge.
12039 subgraphs were enumerated in the original network.
12085574 subgraphs were enumerated in the random networks.
12097613 subgraphs were enumerated in all networks.
For the random networks: 3922611 tries were made, 3170265 were successful.
Randomization took 0.94127 seconds.
Enumeration took 9.11007 seconds.
9 motifs were found.
Result overview:
ID,Frequency,Count,Mean-Freq,Standard-Dev,Z-Score,p-Value
104,0.53327,6420,0.53252,0.00011982,6.214,0
000
000
110
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
0
3 1 0 |{}|
3 2 0 |{}|
#-leda format
328,0.37503,4515,0.37554,0.00025139,-2.0227,0.977
000
100
100
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
0
2 1 0 |{}|
3 1 0 |{}|
#-leda format
200,0.080738,972,0.081655,0.00083147,-1.1029,0.872
000
001
100
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
1
3 1 0 |{}|
2 3 0 |{}|
#-leda format
360,0.0094692,114,0.0081244,0.001004,1.3394,0.095
000
100
110
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
0
2 1 0 |{}|
3 1 0 |{}|
3 2 0 |{}|
#-leda format
488,0.00074757,9,0.00010079,8.1329e-05,7.9526,0
000
101
110
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
1
2 1 0 |{}|
3 1 0 |{}|
2 3 1 |{}|
#-leda format
232,0.00066451,8,0.0019489,0.00016201,-7.9278,1
000
001
110
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
1
3 1 0 |{}|
2 3 1 |{}|
#-leda format
1352,8.3063e-05,1,8.1917e-05,8.2387e-06,0.13918,0.023
010
100
100
#+leda format
#header section
LEDA.GRAPH
string
void
-1
#nodes section
3
|{0}|
|{0}|
|{0}|
#edges section
1
1 2 1 |{}|
3 1 0 |{}|
#-leda format
Hello,
I was checking the output for a few runs and noticed that the edge counts in the LEDA format section seems wrong.
Attached below is one example output for reference.
P/S: I can (only kind of) see the reason here: the count only increments when there is a reversal edge (i.e., 3rd edge parameter being 1). Could you illustrate what it's actually supposed to represent here? Thank you!