112 int mis_shared(
Graph& g, std::vector<int> finalRemoveList, std::vector<int> &I,
int currentColor);
125 int doubleSelect_shared(std::vector<int> &colors,
int currentColor, std::vector<int> matchList,
int unmatchedValue, std::vector<int> &nodeList);
TODO: Give description of Graph class and add comments to each function.
Definition: graph.h:37
std::vector< int > inclusiveScan_shared(std::vector< int > a)
Performs parallel inclusive scan on vector. Does not use pass by reference since algorithm is recursi...
int colorGraph_shared(Graph &g, std::vector< int > &colors, int &numColors)
Compute colors for graph coarsening implementing openmp parallelism.
int selectUnmatched_shared(std::vector< int > matchList, int unmatchedValue, std::vector< int > &nodeList)
Find unmatched nodes of a particular color.
int doubleSelect_shared(std::vector< int > &colors, int currentColor, std::vector< int > matchList, int unmatchedValue, std::vector< int > &nodeList)
Find unmatched nodes of a particular color.
int mxm_shared(Graph &g, std::vector< int > &colors, int numColors)
Compute maximal matching for graph.
int mis_shared(Graph &g, std::vector< int > finalRemoveList, std::vector< int > &I, int currentColor)
Compute maximal independent set.