Computation times#
01:28.380 total execution time for 76 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Parallel Betweenness ( |
00:47.834 |
0.0 |
Betweenness Centrality ( |
00:06.914 |
0.0 |
Atlas ( |
00:05.903 |
0.0 |
Eigenvalues ( |
00:03.584 |
0.0 |
Triads ( |
00:01.940 |
0.0 |
Giant Component ( |
00:01.533 |
0.0 |
Reverse Cuthill–McKee ( |
00:01.157 |
0.0 |
Delaunay graphs from geographic points ( |
00:01.054 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.946 |
0.0 |
igraph ( |
00:00.907 |
0.0 |
Four Grids ( |
00:00.867 |
0.0 |
Subgraphs ( |
00:00.841 |
0.0 |
Graphs from Polygons ( |
00:00.814 |
0.0 |
Blockmodel ( |
00:00.751 |
0.0 |
Visibility Graph ( |
00:00.723 |
0.0 |
Decomposition ( |
00:00.689 |
0.0 |
Simple graph ( |
00:00.677 |
0.0 |
Words/Ladder Graph ( |
00:00.665 |
0.0 |
Chess Masters ( |
00:00.663 |
0.0 |
Lanl Routes ( |
00:00.541 |
0.0 |
Dedensification ( |
00:00.503 |
0.0 |
Sampson ( |
00:00.494 |
0.0 |
Degree Analysis ( |
00:00.455 |
0.0 |
Roget ( |
00:00.424 |
0.0 |
Properties ( |
00:00.415 |
0.0 |
Custom node icons ( |
00:00.390 |
0.0 |
Labels And Colors ( |
00:00.363 |
0.0 |
Circular Tree ( |
00:00.357 |
0.0 |
Spectral Embedding ( |
00:00.332 |
0.0 |
Graphs from geographic points ( |
00:00.320 |
0.0 |
Directed Graph ( |
00:00.314 |
0.0 |
SNAP Graph Summary ( |
00:00.281 |
0.0 |
Beam Search ( |
00:00.280 |
0.0 |
Lowest Common Ancestors ( |
00:00.276 |
0.0 |
Morse Trie ( |
00:00.237 |
0.0 |
DAG - Topological Layout ( |
00:00.201 |
0.0 |
Antigraph ( |
00:00.197 |
0.0 |
Ego Graph ( |
00:00.177 |
0.0 |
Random Geometric Graph ( |
00:00.161 |
0.0 |
Napoleon Russian Campaign ( |
00:00.155 |
0.0 |
Iterated Dynamical Systems ( |
00:00.153 |
0.0 |
Rainbow Coloring ( |
00:00.152 |
0.0 |
Atlas ( |
00:00.145 |
0.0 |
Knuth Miles ( |
00:00.138 |
0.0 |
2D Grid ( |
00:00.135 |
0.0 |
Circuits ( |
00:00.131 |
0.0 |
Weighted Graph ( |
00:00.117 |
0.0 |
House With Colors ( |
00:00.115 |
0.0 |
Find Shortest Path ( |
00:00.110 |
0.0 |
Basic matplotlib ( |
00:00.107 |
0.0 |
Karate Club ( |
00:00.103 |
0.0 |
Self-loops ( |
00:00.102 |
0.0 |
Traveling Salesman Problem ( |
00:00.101 |
0.0 |
Football ( |
00:00.099 |
0.0 |
Unix Email ( |
00:00.098 |
0.0 |
Minimum Spanning Tree ( |
00:00.097 |
0.0 |
Davis Club ( |
00:00.089 |
0.0 |
Multipartite Layout ( |
00:00.087 |
0.0 |
Greedy Coloring ( |
00:00.084 |
0.0 |
Read and write graphs. ( |
00:00.077 |
0.0 |
Maximum Independent Set ( |
00:00.077 |
0.0 |
Custom Node Position ( |
00:00.074 |
0.0 |
Degree Sequence ( |
00:00.072 |
0.0 |
Edge Colormap ( |
00:00.072 |
0.0 |
Krackhardt Centrality ( |
00:00.070 |
0.0 |
Erdos Renyi ( |
00:00.070 |
0.0 |
Print Graph ( |
00:00.068 |
0.0 |
Expected Degree Sequence ( |
00:00.068 |
0.0 |
Simple Path ( |
00:00.068 |
0.0 |
Node Colormap ( |
00:00.059 |
0.0 |
Attributes ( |
00:00.058 |
0.0 |
Conversion ( |
00:00.039 |
0.0 |
OpenStreetMap with OSMnx ( |
00:00.003 |
0.0 |
Graphs from a set of lines ( |
00:00.002 |
0.0 |
Mayavi2 ( |
00:00.000 |
0.0 |
JavaScript ( |
00:00.000 |
0.0 |