| Class and Description | 
|---|
| org.jgrapht.GraphHelper
 Use  
Graphs instead. | 
| org.jgrapht.graph.GraphPathImpl
 use  
GraphWalk instead | 
| org.jgrapht.alg.MinSourceSinkCut
 Use  
MinimumSTCutAlgorithm instead | 
| org.jgrapht.generate.RandomGraphGenerator | 
| org.jgrapht.graph.SimpleGraphPath
 This class is ambiguous. Unlike the name or the description suggests, this class does
             NOT implement a Simple Path (a path in a graph without vertex repetition). Instead it
             implements a walk in a SimpleGraph. This functionality is now implemented by the
             class  
GraphWalk. | 
| org.jgrapht.alg.StrongConnectivityInspector
 Use  
KosarajuStrongConnectivityInspector instead. | 
| org.jgrapht.alg.VertexCovers | 
| Field and Description | 
|---|
| org.jgrapht.ext.GmlExporter.PRINT_EDGE_LABELS | 
| org.jgrapht.ext.GmlExporter.PRINT_EDGE_VERTEX_LABELS | 
| org.jgrapht.ext.GmlExporter.PRINT_NO_LABELS | 
| org.jgrapht.ext.GmlExporter.PRINT_VERTEX_LABELS | 
| org.jgrapht.ext.GmlParser.tokenNames
 Use  
GmlParser.VOCABULARY instead. | 
| org.jgrapht.ext.GmlLexer.tokenNames
 Use  
GmlLexer.VOCABULARY instead. | 
| org.jgrapht.ext.CSVParser.tokenNames
 Use  
CSVParser.VOCABULARY instead. | 
| org.jgrapht.ext.CSVLexer.tokenNames
 Use  
CSVLexer.VOCABULARY instead. | 
| Constructor and Description | 
|---|
| org.jgrapht.alg.EdmondsBlossomShrinking() | 
| org.jgrapht.event.GraphEdgeChangeEvent(Object, int, E)
 Use new constructor which takes vertex parameters. 
 | 
| org.jgrapht.util.ModifiableInteger()
 not really deprecated, just marked so to avoid mistaken use. 
 | 
| org.jgrapht.alg.util.VertexDegreeComparator(UndirectedGraph<V, E>, boolean) | 
Copyright © 2016. All rights reserved.