The most general implementation of the
Graph
interface.
Construct a new pseudograph.
A skeletal implementation of the Graph interface, to minimize the
effort required to implement graph interfaces.
Construct a new empty graph object.
An empty implementation of a graph iterator to minimize the effort required
to implement graph iterators.
Adds all of the specified edges to this graph.
Adds all of the specified vertices to this graph.
Creates a new edge in this graph, going from the source vertex to the
target vertex, and returns the created edge.
Adds the specified edge to this graph.
Adds the specified edge to this subgraph.
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
Graph.addEdge(Object,Object)
method.
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
Graph.addEdge(Object,Object)
method.
Adds the specified edge to the specified graph including its vertices.
Adds all the vertices and all the edges of the specified source graph to
the specified destination graph.
Adds the specified graph listener to this graph, if not already present.
Adds all the vertices and all the edges of the specified source digraph
to the specified destination digraph, reversing all of the edges.
Adds the specified traversal listener to this iterator.
Adds the specified traversal listener to this iterator.
Adds the specified vertex to this graph if not already present.
Adds the specified vertex to this subgraph.
Adds the specified vertex set listener to this graph, if not already
present.
Ensures that the specified vertex exists in this graph, or else throws
exception.
An undirected view of the backing directed graph specified in the
constructor.
Constructor for AsUndirectedGraph.
Performs a cascading cut operation.
Creates the JGraph cells that reflect the respective JGraphT elements.
Removes all elements from this heap.
Returns a shallow copy of this graph instance.
Creates and returns a shallow copy of this edge.
A closest-first iterator for a directed or undirected graph.
Creates a new closest-first iterator for the specified graph.
Creates a new closest-first iterator for the specified graph.
Creates a new radius-bounded closest-first iterator for the specified
graph.
Compare the degrees of v1
and v2
, taking into
account whether ascending or descending order is used.
Compares this ModifiableInteger
object to another object.
Compares two ModifiableInteger
objects numerically.
Connected component traversal finished event.
Connected component traversal started event.
Called to inform listeners that the traversal of the current connected
component has finished.
Called to inform listeners that a traversal of a new connected component
has started.
A traversal event with respect to a connected component.
Creates a new ConnectedComponentTraversalEvent.
Returns a set of all vertices that are in the maximally connected
component together with the specified vertex.
Returns a list of Set
s, where each set contains all
vertices that are in the same maximally connected component.
Allows obtaining various connectivity aspects of a graph.
Creates a connectivity inspector for the specified directed graph.
Creates a connectivity inspector for the specified undirected graph.
Consolidates the trees in the heap by joining trees of equal degree
until there are no more trees of equal degree in the root list.
Returns true if and only if this graph contains an edge going
from the source vertex to the target vertex.
Returns true if this graph contains the specified edge.
Returns true if this edge contains the specified vertex.
Returns true if this graph contains the specified vertex.
Creates and returns a map of attributes to be used as defaults for edge
attributes, depending on the specified graph.
Creates and returns a map of attributes to be used as defaults for
vertex attributes.
Creates a new edge whose endpoints are the specified source and target
vertices.
Creates an edge cell that contains its respective JGraphT edge.
Create a new edge list for a particular vertex.
Creates a vertex cell that contains its respective JGraphT vertex.
Provides a cross-connected-component traversal functionality for iterator
subclasses.
Creates a new iterator for the specified graph.
The reverse of the link operation: removes x from the child list of y.
Performs cycle detection on a graph.
Creates a cycle detector for the specified graph.
Decreases the key value for a heap node, given the new value to take on.
The default weight for an edge.
A simple default cell factory.
Creates a new directed graph.
Creates a new directed graph with the specified edge factory.
A directed weighted graph.
Creates a new directed weighted graph.
Creates a new directed weighted graph with the specified edge factory.
A skeletal implementation of the Edge interface, to minimize the
effort required to implement the interface.
Constructor for DefaultEdge.
A graph backed by the the graph specified at the constructor, which can be
listened by GraphListener
s and by
VertexSetListener
s.
Creates a new listenable graph.
Creates a new listenable graph.
Returns the degree of the specified vertex.
Deletes a node from the heap given the reference to the node.
A depth-first iterator for a directed and an undirected graph.
Creates a new depth-first iterator for the specified graph.
Creates a new depth-first iterator for the specified graph.
Performs yes/no cycle detection on the entire graph.
Performs yes/no cycle detection on an individual vertex.
Creates and executes a new DijkstraShortestPath algorithm instance.
A implementation of directed edge.
An EdgeFactory for producing directed edges.
A graph whose all edges are directed.
Creates a new directed multigraph.
Creates a new directed multigraph with the specified edge factory.
A directed graph that is a subgraph on other graph.
Creates a new directed subgraph.
An implementation of directed weighted edge.
Constructor for DirectedWeightedEdge.
An EdgeFactory for producing directed edges with weights.
A directed weighted multigraph.
Creates a new directed weighted multigraph.
Creates a new directed weighted multigraph with the specified edge
factory.
A directed weighted graph that is a subgraph on other graph.
Creates a new weighted directed subgraph.
An edge used with graph objects.
Notifies that an edge has been added to the graph.
This utility class is a container of various
EdgeFactory
classes.
An edge factory used by graphs for creating new edges.
A factory for edge lists.
Notifies that an edge has been removed from the graph.
Returns a set of the edges contained in this graph.
Returns a list of all edges touching the specified vertex.
A traversal event for a graph edge.
Creates a new EdgeTraversalEvent.
Called to inform the listener that the specified edge have been visited
during the graph traversal.
Applies the specified attributes to the model, as in the DefaultGraphModel.edit(java.util.Map, org.jgraph.graph.ConnectionSet,
org.jgraph.graph.ParentMap, javax.swing.undo.UndoableEdit[])
method.
Construct a new EmptyGraphGenerator.
Update data structures the first time we see a vertex.
Called whenever we re-encounter a vertex.
Role for the last vertex generated.
Compares this object to the specified object.
Exports the specified graph into a Visio csv file format.
This class implements a Fibonacci heap data structure.
Constructs a FibonacciHeap object that contains no elements.
Finds a 2-approximation for a minimal vertex cover of the specified
graph.
Finds the vertex set for the subgraph of all cycles.
Finds the vertex set for the subgraph of all cycles which contain a
particular vertex.
Finds a greedy approximation for a minimal vertex cover of a specified
graph.
Convenience method to find the shortest path via a single static method
call.
Informs all listeners that the traversal of the current connected
component finished.
Informs all listeners that a traversal of a new connected component has
started.
Notify listeners that the specified edge was added.
Notify listeners that the specified edge was removed.
Informs all listeners that a the specified edge was visited.
Notify listeners that the specified vertex was added.
Notify listeners that the specified vertex was removed.
Informs all listeners that a the specified vertex was visited.
Generate a graph structure.
Returns a list of all edges connecting source vertex to target vertex if
such vertices exist in this graph.
Returns the cell factory used to create the JGraph cells.
Returns the default edge attributes used for creating new JGraph edges.
Returns the default vertex attributes used for creating new JGraph
vertices.
Returns the traversed edge.
Returns the edge that this event is related to.
Returns an edge connecting source vertex to target vertex if such
vertices and such edge exist in this graph.
Returns the JGraph edge cell that corresponds to the specified JGraphT
edge.
Returns the edge factory using which this graph creates new edges.
Returns the graph inspected by the StrongConnectivityInspector.
Obtain the key for this node.
Returns the element's label, or null
if element has no
label.
Return the edges making up the path found.
Return the length of the path found.
Access the data stored for a seen vertex.
Get the length of the shortest path known to the given vertex.
Returns the source vertex of this edge.
Get the spanning tree edge reaching a vertex which has been seen already
in this traversal.
Returns the target vertex of this edge.
Returns the value of this object, similarly to
intValue()
.
Returns the vertex that this event is related to.
Returns the traversed vertex.
Returns the JGraph vertex cell that corresponds to the specified JGraphT
vertex.
Returns the shape name for the vertex as to be appeared in the Visio
diagram.
Returns the JGraph port cell that corresponds to the specified JGraphT
vertex.
Returns the weight of this edge.
The root interface in the graph hierarchy.
An event which indicates that a graph has changed.
Creates a new graph change event.
A graph backed by the the graph specified at the constructor, which
delegates all its methods to the backing graph.
Constructor for GraphDelegator.
An event which indicates that a graph edge has changed, or is about to
change.
Constructor for GraphEdgeChangeEvent.
GraphGenerator defines an interface for generating new graph structures.
A collection of utilities to assist the working with graphs.
A listener that is notified when the graph changes.
An event which indicates that a graph vertex has changed, or is about to
change.
Creates a new GraphVertexChangeEvent object.
Returns a list of all edges incoming into the specified vertex.
Returns the "in degree" of the specified vertex.
Inserts a new data element into the heap.
Returns true
if and only if self-loops are allowed in this
graph.
Returns true
if and only if multiple edges are allowed in
this graph.
Returns true if there are no more uniterated vertices in the
currently iterated connected component; false otherwise.
Test whether this iterator is set to traverse the graph across connected
components.
Test whether this iterator is set to traverse the grpah across connected
components.
Tests if the Fibonacci heap is empty or not.
Test if the inspected graph is connected.
Tests whether the reuseEvents
flag is set.
Tests whether the reuseEvents
flag is set.
Determines whether a vertex has been seen yet by this traversal.
Returns true if the graph of this
StronglyConnectivityInspector
instance is strongly
connected.
Returns the value of the verifyIntegrity flag.
An graph element (vertex or edge) that can have a label.
Generates a linear graph of any size.
Construct a new LinearGraphGenerator.
Make node y a child of node x.
Creates a new listenable directed graph.
Creates a new listenable directed graph.
Creates a new listenable directed weighted graph.
Creates a new listenable directed weighted graph.
A graph that supports listeners on structural change events.
Creates a new listenable undirected simple graph.
Creates a new listenable undirected graph.
Creates a new listenable undirected weighted graph.
Creates a new listenable undirected weighted graph.
The edge that this event is related to.
The type of graph change this event indicates.
The vertex that this event is related to.
The starting point for the demo.
An alternative starting point for this demo, to also allow running this
applet as an application.
The starting point for the demo.
Returns the smallest element in the heap.
The ModifiableInteger
class wraps a value of the primitive type
int
in an object, similarly to java.lang.Integer
.
!!! DON'T USE - Use the ModifiableInteger(int)
constructor
instead !!!
This constructor is for the use of java.beans.XMLDecoder
deserialization.
Constructs a newly allocated ModifiableInteger
object that
represents the specified int
value.
Creates a new multigraph.
Creates a new multigraph with the specified edge factory.
Returns the vertex opposite to the specified vertex.
Algorithms provided with JGraphT.
Utilities used by JGraphT algorithms.
Demo programs that help to get started with JGraphT.
Implementations of various edge interfaces.
Event classes and listener interfaces, used to provide a change
notification mechanism on graph modification events.
Extensions and integration means to other products.
Generators for graphs of various topologies.
Implementations of various graphs.
Non-graph-specific data structures, algorithms, and utilities used by
JGraphT.
Returns the "out degree" of the specified vertex.
Returns a list of all edges outgoing from the specified vertex.
Removes all the edges in this graph that are also contained in the
specified edge collection.
Removes all the edges going from the specified source vertex to the
specified target vertex, and returns a list of all removed edges.
Removes all the edges in this graph that are also contained in the
specified edge array.
Removes all the vertices in this graph that are also contained in the
specified vertex collection.
Removes an edge going from source vertex to target vertex, if such
vertices and such edge exist in this graph.
Removes the specified edge from the graph.
Removes the specified graph listener from this graph, if present.
Removes the smallest element from the heap.
Removes the specified traversal listener from this iterator.
Removes the specified traversal listener from this iterator.
Removes the specified vertex from this graph including all its touching
edges if present.
Removes the specified vertex set listener from this graph, if present.
Generates a ring graph of any size.
Construct a new RingGraphGenerator.
Sets the cross component traversal flag - indicates whether to traverse
the graph across connected components.
Sets the cross component traversal flag - indicates whether to traverse
the graph across connected components.
Sets the default edge attributes used for creating new JGraph edges.
Sets the default vertex attributes used for creating new JGraph
vertices.
Sets the specified label object to this element.
If the reuseEvents
flag is set to true
this
class will reuse previously fired events and will not create a new
object for each event.
Sets a value the reuseEvents
flag.
Sets a new value for this modifiable integer.
Sets the the check integrity flag.
Sets the weight of this edge.
Creates a new simple directed graph.
Creates a new simple directed graph with the specified edge factory.
A simple directed weighted graph.
Creates a new simple directed weighted graph.
Creates a new simple directed weighted graph with the specified edge
factory.
Creates a new simple graph.
Creates a new simple graph with the specified edge factory.
Creates a new simple weighted graph.
Creates a new simple weighted graph with the specified edge factory.
Returns the size of the heap which is measured in the number of elements
contained in the heap.
Role for the first vertex generated.
Complements the
ConnectivityInspector
class
with the capability to compute the strongly connected components of a
directed graph.
The constructor of the StrongConnectivityInspector class.
Computes a List
of Set
s, where each set contains
vertices which together form a strongly connected component within the
given graph.
A subgraph is a graph that has a subset of vertices and a subset of edges
with respect to some base graph.
Creates a new induced Subgraph.
Returns a list of vertices that are the successors of a specified
vertex.
Returns an Integer
object representing this
ModifiableInteger
's value.
Implements topological order traversal for a directed graph.
Creates a new topological order iterator over the directed graph
specified.
Returns a string of the parenthesized pair (V, E) representing this
G=(V,E) graph.
Returns a string representation of this directed edge.
Creates a String representation of this Fibonacci heap.
Return the string representation of this object.
Returns a String
object representing this
ModifiableInteger
's value.
Returns a string representation of this undirected edge.
Helper for subclass implementations of toString( ).
A listener on graph iterator or on a graph traverser.
An empty do-nothing implementation of the
TraversalListener
interface used for subclasses.
A implementation for an undirected edge.
An EdgeFactory for producing undirected edges.
A graph whose all edges are undirected.
Returns an undirected view of the specified graph.
An undirected graph that is a subgraph on other graph.
Creates a new undirected subgraph.
An implementation of undirected weighted edge.
Constructor for UndirectedWeightedEdge.
An EdgeFactory for producing undirected edges with weights.
An undirected weighted graph that is a subgraph on other graph.
Creates a new undirected weighted subgraph.
Joins two Fibonacci heaps into a new one.
A directed graph that cannot be modified.
Creates a new unmodifiable directed graph based on the specified backing
graph.
An unmodifiable view of the backing graph specified in the constructor.
Creates a new unmodifiable graph based on the specified backing graph.
An undirected graph that cannot be modified.
Creates a new unmodifiable undirected graph based on the specified
backing graph.
The int value represented by this ModifiableInteger
.
Notifies that a vertex has been added to the graph.
Algorithms to find a vertex cover for a graph.
Compares two vertices based on their degree.
Creates a comparator for comparing the degrees of vertices in the
specified graph.
Creates a comparator for comparing the degrees of vertices in the
specified graph.
A vertex factory used by graph algorithms for creating new vertices.
Assigns a display name for each of the graph vertices.
Notifies that a vertex has been removed from the graph.
Returns a set of the vertices contained in this graph.
A listener that is notified when the graph's vertex set changes.
A traversal event for a graph vertex.
Creates a new VertexTraversalEvent.
Called to inform the listener that the specified vertex have been
visited during the graph traversal.
Exports a graph to a csv format that can be imported into MS Visio.
Creates a new VisioExporter object.
Creates a new VisioExporter object with the specified naming policy.