Computation times#
00:23.076 total execution time for 76 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Parallel Betweenness ( |
00:11.062 |
0.0 |
Atlas ( |
00:01.839 |
0.0 |
Betweenness Centrality ( |
00:01.663 |
0.0 |
Triads ( |
00:00.715 |
0.0 |
Eigenvalues ( |
00:00.538 |
0.0 |
Giant Component ( |
00:00.481 |
0.0 |
Reverse Cuthill–McKee ( |
00:00.381 |
0.0 |
Delaunay graphs from geographic points ( |
00:00.376 |
0.0 |
Subgraphs ( |
00:00.348 |
0.0 |
igraph ( |
00:00.288 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.272 |
0.0 |
Chess Masters ( |
00:00.250 |
0.0 |
Visibility Graph ( |
00:00.241 |
0.0 |
Decomposition ( |
00:00.208 |
0.0 |
Simple graph ( |
00:00.207 |
0.0 |
Four Grids ( |
00:00.204 |
0.0 |
Graphs from Polygons ( |
00:00.198 |
0.0 |
Blockmodel ( |
00:00.194 |
0.0 |
Words/Ladder Graph ( |
00:00.182 |
0.0 |
Lanl Routes ( |
00:00.178 |
0.0 |
Degree Analysis ( |
00:00.166 |
0.0 |
Dedensification ( |
00:00.158 |
0.0 |
Sampson ( |
00:00.149 |
0.0 |
Roget ( |
00:00.136 |
0.0 |
Custom node icons ( |
00:00.129 |
0.0 |
Beam Search ( |
00:00.122 |
0.0 |
Lowest Common Ancestors ( |
00:00.122 |
0.0 |
Spectral Embedding ( |
00:00.119 |
0.0 |
SNAP Graph Summary ( |
00:00.116 |
0.0 |
Graphs from geographic points ( |
00:00.114 |
0.0 |
Directed Graph ( |
00:00.114 |
0.0 |
Labels And Colors ( |
00:00.105 |
0.0 |
Morse Trie ( |
00:00.091 |
0.0 |
Circular Tree ( |
00:00.083 |
0.0 |
DAG - Topological Layout ( |
00:00.076 |
0.0 |
Rainbow Coloring ( |
00:00.069 |
0.0 |
Napoleon Russian Campaign ( |
00:00.066 |
0.0 |
Circuits ( |
00:00.056 |
0.0 |
Ego Graph ( |
00:00.055 |
0.0 |
Knuth Miles ( |
00:00.053 |
0.0 |
Random Geometric Graph ( |
00:00.051 |
0.0 |
Weighted Graph ( |
00:00.049 |
0.0 |
Find Shortest Path ( |
00:00.049 |
0.0 |
Antigraph ( |
00:00.048 |
0.0 |
Properties ( |
00:00.047 |
0.0 |
Atlas ( |
00:00.046 |
0.0 |
House With Colors ( |
00:00.045 |
0.0 |
Karate Club ( |
00:00.044 |
0.0 |
Traveling Salesman Problem ( |
00:00.044 |
0.0 |
Basic matplotlib ( |
00:00.044 |
0.0 |
Iterated Dynamical Systems ( |
00:00.043 |
0.0 |
Minimum Spanning Tree ( |
00:00.040 |
0.0 |
Self-loops ( |
00:00.040 |
0.0 |
2D Grid ( |
00:00.039 |
0.0 |
Multipartite Layout ( |
00:00.038 |
0.0 |
Davis Club ( |
00:00.037 |
0.0 |
Greedy Coloring ( |
00:00.037 |
0.0 |
Unix Email ( |
00:00.037 |
0.0 |
Custom Node Position ( |
00:00.034 |
0.0 |
Maximum Independent Set ( |
00:00.034 |
0.0 |
Read and write graphs. ( |
00:00.032 |
0.0 |
Edge Colormap ( |
00:00.031 |
0.0 |
Print Graph ( |
00:00.031 |
0.0 |
Erdos Renyi ( |
00:00.030 |
0.0 |
Krackhardt Centrality ( |
00:00.030 |
0.0 |
Degree Sequence ( |
00:00.030 |
0.0 |
Simple Path ( |
00:00.029 |
0.0 |
Node Colormap ( |
00:00.028 |
0.0 |
Conversion ( |
00:00.018 |
0.0 |
Attributes ( |
00:00.017 |
0.0 |
Expected Degree Sequence ( |
00:00.016 |
0.0 |
Football ( |
00:00.009 |
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 |