Computation times#
00:20.052 total execution time for 76 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Parallel Betweenness ( |
00:09.489 |
0.0 |
Atlas ( |
00:01.574 |
0.0 |
Betweenness Centrality ( |
00:01.550 |
0.0 |
Triads ( |
00:00.639 |
0.0 |
Eigenvalues ( |
00:00.461 |
0.0 |
Giant Component ( |
00:00.437 |
0.0 |
Reverse Cuthill–McKee ( |
00:00.324 |
0.0 |
Delaunay graphs from geographic points ( |
00:00.301 |
0.0 |
Subgraphs ( |
00:00.294 |
0.0 |
igraph ( |
00:00.261 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.246 |
0.0 |
Visibility Graph ( |
00:00.214 |
0.0 |
Chess Masters ( |
00:00.211 |
0.0 |
Simple graph ( |
00:00.184 |
0.0 |
Decomposition ( |
00:00.183 |
0.0 |
Four Grids ( |
00:00.178 |
0.0 |
Words/Ladder Graph ( |
00:00.168 |
0.0 |
Blockmodel ( |
00:00.165 |
0.0 |
Graphs from Polygons ( |
00:00.158 |
0.0 |
Lanl Routes ( |
00:00.155 |
0.0 |
Degree Analysis ( |
00:00.147 |
0.0 |
Dedensification ( |
00:00.141 |
0.0 |
Sampson ( |
00:00.133 |
0.0 |
Roget ( |
00:00.120 |
0.0 |
Custom node icons ( |
00:00.117 |
0.0 |
Beam Search ( |
00:00.108 |
0.0 |
Graphs from geographic points ( |
00:00.106 |
0.0 |
Lowest Common Ancestors ( |
00:00.104 |
0.0 |
Spectral Embedding ( |
00:00.101 |
0.0 |
SNAP Graph Summary ( |
00:00.099 |
0.0 |
Directed Graph ( |
00:00.097 |
0.0 |
Labels And Colors ( |
00:00.093 |
0.0 |
Morse Trie ( |
00:00.078 |
0.0 |
Circular Tree ( |
00:00.073 |
0.0 |
DAG - Topological Layout ( |
00:00.067 |
0.0 |
Rainbow Coloring ( |
00:00.060 |
0.0 |
Napoleon Russian Campaign ( |
00:00.057 |
0.0 |
Circuits ( |
00:00.048 |
0.0 |
Knuth Miles ( |
00:00.046 |
0.0 |
Random Geometric Graph ( |
00:00.046 |
0.0 |
Ego Graph ( |
00:00.046 |
0.0 |
Weighted Graph ( |
00:00.044 |
0.0 |
Find Shortest Path ( |
00:00.044 |
0.0 |
Antigraph ( |
00:00.042 |
0.0 |
Atlas ( |
00:00.041 |
0.0 |
Properties ( |
00:00.041 |
0.0 |
House With Colors ( |
00:00.041 |
0.0 |
Traveling Salesman Problem ( |
00:00.039 |
0.0 |
Basic matplotlib ( |
00:00.039 |
0.0 |
Karate Club ( |
00:00.039 |
0.0 |
Iterated Dynamical Systems ( |
00:00.037 |
0.0 |
Self-loops ( |
00:00.036 |
0.0 |
Minimum Spanning Tree ( |
00:00.036 |
0.0 |
Multipartite Layout ( |
00:00.034 |
0.0 |
2D Grid ( |
00:00.034 |
0.0 |
Unix Email ( |
00:00.033 |
0.0 |
Davis Club ( |
00:00.033 |
0.0 |
Greedy Coloring ( |
00:00.033 |
0.0 |
Custom Node Position ( |
00:00.030 |
0.0 |
Maximum Independent Set ( |
00:00.030 |
0.0 |
Read and write graphs. ( |
00:00.028 |
0.0 |
Edge Colormap ( |
00:00.028 |
0.0 |
Krackhardt Centrality ( |
00:00.027 |
0.0 |
Print Graph ( |
00:00.026 |
0.0 |
Erdos Renyi ( |
00:00.026 |
0.0 |
Degree Sequence ( |
00:00.026 |
0.0 |
Simple Path ( |
00:00.025 |
0.0 |
Node Colormap ( |
00:00.023 |
0.0 |
Conversion ( |
00:00.016 |
0.0 |
Attributes ( |
00:00.015 |
0.0 |
Expected Degree Sequence ( |
00:00.014 |
0.0 |
Football ( |
00:00.007 |
0.0 |
OpenStreetMap with OSMnx ( |
00:00.001 |
0.0 |
Graphs from a set of lines ( |
00:00.001 |
0.0 |
Mayavi2 ( |
00:00.000 |
0.0 |
JavaScript ( |
00:00.000 |
0.0 |