Uses of Interface
org.jgrapht.Graph

Packages that use Graph
org.jgrapht The front-end API's interfaces and classes, including Graph, DirectedGraph and UndirectedGraph
org.jgrapht.alg Algorithms provided with JGraphT
org.jgrapht.experimental A package that contains experimental work or work-in-progress that is not yet ready to be included in a release. 
org.jgrapht.experimental.alg   
org.jgrapht.experimental.alg.color   
org.jgrapht.experimental.dag   
org.jgrapht.experimental.isomorphism Algorithms which provide isomorphism check between two graphs. 
org.jgrapht.ext Extensions and integration means to other products. 
org.jgrapht.generate Generators for graphs of various topologies. 
org.jgrapht.graph Implementations of various graphs. 
org.jgrapht.traverse Graph traversal means. 
 

Uses of Graph in org.jgrapht
 

Subinterfaces of Graph in org.jgrapht
 interface DirectedGraph<V,E>
          A graph whose all edges are directed.
 interface ListenableGraph<V,E>
          A graph that supports listeners on structural change events.
 interface UndirectedGraph<V,E>
          A graph whose all edges are undirected.
 interface WeightedGraph<V,E>
          An interface for a graph whose edges have non-uniform weights.
 

Methods in org.jgrapht that return Graph
 Graph<V,E> GraphPath.getGraph()
          Returns the graph over which this path is defined.
 

Methods in org.jgrapht with parameters of type Graph
static
<V,E> boolean
Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E> source, Collection<? extends E> edges)
          Adds a subset of the edges of the specified source graph to the specified destination graph.
static
<V,E> boolean
Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E> source, Collection<? extends E> edges)
          Adds a subset of the edges of the specified source graph to the specified destination graph.
static
<V,E> boolean
Graphs.addAllVertices(Graph<? super V,? super E> destination, Collection<? extends V> vertices)
          Adds all of the specified vertices to the destination graph.
static
<V,E> E
Graphs.addEdge(Graph<V,E> g, V sourceVertex, V targetVertex, double weight)
          Creates a new edge and adds it to the specified graph similarly to the addEdge(Object, Object) method.
static
<V,E> boolean
Graphs.addEdgeWithVertices(Graph<V,E> targetGraph, Graph<V,E> sourceGraph, E edge)
          Adds the specified edge to the graph, including its vertices if not already included.
static
<V,E> boolean
Graphs.addEdgeWithVertices(Graph<V,E> targetGraph, Graph<V,E> sourceGraph, E edge)
          Adds the specified edge to the graph, including its vertices if not already included.
static
<V,E> E
Graphs.addEdgeWithVertices(Graph<V,E> g, V sourceVertex, V targetVertex)
          Adds the specified source and target vertices to the graph, if not already included, and creates a new edge and adds it to the specified graph similarly to the addEdge(Object, Object) method.
static
<V,E> E
Graphs.addEdgeWithVertices(Graph<V,E> g, V sourceVertex, V targetVertex, double weight)
          Adds the specified source and target vertices to the graph, if not already included, and creates a new weighted edge and adds it to the specified graph similarly to the addEdge(Object, Object) method.
static
<V,E> boolean
Graphs.addGraph(Graph<? super V,? super E> destination, Graph<V,E> source)
          Adds all the vertices and all the edges of the specified source graph to the specified destination graph.
static
<V,E> boolean
Graphs.addGraph(Graph<? super V,? super E> destination, Graph<V,E> source)
          Adds all the vertices and all the edges of the specified source graph to the specified destination graph.
static
<V,E> V
Graphs.getOppositeVertex(Graph<V,E> g, E e, V v)
          Gets the vertex opposite another vertex across an edge.
static
<V,E> List<V>
Graphs.neighborListOf(Graph<V,E> g, V vertex)
          Returns a list of vertices that are the neighbors of a specified vertex.
static
<V,E> boolean
Graphs.testIncidence(Graph<V,E> g, E e, V v)
          Tests whether an edge is incident to a vertex.
static
<V,E> UndirectedGraph<V,E>
Graphs.undirectedGraph(Graph<V,E> g)
          Returns an undirected view of the specified graph.
 

Uses of Graph in org.jgrapht.alg
 

Classes in org.jgrapht.alg that implement Graph
 class BlockCutpointGraph<V,E>
          Definition of a block of a graph in MathWorld.

