Defines the GraphAL class, which represents an undirected graph as an adjacency list.
More...
Functions |
GraphAL | dai::createGraphFull (size_t N) |
| Creates a fully-connected graph with N nodes.
|
GraphAL | dai::createGraphGrid (size_t N1, size_t N2, bool periodic) |
| Creates a two-dimensional rectangular grid of N1 by N2 nodes, which can be periodic.
|
GraphAL | dai::createGraphGrid3D (size_t N1, size_t N2, size_t N3, bool periodic) |
| Creates a three-dimensional rectangular grid of N1 by N2 by N3 nodes, which can be periodic.
|
GraphAL | dai::createGraphLoop (size_t N) |
| Creates a graph consisting of a single loop of N nodes.
|
GraphAL | dai::createGraphTree (size_t N) |
| Creates a random tree-structured graph of N nodes.
|
GraphAL | dai::createGraphRegular (size_t N, size_t d) |
| Creates a random regular graph of N nodes with uniform connectivity d.
|
Defines the GraphAL class, which represents an undirected graph as an adjacency list.