public class LpConstraints
extends java.lang.Object
| Constructor and Description |
|---|
LpConstraints(CoSeNet D,
CoSeNet D1,
CoSeMap cosemap) |
| Modifier and Type | Method and Description |
|---|---|
void |
binaryMapping() |
void |
childTransitivity() |
void |
encodeCoSeMap() |
void |
initialise() |
void |
maintainAncestors() |
void |
maintainOrder() |
void |
mapLoops() |
void |
maximalSubgraphs()
We want that two nodes are mapped if they have the most
mapped subgraphs, i.e.
|
void |
maxMapping() |
void |
oneOnOne() |
void |
solve() |
public CoSeMap cosemap
public void initialise()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void maxMapping()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void binaryMapping()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void encodeCoSeMap()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void childTransitivity()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void maximalSubgraphs()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void maintainOrder()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void mapLoops()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void maintainAncestors()
throws java.lang.Exception
java.lang.Exceptionpublic void oneOnOne()
throws lpsolve.LpSolveException
lpsolve.LpSolveExceptionpublic void solve()
throws lpsolve.LpSolveException
lpsolve.LpSolveException