Interface and Description |
---|
org.jgrapht.ext.EdgeNameProvider
in favor of
ComponentNameProvider |
org.jgrapht.graph.MaskFunctor
in favor of using lambdas
|
org.jgrapht.alg.interfaces.MinimumSpanningTree
In favor of
SpanningTreeAlgorithm . |
org.jgrapht.alg.PathValidator
Use
PathValidator instead. |
org.jgrapht.ext.VertexNameProvider
in favor of
ComponentNameProvider |
org.jgrapht.ext.VertexUpdater
in favor of
ComponentUpdater |
org.jgrapht.alg.interfaces.WeightedMatchingAlgorithm
Use
MatchingAlgorithm directly |
Method and Description |
---|
org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.buildMaximumFlow(V, V) |
org.jgrapht.ext.DOTUtils.convertGraphToDotString(Graph<V, E>)
in favor of implementing the current functionality directly by the user
|
org.jgrapht.graph.AbstractBaseGraph.createDirectedSpecifics()
specifics can be changed by overriding directly
AbstractBaseGraph.createSpecifics() . |
org.jgrapht.graph.AbstractBaseGraph.createUndirectedSpecifics()
specifics can be changed by overriding directly
AbstractBaseGraph.createSpecifics() . |
org.jgrapht.alg.interfaces.MatchingAlgorithm.getMatching()
Use
MatchingAlgorithm.computeMatching() instead. |
org.jgrapht.alg.interfaces.WeightedMatchingAlgorithm.getMatchingWeight()
Use
MatchingAlgorithm.computeMatching() instead. |
Constructor and Description |
---|
org.jgrapht.graph.DirectedMaskSubgraph(DirectedGraph<V, E>, MaskFunctor<V, E>)
in favor of using lambdas
|
org.jgrapht.graph.MaskSubgraph(Graph<V, E>, MaskFunctor<V, E>)
in favor of using the constructor with lambdas
|
org.jgrapht.util.ModifiableInteger()
not really deprecated, just marked so to avoid mistaken use.
|
org.jgrapht.graph.UndirectedMaskSubgraph(UndirectedGraph<V, E>, MaskFunctor<V, E>)
in favor of using lambdas
|
Copyright © 2017. All rights reserved.