Computation times#
01:16.373 total execution time for 81 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Animations of 3D rotation and random walk ( |
00:20.272 |
0.0 |
Parallel Betweenness ( |
00:16.338 |
0.0 |
Greedy Coloring ( |
00:10.875 |
0.0 |
Atlas ( |
00:03.216 |
0.0 |
Betweenness Centrality ( |
00:03.064 |
0.0 |
Graphs from geographic points ( |
00:02.405 |
0.0 |
Image Segmentation via Spectral Graph Partitioning ( |
00:02.345 |
0.0 |
Triads ( |
00:01.203 |
0.0 |
Plotting MultiDiGraph Edges and Labels ( |
00:00.940 |
0.0 |
Eigenvalues ( |
00:00.852 |
0.0 |
Giant Component ( |
00:00.721 |
0.0 |
igraph ( |
00:00.665 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.653 |
0.0 |
Subgraphs ( |
00:00.602 |
0.0 |
Delaunay graphs from geographic points ( |
00:00.566 |
0.0 |
Visibility Graph ( |
00:00.500 |
0.0 |
Four Grids ( |
00:00.438 |
0.0 |
Graphs from Polygons ( |
00:00.434 |
0.0 |
Chess Masters ( |
00:00.431 |
0.0 |
Dedensification ( |
00:00.423 |
0.0 |
Decomposition ( |
00:00.418 |
0.0 |
Blockmodel ( |
00:00.384 |
0.0 |
Words/Ladder Graph ( |
00:00.380 |
0.0 |
Lanl Routes ( |
00:00.370 |
0.0 |
Degree Analysis ( |
00:00.359 |
0.0 |
Simple graph ( |
00:00.353 |
0.0 |
Sampson ( |
00:00.336 |
0.0 |
Lowest Common Ancestors ( |
00:00.310 |
0.0 |
SNAP Graph Summary ( |
00:00.308 |
0.0 |
Morse Trie ( |
00:00.301 |
0.0 |
Roget ( |
00:00.299 |
0.0 |
Custom node icons ( |
00:00.297 |
0.0 |
Beam Search ( |
00:00.290 |
0.0 |
Directed Graph ( |
00:00.284 |
0.0 |
Spectral Embedding ( |
00:00.276 |
0.0 |
Reverse Cuthill–McKee ( |
00:00.261 |
0.0 |
Labels And Colors ( |
00:00.258 |
0.0 |
Find Shortest Path ( |
00:00.238 |
0.0 |
Circular Tree ( |
00:00.233 |
0.0 |
Iterated Dynamical Systems ( |
00:00.225 |
0.0 |
Antigraph ( |
00:00.222 |
0.0 |
Napoleon Russian Campaign ( |
00:00.209 |
0.0 |
Random Geometric Graph ( |
00:00.200 |
0.0 |
Ego Graph ( |
00:00.187 |
0.0 |
Knuth Miles ( |
00:00.185 |
0.0 |
Traveling Salesman Problem ( |
00:00.179 |
0.0 |
Atlas ( |
00:00.175 |
0.0 |
Properties ( |
00:00.159 |
0.0 |
Expected Degree Sequence ( |
00:00.138 |
0.0 |
DAG - Topological Layout ( |
00:00.116 |
0.0 |
Cluster Layout ( |
00:00.112 |
0.0 |
Rainbow Coloring ( |
00:00.095 |
0.0 |
Weighted Graph ( |
00:00.086 |
0.0 |
Minimum Spanning Tree ( |
00:00.078 |
0.0 |
Circuits ( |
00:00.078 |
0.0 |
House With Colors ( |
00:00.067 |
0.0 |
Cycle Detection ( |
00:00.067 |
0.0 |
Degree Sequence ( |
00:00.066 |
0.0 |
Basic matplotlib ( |
00:00.063 |
0.0 |
Karate Club ( |
00:00.062 |
0.0 |
Self-loops ( |
00:00.059 |
0.0 |
2D Grid ( |
00:00.056 |
0.0 |
Multipartite Layout ( |
00:00.052 |
0.0 |
Davis Club ( |
00:00.051 |
0.0 |
Unix Email ( |
00:00.050 |
0.0 |
Maximum Independent Set ( |
00:00.047 |
0.0 |
Custom Node Position ( |
00:00.046 |
0.0 |
Read and write graphs. ( |
00:00.043 |
0.0 |
Edge Colormap ( |
00:00.043 |
0.0 |
Krackhardt Centrality ( |
00:00.043 |
0.0 |
Erdos Renyi ( |
00:00.040 |
0.0 |
Print Graph ( |
00:00.040 |
0.0 |
Simple Path ( |
00:00.039 |
0.0 |
Node Colormap ( |
00:00.036 |
0.0 |
Conversion ( |
00:00.023 |
0.0 |
Attributes ( |
00:00.023 |
0.0 |
Football ( |
00:00.012 |
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 |