Man pages for adamsardar/stoneTrees
Solve Node Centric Steiner Tree Problems
| calculateAPSPmodule | create a module of the set of all-pairs shortest paths (APSP) |
| condenseSearchGraph | Collapse neighbouring terminal and potential terminal nodes... |
| findHeinzMStTP | use the heinz algorithm to find a solution to the minimum... |
| findHeinzMWCS | use the heinz algorithm to find a solution to the maximum... |
| gene42_igraph | gene42 example from SteinLib |
| karateGraph | Zachary's famous karate graph |
| lymphomaGraph | Lymphoma example from DIMAC11 challenge |
| nodeCentricSteinerForestProblem | Solve multiple bootstrap Minimum Steiner Tree problems (aka... |
| nodeCentricSteinerTreeProblem | Solve Steiner problems (MStTP or MWCS) with uniform or no... |
| parseSTPfile | extract out the edge/arc and terminal information from a STP... |
| readMStTPgraph | create an igraph representation of a MStT problem |
| readMWCSgraph | create an igraph representation of a MWCS problem |
| stoneTrees | Solve Minimum Steiner Tree (MStT) and Maximum-Weight... |
| subOptimalSteinerProblem | Collect degenerate and sub-optimal solutions to Steiner... |
| toCPXMatrix | Function to map a constraint matrix to a cplex compatible... |
| uncondenseGraph | Decondense a graph following a procedure to group together... |
| writeMStTPfile_heinzFormat | create an igraph representation of a MStT problem |
