|
|
n
m
d
Path (n vertices)
Cycle (n vertices)
Complete Binary Tree (2^n vertices)
Complete Graph (n vertices)
Complete Bipartite Graph (n*2 vertices)
CycleOfCliques (n*m vertices)
TriangularMesh (n*(n-1) vertices)
SquareMesh (n*n vertices)
Hypercube (2^n vertices)
Torus (n*n vertices)
TimedBuilder
|