Definition and lemma taken from the article Structure-Based Resilience Metrics for Service-Oriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph.
 

Fields in org.jgrapht.alg declared as Graph
protected  Graph<V,E> BellmanFordShortestPath.graph
          Graph on which shortest paths are searched.
 

Methods in org.jgrapht.alg that return Graph
 Graph<V,E> FloydWarshallShortestPaths.getGraph()
           
 

Methods in org.jgrapht.alg with parameters of type Graph
static
<V,E> Set<V>
VertexCovers.find2ApproximationCover(Graph<V,E> g)
          Finds a 2-approximation for a minimal vertex cover of the specified graph.
static
<V,E> List<E>
BellmanFordShortestPath.findPathBetween(Graph<V,E> graph, V startVertex, V endVertex)
          Convenience method to find the shortest path via a single static method call.
static
<V,E> List<E>
DijkstraShortestPath.findPathBetween(Graph<V,E> graph, V startVertex, V endVertex)
          Convenience method to find the shortest path via a single static method call.
 

Constructors in org.jgrapht.alg with parameters of type Graph
BellmanFordShortestPath(Graph<V,E> graph, V startVertex)
          Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V,E> graph, V startVertex, int nMaxHops)
          Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V,E> graph, V startVertex, int nMaxHops, double epsilon)
          Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BronKerboschCliqueFinder(Graph<V,E> graph)
          Creates a new clique finder.
DijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex)
          Creates and executes a new DijkstraShortestPath algorithm instance.
DijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex, double radius)
          Creates and executes a new DijkstraShortestPath algorithm instance.
FloydWarshallShortestPaths(Graph<V,E> graph)
           
KruskalMinimumSpanningTree(Graph<V,E> graph)
          Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
KShortestPaths(Graph<V,E> graph, V startVertex, int k)
          Creates an object to compute ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V,E> graph, V startVertex, int nPaths, int nMaxHops)
          Creates an object to calculate ranking shortest paths between the start vertex and others vertices.
NeighborIndex(Graph<V,E> g)
          Creates a neighbor index for the specified undirected graph.
PrimMinimumSpanningTree(Graph<V,E> g)
           
 

Uses of Graph in org.jgrapht.experimental
 

Classes in org.jgrapht.experimental that implement Graph
 class GraphSquare<V,E>
          DOCUMENT ME!
 

Methods in org.jgrapht.experimental with parameters of type Graph
static void RandomGraphHelper.addEdges(Graph target, List sourceVertices, List destVertices, int numEdges)
           
static Object[] RandomGraphHelper.addVertices(Graph target, VertexFactory vertexFactory, int numVertices)
          .
 void PartiteRandomGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,Object[]> resultMap)
          TODO hb 30-nov-05: document me
 void GraphReader.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void UniformRandomGraphGenerator.generateGraph(Graph target, VertexFactory vertexFactory, Map resultMap)
           
static
<V,E> boolean
GraphTests.isBipartite(Graph<V,E> g)
           
static
<V,E> boolean
GraphTests.isComplete(Graph<V,E> g)
           
static
<V,E> boolean
GraphTests.isConnected(Graph<V,E> g)
           
static
<V,E> boolean
GraphTests.isEmpty(Graph<V,E> g)
           
static
<V,E> boolean
GraphTests.isTree(Graph<V,E> g)
           
 

Constructors in org.jgrapht.experimental with parameters of type Graph
GraphSquare(Graph<V,E> g, boolean createLoops)
          Constructor for GraphSquare.
 

Uses of Graph in org.jgrapht.experimental.alg
 

Constructors in org.jgrapht.experimental.alg with parameters of type Graph
IntArrayGraphAlgorithm(Graph<V,E> g)
           
 

Uses of Graph in org.jgrapht.experimental.alg.color
 

Constructors in org.jgrapht.experimental.alg.color with parameters of type Graph
BrownBacktrackColoring(Graph<V,E> g)
           
GreedyColoring(Graph<V,E> g)
           
GreedyColoring(Graph<V,E> g, int method)
           
 

Uses of Graph in org.jgrapht.experimental.dag
 

Classes in org.jgrapht.experimental.dag that implement Graph
 class DirectedAcyclicGraph<V,E>
          DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast topological order iteration.
 

Uses of Graph in org.jgrapht.experimental.isomorphism
 

