IsomorphismInspector (JGraphT : a free Java graph library)

Type Parameters:

V - the type of the vertices

E - the type of the edges

All Known Implementing Classes:

AHUForestIsomorphismInspector, AHURootedTreeIsomorphismInspector, AHUUnrootedTreeIsomorphismInspector, ColorRefinementIsomorphismInspector, VF2AbstractIsomorphismInspector, VF2GraphIsomorphismInspector, VF2SubgraphIsomorphismInspector
```
public interface IsomorphismInspector<V,E>
```
General interface for graph and subgraph isomorphism.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`java.util.Iterator<GraphMapping<V,E>>`	`getMappings()`	Get an iterator over all calculated (isomorphic) mappings between two graphs.
`boolean`	`isomorphismExists()`	Check if an isomorphism exists.

- Method Detail
  - getMappings
```
java.util.Iterator<GraphMapping<V,E>> getMappings()
```
    Get an iterator over all calculated (isomorphic) mappings between two graphs.
    
    Returns:
    
    an iterator over all calculated (isomorphic) mappings between two graphs
    
    Throws:
    
    IsomorphismUndecidableException - if the inspector cannot decide whether the graphs are isomorphic
  - isomorphismExists
```
boolean isomorphismExists()
```
    Check if an isomorphism exists.
    
    Returns:
    
    true if there is an isomorphism, false if there is no isomorphism
    
    Throws:
    
    IsomorphismUndecidableException - if the inspector cannot decide whether the graphs are isomorphic