How to read each algorithm 01 Load the graph and open the panel. The Grid preset is a 4 × 5 lattice; Petersen is 3-regular with 10 nodes and 15 edges; the default graph mixes degrees. 02 Degree / diameter / girth prints thirteen rows, from density to self-loops and parallel edges; the canvas tags each node with its degree. 03 Centrality (Brandes) prints the highest-betweenness node first and one row per node with degree, closeness and betweenness. 04 PageRank accepts a damping value (default 0.85) and reports iterations, final L1 change, dangling nodes and the ranking; the top node is highlighted. 05 Euler trail states circuit, path or none, names the odd-degree vertices and lists the trail.
Worked readouts
Graph · algorithm
Readout
Grid 4 × 5 · Degree / diameter / girth
20 nodes / 31 edges; density 0.1632 ; degree sequence starts 4, 4, 4, 4, 4, 4, 3, … ; diameter 7 ; radius 4 ; center 2-3, 3-3 ; girth 4 ; triangles 0 ; avg clustering 0
Petersen · Degree / diameter / girth
10 nodes / 15 edges; density 0.3333 ; every degree 3 ; diameter 2 ; radius 2 ; girth 5 ; triangles 0
Grid · Centrality (Brandes)
highest betweenness 3-3 (42.23) ; top closeness 2-3 (0.4318) ; corner 1-1 betweenness 2.38
Default graph · PageRank, damping 0.85
18 iterations; final L1 change 8.67e-13 ; C 0.2153 , D 0.2153 , B 0.1667 , A 0.118 ; dangling None
Petersen · PageRank
1 iteration; every node 0.1
Bridge preset · Euler trail
verdict Eulerian path exists ; odd-degree vertices B, E ; trail B → A → C → B → D → E → F → G → E
Complete K₆ · Euler trail
verdict None ; reason names all 6 odd-degree vertices
The grid and the Petersen graph share a zero triangle count but nothing else: girth 4 against 5 , diameter 7 against 2 . Centrality agrees with intuition — on the grid the four corners score lowest (2.38 ) and the two middle nodes highest (42.23 ) — and the Euler verdict on the bridge preset finds the two odd vertices and walks all eight edges.
Hops and symmetric answers Every distance in this panel is a hop count: the grid's diameter 7 is seven edges, not seven units of weight, and centrality ignores the weights you typed. The Petersen result is the other trap: PageRank converges in 1 iteration with 0.1 for each of the ten nodes. That is not a broken run — a 3-regular symmetric graph has a uniform stationary distribution — and the iteration and delta rows are how you tell "converged instantly" from "did not move". Compare with the grid's 65 iterations and spread of 0.03556 to 0.06134 .
Limits Unweighted, hop-based metrics. Diameter, radius, center, girth and all three centralities use hop counts; weighted structure belongs to shortest path and spanning tree .
No spectral or percolation analysis. The panel does not compute Laplacian eigenvalues, algebraic connectivity or robustness curves, and it does not run on graphs past the canvas limits (about 60 nodes from presets, 14 for the matrix editor). What it doesn't do. It does not export a metrics report or compare two graphs side by side — write the adjacency matrix to the workspace and take it to math tools for spectra, or to statistics for a distribution over sampled graphs.
Where it is useful Fingerprinting a structure Two graphs can share node and edge counts and still differ. Petersen: 10 / 15 , diameter 2 , girth 5 , every degree 3 . A random 10-node graph with the same density has a larger diameter and triangles. The fingerprint rows — degree sequence, girth, triangles — separate them in one glance.
Ranking and routing checks On the default graph PageRank puts C and D level at 0.2153 , matching their shared betweenness of 2.67 ; on the grid the center beats the corners by an order of magnitude. Use the two rankings together: PageRank answers "who is important by links", Brandes answers "who sits on the routes". For an edge-covering route, the Euler trail row decides before you walk: the bridge preset has exactly two odd vertices, so a single trail exists.
Privacy All metric, centrality and PageRank computation runs locally in your browser; nothing is uploaded.
References
Wikipedia, Distance (graph theory) , en.wikipedia.org (访问日期:2026-10-07)— eccentricity, diameter, radius and center.
Wikipedia, Centrality , en.wikipedia.org (访问日期:2026-10-07)— degree, closeness and betweenness definitions.
Wikipedia, PageRank , en.wikipedia.org (访问日期:2026-10-07)— damping and power iteration.
Wikipedia, Eulerian path , en.wikipedia.org (访问日期:2026-10-07)— odd-degree criterion and trail construction.
Calculators in this hub
Hand-picked tools, one click away. The mini versions compute live and carry your values into the full calculator.
Sources & review
Reviewed by CalcX Editorial Team
Updated 2026-10-07