Methods in org.jgrapht.experimental.isomorphism with parameters of type Graph
protected static void AdaptiveIsomorphismInspectorFactory.assertUnsupportedGraphTypes(Graph g)
          Checks if one of the graphs is from unsupported graph type and throws IllegalArgumentException if it is.
protected static int AdaptiveIsomorphismInspectorFactory.checkGraphsType(Graph graph1, Graph graph2)
           
protected static int AdaptiveIsomorphismInspectorFactory.checkGraphsType(Graph graph1, Graph graph2)
           
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)
          Creates a new inspector, letting this class determine what is the most efficient algorithm and using default equivalence comparators.
static
<V,E> GraphIsomorphismInspector
AdaptiveIsomorphismInspectorFactory.createIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2)
          Creates a new inspector, letting this class determine what is the most efficient algorithm and using default equivalence comparators.
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)
          Creates a new inspector for a particular graph type (planar / tree / other) using default equivalence comparators.
static
<V,E> GraphIsomorphismInspector
AdaptiveIsomorphismInspectorFactory.createIsomorphismInspectorByType(int type, Graph<V,E> graph1, Graph<V,E> graph2)
          Creates a new inspector for a particular graph type (planar / tree / other) using default equivalence comparators.
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)
           
 boolean VertexDegreeEquivalenceComparator.equivalenceCompare(V vertex1, V vertex2, Graph<V,E> context1, Graph<V,E> context2)
          Compares the in degrees and the out degrees of the two vertexes.
 boolean VertexDegreeEquivalenceComparator.equivalenceCompare(V vertex1, V vertex2, Graph<V,E> context1, Graph<V,E> context2)
          Compares the in degrees and the out degrees of the two vertexes.
 int VertexDegreeEquivalenceComparator.equivalenceHashcode(V vertex, Graph<V,E> context)
          Hashes using the in & out degree of a vertex
protected  VertexDegreeEquivalenceComparator.InOutDegrees VertexDegreeEquivalenceComparator.getInOutDegrees(Graph<V,E> aContextGraph, V vertex)
          Calculates the In and Out degrees of vertexes.
 

Method parameters in org.jgrapht.experimental.isomorphism with type arguments of type Graph
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)
           
 

Constructors in org.jgrapht.experimental.isomorphism with parameters of type Graph
GraphOrdering(Graph<V,E> regularGraph)
          Creates a new labels graph according to the regular graph.
GraphOrdering(Graph<V,E> regularGraph, Set<V> vertexSet, Set<E> edgeSet)
          Creates a new labels graph according to the regular graph.
IsomorphismRelation(List<V> aGraph1vertexArray, List<V> aGraph2vertexArray, Graph<V,E> g1, Graph<V,E> g2)
           
IsomorphismRelation(List<V> aGraph1vertexArray, List<V> aGraph2vertexArray, Graph<V,E> g1, Graph<V,E> g2)
           
 

Uses of Graph in org.jgrapht.ext
 

Methods in org.jgrapht.ext with parameters of type Graph
static
<V,E> org.jgraph.graph.AttributeMap
JGraphModelAdapter.createDefaultEdgeAttributes(Graph<V,E> jGraphTGraph)
          Creates and returns a map of attributes to be used as defaults for edge attributes, depending on the specified graph.
 void VisioExporter.export(OutputStream output, Graph<V,E> g)
          Exports the specified graph into a Visio csv file format.
 void GraphMLExporter.export(Writer writer, Graph<V,E> g)
          Exports a graph into a plain text file in GraphML format.
 void DOTExporter.export(Writer writer, Graph<V,E> g)
          Exports a graph into a plain text file in DOT format.
 

Constructors in org.jgrapht.ext with parameters of type Graph
JGraphModelAdapter(Graph<V,E> jGraphTGraph)
          Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter(Graph<V,E> jGraphTGraph, org.jgraph.graph.AttributeMap defaultVertexAttributes, org.jgraph.graph.AttributeMap defaultEdgeAttributes)
          Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter(Graph<V,E> jGraphTGraph, org.jgraph.graph.AttributeMap defaultVertexAttributes, org.jgraph.graph.AttributeMap defaultEdgeAttributes, JGraphModelAdapter.CellFactory<V,E> cellFactory)
          Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphXAdapter(Graph<V,E> graph)
          Constructs and draws a new mxGraph from a jGraphT graph.
 

Uses of Graph in org.jgrapht.generate
 

