| Package | Description |
|---|---|
| org.jgrapht.experimental.equivalence |
Classes which enable working with Equivalence Sets.
|
| org.jgrapht.experimental.isomorphism |
Algorithms which provide isomorphism check between two graphs.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
EquivalenceComparatorChain<E,C>
A container of comparators, which are tested in a chain until the first
result can be supplied.
|
| Modifier and Type | Class and Description |
|---|---|
class |
EquivalenceComparatorChainBase<E,C>
This class implements comparator chaining.
Usage examples: graph-theory, node equivalence: You can create a comparator for the inDegree of a node, another for the total weight of outDegree edges, and a third which checks the business content of the node. |
class |
UniformEquivalenceComparator<E,C>
This Equivalence comparator acts as if all elements are in one big global
equivalence class.
|
| Modifier and Type | Field and Description |
|---|---|
protected EquivalenceComparator<? super E,? super C> |
EquivalenceSet.eqComparator
The comparator used to define the group
|
| Modifier and Type | Method and Description |
|---|---|
void |
EquivalenceComparatorChainBase.appendComparator(EquivalenceComparator comparatorAfter) |
void |
EquivalenceComparatorChain.appendComparator(EquivalenceComparator<E,C> comparatorAfter)
Adds a comparator which will also test equivalence.
|
static <EE,CC> EquivalenceSet[] |
EquivalenceSetCreator.createEqualityGroupOrderedArray(Collection<EE> elements,
EquivalenceComparator<? super EE,? super CC> aEqComparator,
CC aContext)
Checks for equivalance groups in the aElementsArray.
|
static <EE,CC> EquivalenceSet[] |
EquivalenceSetCreator.createEqualityGroupOrderedArray(EE[] aElementsArray,
EquivalenceComparator<? super EE,? super CC> aEqComparator,
CC aContext)
Deprecated.
To improve type-safety when using generics, use
EquivalenceSetCreator.createEqualityGroupOrderedArray(Collection, EquivalenceComparator,
Object) |
| Constructor and Description |
|---|
EquivalenceComparatorChainBase(EquivalenceComparator<E,C> firstComaparator) |
EquivalenceSet(E aElement,
EquivalenceComparator<? super E,? super C> aEqComparator,
C aComparatorContext)
Constructs a new EquivalenceSet, filled with the aElement parameter and a
reference to the comparator which is used.
|
| Modifier and Type | Class and Description |
|---|---|
class |
VertexDegreeEquivalenceComparator<V,E>
Two vertexes are equivalent under this comparator if and only if:
they have the same IN degree
|
| Modifier and Type | Method and Description |
|---|---|
protected static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createAppropriateConcreteInspector(int graphType,
Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker)
Checks the graph type, and accordingly decides which type of concrete
inspector class to create.
|
protected static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createAppropriateConcreteInspector(int graphType,
Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker)
Checks the graph type, and accordingly decides which type of concrete
inspector class to create.
|
static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createIsomorphismInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker)
Creates a new inspector, letting this class determine what is the most
efficient algorithm.
|
static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createIsomorphismInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker)
Creates a new inspector, letting this class determine what is the most
efficient algorithm.
|
static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createIsomorphismInspectorByType(int type,
Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker)
Creates a new inspector for a particular graph type (planar / tree /
other).
|
static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createIsomorphismInspectorByType(int type,
Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker)
Creates a new inspector for a particular graph type (planar / tree /
other).
|
protected static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createTopologicalExhaustiveInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker) |
protected static <V,E> GraphIsomorphismInspector |
AdaptiveIsomorphismInspectorFactory.createTopologicalExhaustiveInspector(Graph<V,E> graph1,
Graph<V,E> graph2,
EquivalenceComparator<V,Graph<V,E>> vertexChecker,
EquivalenceComparator<E,Graph<V,E>> edgeChecker) |
Copyright © 2015. All Rights Reserved.