|
|
<< PayoffMatrix | index | PreProcess >> DECIDE referenceDECIDE__ProcessGraphshort DECIDE_ProcessGraph( * double *ResultsMatrix,
* const long * ResultsMatrixSize,
* double *GraphMatrix,
* const short * RowsCount,
* const short * ColumnsCount,
* double * Input1,
* double * Output1,
* const short * Mode)
Apply a different algorithms to a graph matrix : * mode 1 : for a directed graph, determine if the GraphMatrix contains at least one cycle. If there is no cycle, Output1 is set to 0. If there is a cycle, Output1 is set to 1.
* mode 2 : for a directed graph, compute the nodes levels
* mode 3 : for a directed graph, compute the nodes ranks
* mode 40: for an undirected graph, compute the nodes degrees,
* mode 41 : for an undirected graph, give each node a unique number based on decreasing nodes degrees
* mode 42 : for an undirected graph, give each node a unique number based on increasing nodes degrees
* mode 45 : for an undirected graph, apply the Welsh and Powell colouring algorithm (give a colour to each node, without giving the same colour to adjacent nodes)
* mode 50 : for an undirected graph, compute a minimum partial tree
return value : * 0 : completed successfully
* 1 : null pointer in first parameter
* 2 : null pointer in second parameter
* 3 : null pointer in third parameter
* 4 : null pointer in fourth parameter
* 5 : null pointer in fifth parameter
* 6 : null pointer in sixth parameter
* 7 : null pointer in seventh parameter
* 8 : null pointer in eighth parameter
* 101 : *RowsCount < 1
* 102 : *ColumnsCount < 1
* 103 : *pshColumnsCount != *pshRowsCount
* 104 : *ploResultsMatrixSize < ((*pshRowsCount) * (*pshRowsCount) * sizeof(double))
* 105 : invalid Mode
* 106 : invalid data in GraphMatrix (only 0's and 1's allowed for this mode)
* 107 : invalid data in GraphMatrix (matrix must be symmetrical for this mode)
* 900 : malloc() failed
<< PayoffMatrix | index | PreProcess >>
|