Methods in org.jgrapht.generate with parameters of type Graph
 void RandomGraphGenerator.EdgeTopologyFactory.createEdges(Graph<VV,EE> targetGraph, Map<Integer,VV> orderToVertexMap, int numberOfEdges, Random randomizer)
          Two different calls to the createEdges() with the same parameters must result in the generation of the same.
 void RandomGraphGenerator.DefaultEdgeTopologyFactory.createEdges(Graph<VV,EE> targetGraph, Map<Integer,VV> orderToVertexMap, int numberOfEdges, Random randomizer)
           
 void GraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,T> resultMap)
          Generate a graph structure.
 void WeightedGraphGeneratorAdapter.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,T> resultMap)
           
 void GridGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void WheelGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void CompleteBipartiteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Construct a complete bipartite graph
 void HyperCubeGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          This will generate the hypercube graph
 void RingGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void LinearGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void StarGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generates a star graph with the designated order from the constructor
 void CompleteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void RandomGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          (non-Javadoc)
 void EmptyGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generate a graph structure.
 void ScaleFreeGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
          Generates scale-free network with size passed to the constructor.
 int RandomGraphGenerator.DefaultEdgeTopologyFactory.getMaxEdgesForVertexNum(Graph<VV,EE> targetGraph)
          Return max edges for that graph.
 boolean RandomGraphGenerator.EdgeTopologyFactory.isNumberOfEdgesValid(Graph<VV,EE> targetGraph, int numberOfEdges)
          Checks if the graph can contain the givven numberOfEdges according to the graph type restrictions.
 boolean RandomGraphGenerator.DefaultEdgeTopologyFactory.isNumberOfEdgesValid(Graph<VV,EE> targetGraph, int numberOfEdges)
          checks if the numOfEdges is smaller than the Max edges according to the following table:
 

Uses of Graph in org.jgrapht.graph
 

Classes in org.jgrapht.graph with type parameters of type Graph
 class GraphUnion<V,E,G extends Graph<V,E>>
          Read-only union of two graphs: G1 and G2.
 class Subgraph<V,E,G extends Graph<V,E>>
          A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.
 

Classes in org.jgrapht.graph that implement Graph
 class AbstractBaseGraph<V,E>
          The most general implementation of the Graph interface.
 class AbstractGraph<V,E>
          A skeletal implementation of the Graph interface, to minimize the effort required to implement graph interfaces.
 class AsUndirectedGraph<V,E>
          An undirected view of the backing directed graph specified in the constructor.
 class AsUnweightedDirectedGraph<V,E>
          An unweighted view of the backing weighted graph specified in the constructor.
 class AsUnweightedGraph<V,E>
          An unweighted view of the backing weighted graph specified in the constructor.
 class AsWeightedGraph<V,E>
          A weighted view of the backing graph specified in the constructor.
 class DefaultDirectedGraph<V,E>
          A directed graph.
 class DefaultDirectedWeightedGraph<V,E>
          A directed weighted graph.
 class DefaultListenableGraph<V,E>
          A graph backed by the the graph specified at the constructor, which can be listened by GraphListener s and by VertexSetListener s.
 class DirectedGraphUnion<V,E>
           
 class DirectedMaskSubgraph<V,E>
          A directed graph that is a MaskSubgraph on another graph.
 class DirectedMultigraph<V,E>
          A directed multigraph.
 class DirectedPseudograph<V,E>
          A directed pseudograph.
 class DirectedSubgraph<V,E>
          A directed graph that is a subgraph on other graph.
 class DirectedWeightedMultigraph<V,E>
          A directed weighted multigraph.
 class DirectedWeightedPseudograph<V,E>
          A directed weighted pseudograph.
 class DirectedWeightedSubgraph<V,E>
          A directed weighted graph that is a subgraph on other graph.
 class EdgeReversedGraph<V,E>
          Provides an edge-reversed view g' of a directed graph g.
 class GraphDelegator<V,E>
          A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph.
 class GraphUnion<V,E,G extends Graph<V,E>>
          Read-only union of two graphs: G1 and G2.
 class ListenableDirectedGraph<V,E>
          A directed graph which is also ListenableGraph.
 class ListenableDirectedWeightedGraph<V,E>
          A directed weighted graph which is also ListenableGraph.
 class ListenableUndirectedGraph<V,E>
          An undirected graph which is also ListenableGraph.
 class ListenableUndirectedWeightedGraph<V,E>
          An undirected weighted graph which is also ListenableGraph.
 class MaskSubgraph<V,E>
          An unmodifiable subgraph induced by a vertex/edge masking function.
 class Multigraph<V,E>
          A multigraph.
 class ParanoidGraph<V,E>
          ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.
 class Pseudograph<V,E>
          A pseudograph.
 class SimpleDirectedGraph<V,E>
          A simple directed graph.
 class SimpleDirectedWeightedGraph<V,E>
          A simple directed weighted graph.
 class SimpleGraph<V,E>
          A simple graph.
 class SimpleWeightedGraph<V,E>
          A simple weighted graph.
 class Subgraph<V,E,G extends Graph<V,E>>
          A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.
 class UndirectedGraphUnion<V,E>
           
 class UndirectedMaskSubgraph<V,E>
          An undirected graph that is a MaskSubgraph on another graph.
 class UndirectedSubgraph<V,E>
          An undirected graph that is a subgraph on other graph.
 class UndirectedWeightedSubgraph<V,E>
          An undirected weighted graph that is a subgraph on other graph.
 class UnmodifiableDirectedGraph<V,E>
          A directed graph that cannot be modified.
 class UnmodifiableGraph<V,E>
          An unmodifiable view of the backing graph specified in the constructor.
 class UnmodifiableUndirectedGraph<V,E>
          An undirected graph that cannot be modified.
 class WeightedMultigraph<V,E>
          A weighted multigraph.
 class WeightedPseudograph<V,E>
          A weighted pseudograph.
 

