Regina Calculation Engine
Public Member Functions | Public Attributes | List of all members
regina::TreeDecomposition::Graph Struct Reference

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
 
Graphoperator= (const Graph &)=delete
 

Public Attributes

int order_
 The number of nodes in the graph. More...
 
bool ** adj_
 The adjacency matrix for the graph. More...
 

Detailed Description

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.

Python
Not present.

The documentation for this struct was generated from the following file:

Copyright © 1999-2021, The Regina development team
This software is released under the GNU General Public License, with some additional permissions; see the source code for details.
For further information, or to submit a bug or other problem, please contact Ben Burton (bab@maths.uq.edu.au).