Computation times#
01:14.607 total execution time for 76 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Parallel Betweenness ( |
00:41.781 |
0.0 |
Betweenness Centrality ( |
00:06.290 |
0.0 |
Atlas ( |
00:05.536 |
0.0 |
Triads ( |
00:01.812 |
0.0 |
Giant Component ( |
00:01.333 |
0.0 |
Eigenvalues ( |
00:01.166 |
0.0 |
igraph ( |
00:00.864 |
0.0 |
Delaunay graphs from geographic points ( |
00:00.824 |
0.0 |
Reverse Cuthill–McKee ( |
00:00.782 |
0.0 |
Subgraphs ( |
00:00.754 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.721 |
0.0 |
Blockmodel ( |
00:00.687 |
0.0 |
Visibility Graph ( |
00:00.673 |
0.0 |
Words/Ladder Graph ( |
00:00.578 |
0.0 |
Four Grids ( |
00:00.562 |
0.0 |
Chess Masters ( |
00:00.530 |
0.0 |
Graphs from Polygons ( |
00:00.526 |
0.0 |
Lanl Routes ( |
00:00.501 |
0.0 |
Decomposition ( |
00:00.482 |
0.0 |
Simple graph ( |
00:00.448 |
0.0 |
Dedensification ( |
00:00.430 |
0.0 |
Degree Analysis ( |
00:00.415 |
0.0 |
Sampson ( |
00:00.365 |
0.0 |
Custom node icons ( |
00:00.311 |
0.0 |
Graphs from geographic points ( |
00:00.311 |
0.0 |
Directed Graph ( |
00:00.305 |
0.0 |
Labels And Colors ( |
00:00.285 |
0.0 |
Roget ( |
00:00.281 |
0.0 |
Beam Search ( |
00:00.275 |
0.0 |
SNAP Graph Summary ( |
00:00.271 |
0.0 |
Lowest Common Ancestors ( |
00:00.270 |
0.0 |
Spectral Embedding ( |
00:00.266 |
0.0 |
Morse Trie ( |
00:00.232 |
0.0 |
Circular Tree ( |
00:00.195 |
0.0 |
DAG - Topological Layout ( |
00:00.195 |
0.0 |
Iterated Dynamical Systems ( |
00:00.151 |
0.0 |
Napoleon Russian Campaign ( |
00:00.146 |
0.0 |
Rainbow Coloring ( |
00:00.145 |
0.0 |
Ego Graph ( |
00:00.140 |
0.0 |
Circuits ( |
00:00.129 |
0.0 |
Atlas ( |
00:00.126 |
0.0 |
Knuth Miles ( |
00:00.121 |
0.0 |
Weighted Graph ( |
00:00.116 |
0.0 |
Random Geometric Graph ( |
00:00.114 |
0.0 |
Antigraph ( |
00:00.111 |
0.0 |
House With Colors ( |
00:00.109 |
0.0 |
Properties ( |
00:00.107 |
0.0 |
Find Shortest Path ( |
00:00.107 |
0.0 |
Traveling Salesman Problem ( |
00:00.101 |
0.0 |
Karate Club ( |
00:00.098 |
0.0 |
Self-loops ( |
00:00.098 |
0.0 |
Basic matplotlib ( |
00:00.097 |
0.0 |
Minimum Spanning Tree ( |
00:00.092 |
0.0 |
Davis Club ( |
00:00.087 |
0.0 |
Unix Email ( |
00:00.083 |
0.0 |
Greedy Coloring ( |
00:00.083 |
0.0 |
Multipartite Layout ( |
00:00.081 |
0.0 |
2D Grid ( |
00:00.079 |
0.0 |
Maximum Independent Set ( |
00:00.075 |
0.0 |
Custom Node Position ( |
00:00.074 |
0.0 |
Read and write graphs. ( |
00:00.072 |
0.0 |
Edge Colormap ( |
00:00.071 |
0.0 |
Krackhardt Centrality ( |
00:00.069 |
0.0 |
Print Graph ( |
00:00.066 |
0.0 |
Erdos Renyi ( |
00:00.066 |
0.0 |
Degree Sequence ( |
00:00.066 |
0.0 |
Simple Path ( |
00:00.065 |
0.0 |
Expected Degree Sequence ( |
00:00.057 |
0.0 |
Node Colormap ( |
00:00.055 |
0.0 |
Conversion ( |
00:00.034 |
0.0 |
Attributes ( |
00:00.033 |
0.0 |
Football ( |
00:00.023 |
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 |