Methods in org.jgrapht.graph that return Graph
 Graph<V,E> GraphPathImpl.getGraph()
           
 

Constructors in org.jgrapht.graph with parameters of type Graph
AsUnweightedGraph(Graph<V,E> g)
          Constructor for AsUnweightedGraph.
AsWeightedGraph(Graph<V,E> g, Map<E,Double> weightMap)
          Constructor for AsWeightedGraph.
DefaultGraphMapping(Map<V,V> g1ToG2, Map<V,V> g2ToG1, Graph<V,E> g1, Graph<V,E> g2)
          The maps themselves are used.
DefaultGraphMapping(Map<V,V> g1ToG2, Map<V,V> g2ToG1, Graph<V,E> g1, Graph<V,E> g2)
          The maps themselves are used.
DefaultListenableGraph(Graph<V,E> g)
          Creates a new listenable graph.
DefaultListenableGraph(Graph<V,E> g, boolean reuseEvents)
          Creates a new listenable graph.
GraphDelegator(Graph<V,E> g)
          Constructor for GraphDelegator.
GraphPathImpl(Graph<V,E> graph, V startVertex, V endVertex, List<E> edgeList, double weight)
           
MaskSubgraph(Graph<V,E> base, MaskFunctor<V,E> mask)
          Creates a new induced subgraph.
ParanoidGraph(Graph<V,E> g)
           
UnmodifiableGraph(Graph<V,E> g)
          Creates a new unmodifiable graph based on the specified backing graph.
 

Uses of Graph in org.jgrapht.traverse
 

Methods in org.jgrapht.traverse that return Graph
 Graph<V,E> CrossComponentIterator.getGraph()
           
 

Constructors in org.jgrapht.traverse with parameters of type Graph
BreadthFirstIterator(Graph<V,E> g)
          Creates a new breadth-first iterator for the specified graph.
BreadthFirstIterator(Graph<V,E> g, V startVertex)
          Creates a new breadth-first iterator for the specified graph.
ClosestFirstIterator(Graph<V,E> g)
          Creates a new closest-first iterator for the specified graph.
ClosestFirstIterator(Graph<V,E> g, V startVertex)
          Creates a new closest-first iterator for the specified graph.
ClosestFirstIterator(Graph<V,E> g, V startVertex, double radius)
          Creates a new radius-bounded closest-first iterator for the specified graph.
CrossComponentIterator(Graph<V,E> g, V startVertex)
          Creates a new iterator for the specified graph.
DepthFirstIterator(Graph<V,E> g)
          Creates a new depth-first iterator for the specified graph.
DepthFirstIterator(Graph<V,E> g, V startVertex)
          Creates a new depth-first iterator for the specified graph.
 



Copyright © 2013. All rights reserved.