Uses of Interface
com.jgalgo.alg.isomorphism.IsomorphismMapping

Packages that use IsomorphismMapping

Package	Description
com.jgalgo.alg.isomorphism	Algorithms for determining isomorphism between graphs.

Uses of IsomorphismMapping in com.jgalgo.alg.isomorphism

Subinterfaces of IsomorphismMapping in com.jgalgo.alg.isomorphism

Modifier and Type	Interface	Description
interface	IsomorphismIMapping	A mapping between two graphs that preserves the structure of the graphs for IntGraph.

Methods in com.jgalgo.alg.isomorphism that return IsomorphismMapping

Modifier and Type	Method	Description
IsomorphismMapping<V2,E2,V1,E1>	IsomorphismMapping.inverse()	Get the inverse mapping.

Methods in com.jgalgo.alg.isomorphism that return types with arguments of type IsomorphismMapping

Modifier and Type	Method	Description
default <V1, E1, V2, E2> Optional<IsomorphismMapping<V1,E1,V2,E2>>	IsomorphismTester.isomorphicMapping(Graph<V1,E1> g1, Graph<V2,E2> g2)	Get an induced sub graph isomorphism mapping between two graphs if one exists.
default <V1, E1, V2, E2> Optional<IsomorphismMapping<V1,E1,V2,E2>>	IsomorphismTester.isomorphicMapping(Graph<V1,E1> g1, Graph<V2,E2> g2, boolean induced)	Get a sub graph isomorphism mapping between two graphs if one exists, optionally induced.
default <V1, E1, V2, E2> Iterator<IsomorphismMapping<V1,E1,V2,E2>>	IsomorphismTester.isomorphicMappingsIter(Graph<V1,E1> g1, Graph<V2,E2> g2)	Get an iterator over all the induced sub graph isomorphism mappings between two graphs.
default <V1, E1, V2, E2> Iterator<IsomorphismMapping<V1,E1,V2,E2>>	IsomorphismTester.isomorphicMappingsIter(Graph<V1,E1> g1, Graph<V2,E2> g2, boolean induced)	Get an iterator over all the sub graph isomorphism mappings between two graphs, optionally induced.
<V1, E1, V2, E2> Iterator<IsomorphismMapping<V1,E1,V2,E2>>	IsomorphismTester.isomorphicMappingsIter(Graph<V1,E1> g1, Graph<V2,E2> g2, boolean induced, BiPredicate<? super V1,? super V2> vertexMatcher, BiPredicate<? super E1,? super E2> edgeMatcher)	Get an iterator over all the sub graph isomorphism mappings between two graphs, optionally induced, with vertex and/or edge matchers.
<V1, E1, V2, E2> Iterator<IsomorphismMapping<V1,E1,V2,E2>>	IsomorphismTesterAbstract.isomorphicMappingsIter(Graph<V1,E1> g1, Graph<V2,E2> g2, boolean induced, BiPredicate<? super V1,? super V2> vertexMatcher, BiPredicate<? super E1,? super E2> edgeMatcher)