Generators for graphs of various topologies.
-
class
Barabási-Albert growth and preferential attachment forest generator.
class
Barabási-Albert growth and preferential attachment graph generator.
class
class
class
Generates a complete graph of any size.
class
A generator for directed scale-free graphs.
class
class
Generator for
Generalized
Petersen Graphs The Generalized Petersen graphs $GP(n,k)$ are a family of cubic graphs formed
by connecting the vertices of a regular polygon (cycle graph $C_n$) to the corresponding vertices
of a star polygon ${n,k}$.
class
Create a random bipartite graph based on the $G(n, M)$ Erdős–Rényi model.
class
Create a random graph based on the $G(n, M)$ Erdős–Rényi model.
class
Create a random bipartite graph based on the $G(n, p)$ Erdős–Rényi model.
class
Create a random graph based on the $G(n, p)$ Erdős–Rényi model.
class
class
class
Kleinberg's small-world graph generator.
class
Generates a linear graph of any size.
class
The linearized chord diagram graph model generator.
class
Create a random $l$-planted partition graph.
class
Generates a random tree using Prüfer sequences.
class
Generate a random $d$-regular undirected graph with $n$ vertices.
class
Generates a ring graph of any size.
class
class
A simple weighted bipartite graph matrix generator.
class
A simple weighted graph matrix generator.
class
class
Watts-Strogatz small-world graph generator.
class
class