Computation times#
01:19.340 total execution time for 81 files from all galleries:
Example |
Time |
Mem (MB) |
---|---|---|
Animations of 3D rotation and random walk ( |
00:21.076 |
0.0 |
Parallel Betweenness ( |
00:19.676 |
0.0 |
Greedy Coloring ( |
00:11.031 |
0.0 |
Atlas ( |
00:03.514 |
0.0 |
Betweenness Centrality ( |
00:03.298 |
0.0 |
Image Segmentation via Spectral Graph Partitioning ( |
00:02.713 |
0.0 |
Graphs from geographic points ( |
00:02.062 |
0.0 |
Triads ( |
00:01.106 |
0.0 |
Eigenvalues ( |
00:00.934 |
0.0 |
Plotting MultiDiGraph Edges and Labels ( |
00:00.812 |
0.0 |
Giant Component ( |
00:00.773 |
0.0 |
Subgraphs ( |
00:00.637 |
0.0 |
Community Detection using Girvan-Newman ( |
00:00.601 |
0.0 |
igraph ( |
00:00.558 |
0.0 |
Delaunay graphs from geographic points ( |
00:00.511 |
0.0 |
Blockmodel ( |
00:00.449 |
0.0 |
Visibility Graph ( |
00:00.424 |
0.0 |
Chess Masters ( |
00:00.387 |
0.0 |
Lanl Routes ( |
00:00.381 |
0.0 |
Four Grids ( |
00:00.359 |
0.0 |
Graphs from Polygons ( |
00:00.357 |
0.0 |
Words/Ladder Graph ( |
00:00.356 |
0.0 |
Decomposition ( |
00:00.356 |
0.0 |
Simple graph ( |
00:00.327 |
0.0 |
Degree Analysis ( |
00:00.308 |
0.0 |
Dedensification ( |
00:00.288 |
0.0 |
Sampson ( |
00:00.268 |
0.0 |
Lowest Common Ancestors ( |
00:00.263 |
0.0 |
Beam Search ( |
00:00.256 |
0.0 |
SNAP Graph Summary ( |
00:00.247 |
0.0 |
Morse Trie ( |
00:00.237 |
0.0 |
Roget ( |
00:00.235 |
0.0 |
Custom node icons ( |
00:00.232 |
0.0 |
Spectral Embedding ( |
00:00.220 |
0.0 |
Reverse Cuthill–McKee ( |
00:00.218 |
0.0 |
Directed Graph ( |
00:00.216 |
0.0 |
Circular Tree ( |
00:00.210 |
0.0 |
Labels And Colors ( |
00:00.199 |
0.0 |
Napoleon Russian Campaign ( |
00:00.166 |
0.0 |
Knuth Miles ( |
00:00.166 |
0.0 |
Find Shortest Path ( |
00:00.153 |
0.0 |
Iterated Dynamical Systems ( |
00:00.142 |
0.0 |
Antigraph ( |
00:00.140 |
0.0 |
Ego Graph ( |
00:00.135 |
0.0 |
Random Geometric Graph ( |
00:00.130 |
0.0 |
Properties ( |
00:00.124 |
0.0 |
Atlas ( |
00:00.121 |
0.0 |
Cluster Layout ( |
00:00.118 |
0.0 |
DAG - Topological Layout ( |
00:00.116 |
0.0 |
Traveling Salesman Problem ( |
00:00.114 |
0.0 |
Rainbow Coloring ( |
00:00.108 |
0.0 |
Circuits ( |
00:00.089 |
0.0 |
Weighted Graph ( |
00:00.087 |
0.0 |
Minimum Spanning Tree ( |
00:00.079 |
0.0 |
Cycle Detection ( |
00:00.075 |
0.0 |
House With Colors ( |
00:00.075 |
0.0 |
2D Grid ( |
00:00.074 |
0.0 |
Basic matplotlib ( |
00:00.073 |
0.0 |
Karate Club ( |
00:00.070 |
0.0 |
Degree Sequence ( |
00:00.069 |
0.0 |
Expected Degree Sequence ( |
00:00.068 |
0.0 |
Multipartite Layout ( |
00:00.066 |
0.0 |
Self-loops ( |
00:00.064 |
0.0 |
Davis Club ( |
00:00.060 |
0.0 |
Unix Email ( |
00:00.056 |
0.0 |
Custom Node Position ( |
00:00.054 |
0.0 |
Maximum Independent Set ( |
00:00.054 |
0.0 |
Read and write graphs. ( |
00:00.051 |
0.0 |
Edge Colormap ( |
00:00.050 |
0.0 |
Print Graph ( |
00:00.049 |
0.0 |
Krackhardt Centrality ( |
00:00.049 |
0.0 |
Erdos Renyi ( |
00:00.047 |
0.0 |
Simple Path ( |
00:00.044 |
0.0 |
Node Colormap ( |
00:00.042 |
0.0 |
Attributes ( |
00:00.026 |
0.0 |
Conversion ( |
00:00.024 |
0.0 |
Football ( |
00:00.014 |
0.0 |
OpenStreetMap with OSMnx ( |
00:00.003 |
0.0 |
Graphs from a set of lines ( |
00:00.003 |
0.0 |
Mayavi2 ( |
00:00.000 |
0.0 |
JavaScript ( |
00:00.000 |
0.0 |