#include <ostream>
#include <vector>
#include <algorithm>
#include <dai/util.h>
#include <dai/exceptions.h>
Go to the source code of this file.
Namespaces | |
namespace | dai |
Classes | |
class | dai::GraphAL |
Represents the neighborhood structure of nodes in an undirected graph. More... | |
struct | dai::GraphAL::Neighbor |
Describes the neighbor relationship of two nodes in a GraphAL. 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. |