regina::TreeDecomposition::Graph Struct Reference

Represents a graph, which may be directed or undirected. More...

#include <treewidth/treedecomposition.h>

Public Member Functions
	Graph (size_t order)
	Constructs a new graph with no arcs.
	~Graph ()
	Destroys this graph.
void	dump (std::ostream &out) const
	Writes the adjacency matrix of this graph in a compact format to the given output stream.
	Graph (const Graph &)=delete
Graph &	operator= (const Graph &)=delete

Public Attributes
size_t	order_
	The number of nodes in the graph.
bool **	adj_
	The adjacency matrix for the graph.

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.

Constructor & Destructor Documentation

Graph()

regina::TreeDecomposition::Graph::Graph ( size_t order )

inline

Constructs a new graph with no arcs.

Parameters

order

the number of nodes in the new graph.

~Graph()

regina::TreeDecomposition::Graph::~Graph ( )

inline

Destroys this graph.

Member Function Documentation

dump()

void regina::TreeDecomposition::Graph::dump

(

std::ostream &

out

)

const

Writes the adjacency matrix of this graph in a compact format to the given output stream.

The output will be formatted as a matrix, and will be spread across multiple lines.

Parameters

out	the output stream to which to write.

Member Data Documentation

adj_

bool** regina::TreeDecomposition::Graph::adj_

The adjacency matrix for the graph.

Specifically, adj_[i][j] is true if and only if there is an arc from node i to node j.

order_

size_t regina::TreeDecomposition::Graph::order_

The number of nodes in the graph.

---

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

• treewidth/treedecomposition.h