Computation times#
00:36.701 total execution time for 76 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Parallel Betweenness ( |
00:18.656 |
0.0 |
Betweenness Centrality ( |
00:03.026 |
0.0 |
Atlas ( |
00:02.669 |
0.0 |
Triads ( |
00:01.086 |
0.0 |
Giant Component ( |
00:00.732 |
0.0 |
Eigenvalues ( |
00:00.656 |
0.0 |
igraph ( |
00:00.509 |
0.0 |
Reverse Cuthill–McKee ( |
00:00.488 |
0.0 |
Delaunay graphs from geographic points ( |
00:00.468 |
0.0 |
Visibility Graph ( |
00:00.464 |
0.0 |
Subgraphs ( |
00:00.463 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.408 |
0.0 |
Chess Masters ( |
00:00.340 |
0.0 |
Four Grids ( |
00:00.321 |
0.0 |
Decomposition ( |
00:00.315 |
0.0 |
Graphs from Polygons ( |
00:00.297 |
0.0 |
Words/Ladder Graph ( |
00:00.278 |
0.0 |
Blockmodel ( |
00:00.271 |
0.0 |
Simple graph ( |
00:00.268 |
0.0 |
Lanl Routes ( |
00:00.266 |
0.0 |
Degree Analysis ( |
00:00.248 |
0.0 |
Dedensification ( |
00:00.247 |
0.0 |
Sampson ( |
00:00.222 |
0.0 |
Directed Graph ( |
00:00.209 |
0.0 |
Custom node icons ( |
00:00.192 |
0.0 |
Roget ( |
00:00.186 |
0.0 |
Graphs from geographic points ( |
00:00.178 |
0.0 |
Beam Search ( |
00:00.172 |
0.0 |
Lowest Common Ancestors ( |
00:00.171 |
0.0 |
SNAP Graph Summary ( |
00:00.162 |
0.0 |
Spectral Embedding ( |
00:00.162 |
0.0 |
Labels And Colors ( |
00:00.156 |
0.0 |
Morse Trie ( |
00:00.136 |
0.0 |
DAG - Topological Layout ( |
00:00.118 |
0.0 |
Circular Tree ( |
00:00.116 |
0.0 |
Rainbow Coloring ( |
00:00.094 |
0.0 |
Napoleon Russian Campaign ( |
00:00.091 |
0.0 |
Circuits ( |
00:00.078 |
0.0 |
Atlas ( |
00:00.074 |
0.0 |
Weighted Graph ( |
00:00.073 |
0.0 |
Ego Graph ( |
00:00.073 |
0.0 |
Knuth Miles ( |
00:00.072 |
0.0 |
Random Geometric Graph ( |
00:00.072 |
0.0 |
Iterated Dynamical Systems ( |
00:00.068 |
0.0 |
House With Colors ( |
00:00.067 |
0.0 |
Find Shortest Path ( |
00:00.066 |
0.0 |
Antigraph ( |
00:00.066 |
0.0 |
Properties ( |
00:00.064 |
0.0 |
Basic matplotlib ( |
00:00.064 |
0.0 |
Karate Club ( |
00:00.063 |
0.0 |
Traveling Salesman Problem ( |
00:00.063 |
0.0 |
Self-loops ( |
00:00.060 |
0.0 |
2D Grid ( |
00:00.058 |
0.0 |
Minimum Spanning Tree ( |
00:00.057 |
0.0 |
Multipartite Layout ( |
00:00.052 |
0.0 |
Unix Email ( |
00:00.052 |
0.0 |
Greedy Coloring ( |
00:00.052 |
0.0 |
Davis Club ( |
00:00.051 |
0.0 |
Maximum Independent Set ( |
00:00.048 |
0.0 |
Custom Node Position ( |
00:00.047 |
0.0 |
Read and write graphs. ( |
00:00.044 |
0.0 |
Edge Colormap ( |
00:00.044 |
0.0 |
Krackhardt Centrality ( |
00:00.042 |
0.0 |
Erdos Renyi ( |
00:00.041 |
0.0 |
Degree Sequence ( |
00:00.041 |
0.0 |
Print Graph ( |
00:00.041 |
0.0 |
Simple Path ( |
00:00.040 |
0.0 |
Node Colormap ( |
00:00.036 |
0.0 |
Conversion ( |
00:00.027 |
0.0 |
Expected Degree Sequence ( |
00:00.026 |
0.0 |
Attributes ( |
00:00.025 |
0.0 |
Football ( |
00:00.012 |
0.0 |
OpenStreetMap with OSMnx ( |
00:00.002 |
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 |