File: igraph_average_path_length.out

package info (click to toggle)
igraph 0.10.2%2Bds-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 16,176 kB
  • sloc: ansic: 121,500; cpp: 21,699; xml: 2,734; python: 411; makefile: 147; javascript: 20; sh: 9
file content (35 lines) | stat: -rw-r--r-- 832 bytes parent folder | download | duplicates (6)
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
Null graph:
Average shortest path length: NaN
No. of unconnected pairs: 0

Singleton graph:
Average shortest path length: NaN
No. of unconnected pairs: 0

2-vertex empty graph, unconn=true:
Average shortest path length: NaN
No. of unconnected pairs: 2

2-vertex empty graph, unconn=false:
Average shortest path length: Inf
No. of unconnected pairs: 2

Smallest bifurcating directed tree, unconn=true:
Average shortest path length: 1
No. of unconnected pairs: 4

Smallest bifurcating directed tree, unconn=false:
Average shortest path length: 1
No. of unconnected pairs: 4

Undirected 11-cycle:
Average shortest path length: 3
No. of unconnected pairs: 0

Directed 6-cycle:
Average shortest path length: 5.5
No. of unconnected pairs: 0

De Bruijn graph, n=3 and m=5:
Average shortest path length: 4.34405
No. of unconnected pairs: 0