V - the type of the verticesE - the type of the edgespublic abstract class VF2AbstractIsomorphismInspector<V,E> extends Object implements IsomorphismInspector<V,E>
This implementation of the VF2 algorithm does not support graphs with multiple edges.
| Modifier and Type | Field and Description |
|---|---|
protected Comparator<E> |
edgeComparator |
protected Graph<V,E> |
graph1 |
protected Graph<V,E> |
graph2 |
protected org.jgrapht.alg.isomorphism.GraphOrdering<V,E> |
ordering1 |
protected org.jgrapht.alg.isomorphism.GraphOrdering<V,E> |
ordering2 |
protected Comparator<V> |
vertexComparator |
| Constructor and Description |
|---|
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
Graph<V,E> graph2)
Construct a new base implementation of the VF2 isomorphism inspector.
|
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
boolean cacheEdges)
Construct a new base implementation of the VF2 isomorphism inspector.
|
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
Comparator<V> vertexComparator,
Comparator<E> edgeComparator)
Construct a new base implementation of the VF2 isomorphism inspector.
|
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
Comparator<V> vertexComparator,
Comparator<E> edgeComparator,
boolean cacheEdges)
Construct a new base implementation of the VF2 isomorphism inspector.
|
| Modifier and Type | Method and Description |
|---|---|
abstract Iterator<GraphMapping<V,E>> |
getMappings()
Get an iterator over all calculated (isomorphic) mappings between two graphs.
|
boolean |
isomorphismExists()
Check if an isomorphism exists.
|
protected Comparator<V> vertexComparator
protected Comparator<E> edgeComparator
public VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges)
graph1 - the first graphgraph2 - the second graphvertexComparator - comparator for semantic equivalence of verticesedgeComparator - comparator for semantic equivalence of edgescacheEdges - if true, edges get cached for faster accesspublic VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator)
graph1 - the first graphgraph2 - the second graphvertexComparator - comparator for semantic equivalence of verticesedgeComparator - comparator for semantic equivalence of edgespublic VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, boolean cacheEdges)
graph1 - the first graphgraph2 - the second graphcacheEdges - if true, edges get cached for faster accesspublic abstract Iterator<GraphMapping<V,E>> getMappings()
IsomorphismInspectorgetMappings in interface IsomorphismInspector<V,E>public boolean isomorphismExists()
IsomorphismInspectorisomorphismExists in interface IsomorphismInspector<V,E>Copyright © 2018. All rights reserved.