i-graph
The I graph construction gives a family of graphs which generalize the generalized Petersen graph. These graphs make for interesting test cases for various graph algorithms.
Example
var I = //First make a Petersen graph:var petersen = //Now make a more complicated graphvar circ =
require("i-graph")(n, k, j)
Constructs a generalized-generalized Petersen graph.
n
is the number of verticesk
is the step for the inner star polygonj
(optional) is the step for the outer star polygon. If not specified, assume 1 and generate a generalized Petersen graph.
Returns The edges of a generalized Petersen graph.
Credits
(c) 2013 Mikola Lysenko. MIT License