Regina Calculation Engine
|
Represents a graph, which may be directed or undirected. More...
#include <treewidth/treedecomposition.h>
Public Member Functions | |
Graph (int order) | |
Constructs a new graph with no arcs. More... | |
~Graph () | |
Destroys this graph. More... | |
void | dump (std::ostream &out) const |
Writes the adjacency matrix of this graph in a compact format to the given output stream. More... | |
Graph (const Graph &)=delete | |
Graph & | operator= (const Graph &)=delete |
Public Attributes | |
int | order_ |
The number of nodes in the graph. More... | |
bool ** | adj_ |
The adjacency matrix for the graph. More... | |
Represents a graph, which may be directed or undirected.
This is an internal class, used to convert input graphs into a common format before passing them to the main tree decomposition algorithms.