Base class for graph partitioners. More...
#include <GraphPartitioner.h>
Public Member Functions | |
| virtual int | partition (Graph &theGraph, int numPart)=0 |
| Method invoked to partition the graph. More... | |
Protected Member Functions | |
| GraphPartitioner (void) | |
| Constructor. | |
Detailed Description
Base class for graph partitioners.
A graph partitioner is an algorithm for partitioning (coloring) the vertices of a graph.
GraphPartitioner is an abstract base class. Its subtypes are responsible for partitioning the vertices of a graph. The partitioning is done in the method partition which sets the colors of the vertices of the graph to colors 1 through numPartitions.
Member Function Documentation
◆ partition()
|
pure virtual |
Method invoked to partition the graph.
This is the method invoked to partition the graph into numPart partitions. On completion of the routine each vertex will be assigned a color \(1\) through numPart, the color assigned indicating the partition to which the vertex belongs. Returns a 0 if successful, a negative number if not; the value depending on the subclass.
The documentation for this class was generated from the following file:
- src/solution/graph/partitioner/GraphPartitioner.h
