dolfinx::graph Namespace Reference

Graph data structures and algorithms. More...

Classes
class	AdjacencyList
	This class provides a static adjacency list data structure. It is commonly used to store directed graphs. For each node in the contiguous list of nodes [0, 1, 2, ..., n) it stores the connected nodes. The representation is strictly local, i.e. it is not parallel aware. More...
class	BoostGraphColoring
	This class colors a graph using the Boost Graph Library. More...
class	BoostGraphOrdering
	This class computes graph re-orderings. It uses Boost Graph. More...
class	KaHIP
	This class provides an interface to KaHIP parallel partitioner. More...
class	ParMETIS
	This class provides an interface to ParMETIS. More...
class	Partitioning
	Tools for distributed graphs. More...
class	SCOTCH
	This class provides an interface to SCOTCH-PT (parallel version) More...

Detailed Description

Graph data structures and algorithms.

Data structures for building and representing graphs, and algorithms on graphs, e.g., re-ordering and partitioning.