Search Java Classes and Packages
#Org.jgrapht.experimental Classes and Interfaces - 38 results found.
| Name | Description | Type | Package | Framework |
| AdaptiveIsomorphismInspectorFactory | This class serves as a factory for GraphIsomorphismInspector concrete implementations. | Class | org.jgrapht.experimental.isomorphism | JGraph |
| ApproximationAlgorithm | Interface | org.jgrapht.experimental.alg | JGraph | |
| ArrayPermutationsIter | An interface to iterate over array permutations. | Interface | org.jgrapht.experimental.permutation | JGraph |
| BrownBacktrackColoring | Class | org.jgrapht.experimental.alg.color | JGraph | |
| CollectionPermutationIter | Given a container with elements (Collection,Enumeration,array) defines a permutation iterator which returns, on each iteration, a differnt permutation | Class | org.jgrapht.experimental.permutation | JGraph |
| CompoundPermutationIter | For permutation like this: 1,2 are the same eq. | Class | org.jgrapht.experimental.permutation | JGraph |
| DirectedAcyclicGraph | DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast | Class | org.jgrapht.experimental.dag | JGraph |
| DirectedAcyclicGraph .CycleFoundException | Exception used in dfsF when a cycle is foundAuthor:gilespSee Also:Serialized Form | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .Region | Region is an *inclusive* range of indices. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .TopoOrderMapping | For performance tuning, an interface for storing the topological orderingget the topological index of the given vertex. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .TopoOrderMappingFactory | DirectedAcyclicGraph. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .Visited | this interface allows specification of a strategy for marking vertices as visited (based on their topological index, so the vertex type isn't part | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedArrayImpl | This implementation, somewhat to my surprise, is slower than the ArrayList version, probably due to its reallocation of the underlying | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedArrayListImpl | This implementation seems to offer the best performance in most cases. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedBitSetImpl | This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedFactory | DirectedAcyclicGraph. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedHashSetImpl | This implementation doesn't seem to perform as well, though I can imagine circumstances where it should shine (lots and lots of vertices). | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| EquivalenceComparator | This interface distinguishes between Equivalence sets. | Interface | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceComparatorChain | A container of comparators, which are tested in a chain until the first result can be supplied. | Interface | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceComparatorChainBase | This class implements comparator chaining. | Class | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceSet | EquivalenceSet is a Set of elements which have been determined to be equivalent using EquivalenceComparator. | Class | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceSetCreator | Class | org.jgrapht.experimental.equivalence | JGraph | |
| ExactAlgorithm | Interface | org.jgrapht.experimental.alg | JGraph | |
| GraphIsomorphismInspector | Isomorphism Overview Isomorphism is the problem of testing whether two graphs are topologically | Interface | org.jgrapht.experimental.isomorphism | JGraph |
| GraphOrdering | Holds graph information as int labels only. | Class | org.jgrapht.experimental.isomorphism | JGraph |
| GraphReader | Class | org.jgrapht.experimental | JGraph | |
| GraphSquare | Class | org.jgrapht.experimental | JGraph | |
| GraphTests | Class | org.jgrapht.experimental | JGraph | |
| GreedyColoring | Class | org.jgrapht.experimental.alg.color | JGraph | |
| IntArrayGraphAlgorithm | Class | org.jgrapht.experimental.alg | JGraph | |
| IntegerPermutationIter | Iterates through permutations of N elements. | Class | org.jgrapht.experimental.permutation | JGraph |
| IsomorphismRelation | Holds an isomorphism relation for two graphs. | Class | org.jgrapht.experimental.isomorphism | JGraph |
| PartiteRandomGraphGenerator | PartiteRandomGraphGenerator generates a partite uniform random graph of any size. | Class | org.jgrapht.experimental | JGraph |
| PermutationFactory | Factory to create Permutations of several types and use them as Enumerations. | Class | org.jgrapht.experimental.permutation | JGraph |
| RandomGraphHelper | UniformRandomGraphGenerator generates a uniform random graph of any size. | Class | org.jgrapht.experimental | JGraph |
| UniformEquivalenceComparator | This Equivalence comparator acts as if all elements are in one big global equivalence class. | Class | org.jgrapht.experimental.equivalence | JGraph |
| UniformRandomGraphGenerator | UniformRandomGraphGenerator generates a uniform random graph of any size. | Class | org.jgrapht.experimental | JGraph |
| VertexDegreeEquivalenceComparator | Two vertexes are equivalent under this comparator if and only if: they have the same IN degree | Class | org.jgrapht.experimental.isomorphism | JGraph |