sparc/html/coarsen_8h_source.html

 #ifndef COARSEN_H

 #define COARSEN_H


 int mxm_shared(Graph& g, std::vector<int> &colors, int numColors);


 int colorGraph_shared(Graph& g, std::vector<int> &colors, int &numColors);


 int mis_shared(Graph& g, std::vector<int> finalRemoveList, std::vector<int> &I, int currentColor);


 int doubleSelect_shared(std::vector<int> &colors, int currentColor, std::vector<int> matchList, int unmatchedValue, std::vector<int> &nodeList);


 int selectUnmatched_shared(std::vector<int> matchList, int unmatchedValue, std::vector<int> &nodeList);


 std::vector<int> inclusiveScan_shared(std::vector<int> a);


 #endif

Graph
TODO: Give description of Graph class and add comments to each function.
Definition: graph.h:37

inclusiveScan_shared
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...

colorGraph_shared
int colorGraph_shared(Graph &g, std::vector< int > &colors, int &numColors)
Compute colors for graph coarsening implementing openmp parallelism.

selectUnmatched_shared
int selectUnmatched_shared(std::vector< int > matchList, int unmatchedValue, std::vector< int > &nodeList)
Find unmatched nodes of a particular color.

doubleSelect_shared
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.

mxm_shared
int mxm_shared(Graph &g, std::vector< int > &colors, int numColors)
Compute maximal matching for graph.

mis_shared
int mis_shared(Graph &g, std::vector< int > finalRemoveList, std::vector< int > &I, int currentColor)
Compute maximal independent set.