Detailed feature comparison
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
View only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZAA
1
igraphBoostNetworkitSnapGraph-tool
Sage (before project)
Sage (after project)
2
Number of routines62312828456698
3
Number of routines not in Sage0152500
4
DistancesLegend
5
DiameterxxEasyxxxAvailable
6
Dijkstra shortest pathsxxxxxOnly in C
There is in the C version of the library, but not in the Python version
7
Bellman-Ford shortest pathsxxxTicketxEasy
Very easy to implement (for instance, if we have a routine for maximum clique and we want to compute the size of the maximum clique).
8
Johnson shortest pathsxxxxTicket
A ticket is already open on this issue, but not closed, yet
9
Floyd-Warshall shortest pathsxxx
Available and missing in Sage
10
RadiusxEasyxx
11
DominatorsOnly in Cxxx
12
Visits
13
BFSxxxxxxx
14
DFSOnly in Cxxxxx
15
LexBFSxx
16
LexDFS
17
Kruskal minimum spanning treexxx
18
Prim's Minimum Spanning Treexxxx
19
Anfx
20
A*xx
21
Flow / cuts
22
All minimal separatorsxx
23
Max flow / min cutxxOnly in COnly in Cxxx
24
Multiple cutxx
25
Maximum cutxx
26
Connected components
27
CCxxxxxxx
28
SCCxxxxxxx
29
BCCxxxxx
30
Edge connectivityxxxx
31
Vertex connectivityxxx
32
K corexxxxxxx
33
Transitive closurexxxx
34
Transitive reductionxxx
35
Centrality
36
Betweennessxxxxxxx
37
Betweenness (approximate)xxxx
38
Closenessxxxxx
39
Edge betweennessxxxxxx
40
Eigenvector centralityxxxxEasyx
41
PagerankxxxxxEasyx
42
Personalized pagerankxx
43
Topological sortxxxxx
44
HubsAndAuthoritiesxxxx
45
Katzx
46
Measures
47
Assortativityxxx
48
Bibcoupling (similarity of neighbors)xxx
49
Cocitation (similarity of neighbors)xxx
50
Burt's constraint scorexx
51
Diversity (entropy of edges incident to a vertex)xx
52
Local clustering coefficientxxxxxxx
53
Clustering coefficientxxxxxxx
54
Eigenvalues/EigenvectorsWith Numpyxxxx
55
Tests
56
Eulerianxx
57
Planarxxxx
58
Circular planarxx
59
ChordalOnly in Cxx
60
Circulantxx
61
Intervalxx
62
Gallai treexx
63
Equitablexx
64
Communities
65
Clausetxxxx
66
Infomap (Rosvall, Bergstrom)xx
67
Leading eigenvector (Newman)xEasyx
68
Label propagation (Raghavan, Albert, Kumara)xxx
69
Multilevel (Blondel, Guillaume, Lambiotte, Lefebvre)
xx
70
Optimal modularityxxxx
71
Edge betweennessxxx
72
Spinglass (Reichardt, Bornholdt)xx
73
Stochastic block modelx
74
Walktrap (Pons, Latapy)xx
75
Isomorphism
76
Are isomorphicxxxxxx
77
Is subgraphxxxxxx
78
Count isomorphismsxxxx
79
Count subisomorphismsxxxx
80
Clique numberxxx
81
Girth (minimum cycle)xxx
82
Independent setxxxx
83
Largest cliquesxxx
84
Largest independent setsxxx
85
Maximal cliquesxxx
86
Maximal independent setsxx
87
Generators
88
Preferential Attachmentxxxxxx
89
Chung-Luxxxxx
90
Clustered Random Graphxx
91
Configuration Modelxxxxx
92
Dorogovtsev Mendesx
93
Forest Firexxxx
94
Erdos-Renyixxxxxx
95
Havel-Hakimix
96
PubWeb (geometric on torus)x
97
Recursive matrixxxEasyEasy
98
Newman-Watts-Strogatzxxxxxx
99
Copy modelx
100
Vertex types generatorxxx
Loading...
 
 
 
Detailed feature comparison
Detailed performance comparison