public class MaxComSub
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
protected int |
costs
the costs of the best sequence of edit operations transforming
graph 1 into graph 2
|
protected int[] |
edgemap
the mapping of the edges of graph 1 to graph 2
|
protected Graph |
g1
the first graph of the pair
for which to find the maximum common subgraph
|
protected Graph |
g2
the second graph of the pair
for which to find the maximum common subgraph
|
protected Graph |
mcs
the found maximum common subgraph (created on demand)
|
protected int[] |
nodemap
the mapping of the nodes of graph 1 to graph 2
|
Constructor and Description |
---|
MaxComSub(Graph g1,
Graph g2)
Find the maximum common subgraph of two given graphs.
|
MaxComSub(Graph g1,
Graph g2,
boolean byNode)
Find the maximum common subgraph of two given graphs.
|
Modifier and Type | Method and Description |
---|---|
int |
getCosts()
Get the costs of the best sequence of edit operations.
|
int[] |
getEdgeMap()
Get the mapping of the edges of graph 1 to the edges of graph 2.
|
Graph |
getGraph()
Get the mapping of the edges of graph 1 to the edges of graph 2.
|
int[] |
getNodeMap()
Get the mapping of the nodes of graph 1 to the nodes of graph 2.
|
static void |
main(java.lang.String[] args)
Main function for basic testing basic functionality.
|
protected Graph g1
protected Graph g2
protected int costs
protected int[] nodemap
protected int[] edgemap
protected Graph mcs
public MaxComSub(Graph g1, Graph g2)
g1
- the first graphg2
- the second graphpublic int getCosts()
public int[] getNodeMap()
public int[] getEdgeMap()
public Graph getGraph()
public static void main(java.lang.String[] args)
args
- the command line arguments