| Class | Description |
|---|---|
| BAGraph |
Implements a Barabasi-Albert (BA) random graph model.
|
| BinaryHierarchicalGraph |
Makes a random hierarchical graph by considering points P = {1,2,...,n} and
partitions C_{i,j}, where j is the granularity.
|
| BinaryTree |
Implements a binary tree of nodes labeled 1,2,...,n.
|
| BinaryTreeGraph | |
| CircleGraph |
Class that represents a graph with a circle "shape"
|
| ClusteredERGraph |
Makes a clustered graph by connecting a specified number of clusters (i.e.
|
| ErdosRenyiGraph |
Implements the Erdos-Renyi G(n,p) model.
|
| ForestFireGraph |
This class creates a random graph generated from the forest fire model.
|
| GraphInstanceGenerator |
This class abstracts the construction of graphs.
|
| HierarchicalERGraph | |
| KNearestNeighborsGraph |
Generates n random points in [0,1]^d and connects each point to its k-nearest
neighbors
|
| ManifoldGraph |
This class is used to create a k-nearest neighbors graph on a manifold.
|
| PrescribedDegrees |
Implements a random prescribed degree graph by the algorithm presented in
J.Blitstein and P.Diaconis
|
| RandomGeometricGraph |
Generates n random points in [0,1]^d and connects an edge between points x
and y if d(x,y) |
| SphereGraph | |
| StochasticBlockmodel | |
| TorusGraph |
| Enum | Description |
|---|---|
| GraphInstanceGenerator.ImplementationType |