| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final double |
+DEFAULT_EDGE_WEIGHT |
+1.0 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final double |
+DEFAULT_EPSILON |
+1.0E-9 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final double |
+DEFAULT_EPSILON |
+1.0E-9 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final int |
+CONNECTED_COMPONENT_FINISHED |
+32 |
+
+
+public static final int |
+CONNECTED_COMPONENT_STARTED |
+31 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final int |
+BEFORE_EDGE_ADDED |
+21 |
+
+
+public static final int |
+BEFORE_EDGE_REMOVED |
+22 |
+
+
+public static final int |
+EDGE_ADDED |
+23 |
+
+
+public static final int |
+EDGE_REMOVED |
+24 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final int |
+BEFORE_VERTEX_ADDED |
+11 |
+
+
+public static final int |
+BEFORE_VERTEX_REMOVED |
+12 |
+
+
+public static final int |
+VERTEX_ADDED |
+13 |
+
+
+public static final int |
+VERTEX_REMOVED |
+14 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final int |
+BEST_ORDER |
+0 |
+
+
+public static final int |
+LARGEST_SATURATION_FIRST_ORDER |
+3 |
+
+
+public static final int |
+NATURAL_ORDER |
+1 |
+
+
+public static final int |
+SMALLEST_DEGREE_LAST_ORDER |
+2 |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final String |
+CORNER_VERTEX |
+"Corner Vertex" |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final String |
+END_VERTEX |
+"End Vertex" |
+
+
+public static final String |
+START_VERTEX |
+"Start Vertex" |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final String |
+CENTER_VERTEX |
+"Center Vertex" |
+
| Modifier and Type | +Constant Field | +Value | +
|---|---|---|
+
+public static final String |
+HUB_VERTEX |
+"Hub Vertex" |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/deprecated-list.html b/javadoc/deprecated-list.html new file mode 100644 index 0000000..87c6e99 --- /dev/null +++ b/javadoc/deprecated-list.html @@ -0,0 +1,205 @@ + + + + + + +| Class and Description | +
|---|
| org.jgrapht.alg.EdmondsKarpMaximumFlow
+ Use
+EdmondsKarpMaximumFlow instead |
+
| org.jgrapht.GraphHelper
+ Use
+Graphs instead. |
+
| org.jgrapht.alg.StrongConnectivityInspector
+ Use
+KosarajuStrongConnectivityInspector instead. |
+
| Method and Description | +
|---|
| org.jgrapht.alg.EdmondsBlossomShrinking.findMatch(UndirectedGraph |
+
| org.jgrapht.alg.KruskalMinimumSpanningTree.getEdgeSet() | +
| org.jgrapht.alg.KruskalMinimumSpanningTree.getSpanningTreeCost() | +
| 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.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/help-doc.html b/javadoc/help-doc.html new file mode 100644 index 0000000..56856fc --- /dev/null +++ b/javadoc/help-doc.html @@ -0,0 +1,222 @@ + + + + + + +The Overview page is the front page of this API document and provides a list of all packages with a summary for each. This page can also contain an overall description of the set of packages.
+Each package has a page that contains a list of its classes and interfaces, with a summary for each. This page can contain six categories:
+Each class, interface, nested class and nested interface has its own separate page. Each of these pages has three sections consisting of a class/interface description, summary tables, and detailed member descriptions:
+Each summary entry contains the first sentence from the detailed description for that item. The summary entries are alphabetical, while the detailed descriptions are in the order they appear in the source code. This preserves the logical groupings established by the programmer.
+Each annotation type has its own separate page with the following sections:
+Each enum has its own separate page with the following sections:
+Each documented package, class and interface has its own Use page. This page describes what packages, classes, methods, constructors and fields use any part of the given class or package. Given a class or interface A, its Use page includes subclasses of A, fields declared as A, methods that return A, and methods and constructors with parameters of type A. You can access this page by first going to the package, class or interface, then clicking on the "Use" link in the navigation bar.
+There is a Class Hierarchy page for all packages, plus a hierarchy for each package. Each hierarchy page contains a list of classes and a list of interfaces. The classes are organized by inheritance structure starting with java.lang.Object. The interfaces do not inherit from java.lang.Object.
The Deprecated API page lists all of the API that have been deprecated. A deprecated API is not recommended for use, generally due to improvements, and a replacement API is usually given. Deprecated APIs may be removed in future implementations.
+The Index contains an alphabetic list of all classes, interfaces, constructors, methods, and fields.
+These links take you to the next or previous class, interface, package, or related page.
+These links show and hide the HTML frames. All pages are available with or without frames.
+The All Classes link shows all classes and interfaces except non-static nested types.
+Each serializable or externalizable class has a description of its serialization fields and methods. This information is of interest to re-implementors, not to developers using the API. While there is no link in the navigation bar, you can get to this information by going to any serialized class and clicking "Serialized Form" in the "See also" section of the class description.
+The Constant Field Values page lists the static final fields and their values.
+Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/index-all.html b/javadoc/index-all.html new file mode 100644 index 0000000..5a6302d --- /dev/null +++ b/javadoc/index-all.html @@ -0,0 +1,5212 @@ + + + + + + +Graph interface.GraphbaseGraph.DirectedAcyclicGraph.addDagEdge(Object, Object), except an unchecked
+ IllegalArgumentException is thrown if a cycle would have been
+ induced by this edgeDirectedAcyclicGraph.addDagEdge(Object, Object, Object), except an
+ unchecked IllegalArgumentException is thrown if a cycle would
+ have been induced by this edgeGraph.addEdge(Object, Object) method.Graph.addEdge(Object, Object) method.Graph.addEdge(Object, Object)
+ method.sourceGraph to the
+ graph being built.vertex to the graph being built.vertices to the graph being built.a and b treating
+ start as the root we want to search from.a and
+ b) treating start as the root we want to search from,
+ and setting the LCA of each pair in its LCA fieldEdgeFactory for producing edges by using a class as a factory.VertexFactory for producing vertices by using a class as a factory.
+ g.v1 and v2, taking into
+ account whether ascending or descending order is used.ModifiableInteger objects numerically.Set s, where each set contains all
+ vertices that are in the same maximally connected component.Graph.GraphListener s and by
+ VertexSetListener s.WeightedGraph.ClosestFirstIterator.Graph.baseGraph.DirectedGraphBuilder for extending.baseGraph.MaskSubgraph on another graph.baseGraph.DirectedWeightedGraphBuilder for extending.baseGraph.EdmondsKarpMaximumFlow insteadedgeModifiableInteger.intValue().vertexGraphs instead.GraphPath.ModifiableInteger.true if and only if self-loops are allowed in this
+ graph.true if and only if multiple edges are allowed in
+ this graph.true if the graph is biconnected (no cutpoint),
+ false otherwise.true if the vertex is a cutpoint, false
+ otherwise.true if the edge is masked, false
+ otherwise.reuseEvents flag is set.reuseEvents flag is set.
+ StrongConnectivityAlgorithm instance is strongly connected.
+ StronglyConnectivityInspector instance is strongly connected.
+ StronglyConnectivityInspector instance is strongly connected.true if the vertex is masked, false
+ otherwise.ConnectivityInspector class with
+ the capability to compute the strongly connected components of a directed
+ graph.ListenableGraph.ListenableGraph.ListenableGraph.ListenableGraph.ModifiableInteger class wraps a value of the primitive type
+ int in an object, similarly to Integer.ModifiableInteger object that
+ represents the specified int value.next method.vertex from the graph being built, if such vertex exist
+ in graph.vertices from the graph being built, if
+ such vertices exist in graph.EdgeSetFactory to use for this graph.reuseEvents flag is set to true this
+ class will reuse previously fired events and will not create a new object
+ for each event.reuseEvents flag.Object.toString() on them.Object.toString() on them.KosarajuStrongConnectivityInspector instead.DirectedSubgraphs of the given graph.DirectedSubgraphs of the given graph.DirectedSubgraphs of the given graph.DirectedSubgraphs of the given graph.Integer object representing this
+ ModifiableInteger's value.String object representing this
+ ModifiableInteger's value.TraversalListener interface
+ used for subclasses.Graph.baseGraph.UndirectedGraphBuilder for extending.baseGraph.MaskSubgraph on another graph.baseGraph.UndirectedWeightedGraphBuilder for extending.baseGraph.ModifiableInteger.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/index.html b/javadoc/index.html new file mode 100644 index 0000000..ca3f9c1 --- /dev/null +++ b/javadoc/index.html @@ -0,0 +1,75 @@ + + + + + + +public interface DirectedGraph<V,E> +extends Graph<V,E>+
See + http://mathworld.wolfram.com/DirectedGraph.html for more on directed + graphs.
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+incomingEdgesOf(V vertex)
+Returns a set of all edges incoming into the specified vertex.
+ |
+
int |
+inDegreeOf(V vertex)
+Returns the "in degree" of the specified vertex.
+ |
+
int |
+outDegreeOf(V vertex)
+Returns the "out degree" of the specified vertex.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+Returns a set of all edges outgoing from the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetint inDegreeOf(V vertex)+
vertex - vertex whose degree is to be calculated.Set<E> incomingEdgesOf(V vertex)+
vertex - the vertex for which the list of incoming edges to be
+ returned.int outDegreeOf(V vertex)+
vertex - vertex whose degree is to be calculated.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/EdgeFactory.html b/javadoc/org/jgrapht/EdgeFactory.html new file mode 100644 index 0000000..34ea824 --- /dev/null +++ b/javadoc/org/jgrapht/EdgeFactory.html @@ -0,0 +1,229 @@ + + + + + + +public interface EdgeFactory<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
E |
+createEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge whose endpoints are the specified source and target
+ vertices.
+ |
+
E createEdge(V sourceVertex, + V targetVertex)+
sourceVertex - the source vertex.targetVertex - the target vertex.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/Graph.html b/javadoc/org/jgrapht/Graph.html new file mode 100644 index 0000000..a911dab --- /dev/null +++ b/javadoc/org/jgrapht/Graph.html @@ -0,0 +1,814 @@ + + + + + + +public interface Graph<V,E>
+This library generally follows the terminology found at:
+ http://mathworld.wolfram.com/topics/GraphTheory.html. Implementation of
+ this interface can provide simple-graphs, multigraphs, pseudographs etc. The
+ package org.jgrapht.graph provides a gallery of abstract and
+ concrete graph implementations.
This library works best when vertices represent arbitrary objects and + edges represent the relationships between them. Vertex and edge instances may + be shared by more than one graph.
+ +Through generics, a graph can be typed to specific classes for vertices
+ V and edges E<T>. Such a graph can contain
+ vertices of type V and all sub-types and Edges of type
+ E and all sub-types.
For guidelines on vertex and edge classes, see this wiki + page.
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
boolean |
+containsEdge(E e)
+Returns true if this graph contains the specified edge.
+ |
+
boolean |
+containsEdge(V sourceVertex,
+ V targetVertex)
+Returns true if and only if this graph contains an edge going
+ from the source vertex to the target vertex.
+ |
+
boolean |
+containsVertex(V v)
+Returns true if this graph contains the specified vertex.
+ |
+
Set<E> |
+edgeSet()
+Returns a set of the edges contained in this graph.
+ |
+
Set<E> |
+edgesOf(V vertex)
+Returns a set of all edges touching the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
EdgeFactory<V,E> |
+getEdgeFactory()
+Returns the edge factory using which this graph creates new edges.
+ |
+
V |
+getEdgeSource(E e)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E e)
+Returns the target vertex of an edge.
+ |
+
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
boolean |
+removeAllEdges(Collection<? extends E> edges)
+Removes all the edges in this graph that are also contained in the
+ specified edge collection.
+ |
+
Set<E> |
+removeAllEdges(V sourceVertex,
+ V targetVertex)
+Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges.
+ |
+
boolean |
+removeAllVertices(Collection<? extends V> vertices)
+Removes all the vertices in this graph that are also contained in the
+ specified vertex collection.
+ |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
Set<V> |
+vertexSet()
+Returns a set of the vertices contained in this graph.
+ |
+
Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
null, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.E getEdge(V sourceVertex, + V targetVertex)+
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.EdgeFactory<V,E> getEdgeFactory()+
E addEdge(V sourceVertex, + V targetVertex)+
null.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.IllegalArgumentException - if source or target vertices are not
+ found in the graph.NullPointerException - if any of the specified vertices is
+ null.getEdgeFactory()boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.IllegalArgumentException - if source or target vertices are not
+ found in the graph.ClassCastException - if the specified edge is not assignment
+ compatible with the class of edges produced by the edge factory of this
+ graph.NullPointerException - if any of the specified vertices is
+ null.addEdge(Object, Object),
+getEdgeFactory()boolean addVertex(V v)+
v, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.v - vertex to be added to this graph.NullPointerException - if the specified vertex is
+ null.boolean containsEdge(V sourceVertex, + V targetVertex)+
+ null, returns false.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.boolean containsEdge(E e)+
e2 such that e.equals(e2). If the
+ specified edge is null returns false.e - edge whose presence in this graph is to be tested.boolean containsVertex(V v)+
u such that u.equals(v). If the
+ specified vertex is null returns false.v - vertex whose presence in this graph is to be tested.Set<E> edgeSet()+
The graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
Set<E> edgesOf(V vertex)+
vertex - the vertex for which a set of touching edges is to be
+ returned.IllegalArgumentException - if vertex is not found in the graph.NullPointerException - if vertex is null.boolean removeAllEdges(Collection<? extends E> edges)+
removeEdge(Object) method.edges - edges to be removed from this graph.NullPointerException - if the specified edge collection is
+ null.removeEdge(Object),
+containsEdge(Object)Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
null if any of the specified vertices does not exist in the
+ graph. If both vertices exist but no edge is found, returns an empty set.
+ This method will either invoke the removeEdge(Object) method, or
+ the removeEdge(Object, Object) method.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if either vertex is not
+ part of graphboolean removeAllVertices(Collection<? extends V> vertices)+
removeVertex(Object) method.vertices - vertices to be removed from this graph.NullPointerException - if the specified vertex collection is
+ null.removeVertex(Object),
+containsVertex(Object)E removeEdge(V sourceVertex, + V targetVertex)+
null otherwise.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.boolean removeEdge(E e)+
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.boolean removeVertex(V v)+
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Set<V> vertexSet()+
The graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
V getEdgeSource(E e)+
e - edge of interestV getEdgeTarget(E e)+
e - edge of interestdouble getEdgeWeight(E e)+
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.e - edge of interestWeightedGraphCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/GraphHelper.html b/javadoc/org/jgrapht/GraphHelper.html new file mode 100644 index 0000000..dbb344d --- /dev/null +++ b/javadoc/org/jgrapht/GraphHelper.html @@ -0,0 +1,254 @@ + + + + + + +Graphs instead.@Deprecated +public abstract class GraphHelper +extends Graphs+
| Constructor and Description | +
|---|
GraphHelper()
+Deprecated.
+ |
+
addAllEdges, addAllVertices, addEdge, addEdgeWithVertices, addEdgeWithVertices, addEdgeWithVertices, addGraph, addGraphReversed, getOppositeVertex, getPathVertexList, neighborListOf, predecessorListOf, successorListOf, testIncidence, undirectedGraphCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/GraphMapping.html b/javadoc/org/jgrapht/GraphMapping.html new file mode 100644 index 0000000..ff7d5dd --- /dev/null +++ b/javadoc/org/jgrapht/GraphMapping.html @@ -0,0 +1,254 @@ + + + + + + +public interface GraphMapping<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
E |
+getEdgeCorrespondence(E edge,
+ boolean forward)
+Gets the mapped value where the key is
+edge |
+
V |
+getVertexCorrespondence(V vertex,
+ boolean forward)
+Gets the mapped value where the key is
+vertex |
+
V getVertexCorrespondence(V vertex, + boolean forward)+
vertexvertex - vertex in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
+ mapping from graph2 to graph1E getEdgeCorrespondence(E edge, + boolean forward)+
edgeedge - edge in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
+ mapping from graph2 to graph1Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/GraphPath.html b/javadoc/org/jgrapht/GraphPath.html new file mode 100644 index 0000000..dd78869 --- /dev/null +++ b/javadoc/org/jgrapht/GraphPath.html @@ -0,0 +1,302 @@ + + + + + + +public interface GraphPath<V,E>
+Graph. Note that a path is defined primarily in terms
+ of edges (rather than vertices) so that multiple edges between the same pair
+ of vertices can be discriminated.| Modifier and Type | +Method and Description | +
|---|---|
List<E> |
+getEdgeList()
+Returns the edges making up the path.
+ |
+
V |
+getEndVertex()
+Returns the end vertex in the path.
+ |
+
Graph<V,E> |
+getGraph()
+Returns the graph over which this path is defined.
+ |
+
V |
+getStartVertex()
+Returns the start vertex in the path.
+ |
+
double |
+getWeight()
+Returns the weight assigned to the path.
+ |
+
Graph<V,E> getGraph()+
V getStartVertex()+
V getEndVertex()+
List<E> getEdgeList()+
Graphs.getPathVertexList(org.jgrapht.GraphPath<V, E>) provides a convenience method for this.
+
+ Whether or not the returned edge list is modifiable depends on the + path implementation.
double getWeight()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/Graphs.html b/javadoc/org/jgrapht/Graphs.html new file mode 100644 index 0000000..77f4bfe --- /dev/null +++ b/javadoc/org/jgrapht/Graphs.html @@ -0,0 +1,649 @@ + + + + + + +public abstract class Graphs +extends Object+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> boolean |
+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 |
+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 |
+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
+
+Graph.addEdge(Object, Object) method. |
+
static <V,E> boolean |
+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 |
+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
+Graph.addEdge(Object, Object) method. |
+
static <V,E> E |
+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
+Graph.addEdge(Object, Object)
+ method. |
+
static <V,E> boolean |
+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> void |
+addGraphReversed(DirectedGraph<? super V,? super E> destination,
+ DirectedGraph<V,E> source)
+Adds all the vertices and all the edges of the specified source digraph
+ to the specified destination digraph, reversing all of the edges.
+ |
+
static <V,E> V |
+getOppositeVertex(Graph<V,E> g,
+ E e,
+ V v)
+Gets the vertex opposite another vertex across an edge.
+ |
+
static <V,E> List<V> |
+getPathVertexList(GraphPath<V,E> path)
+Gets the list of vertices visited by a path.
+ |
+
static <V,E> List<V> |
+neighborListOf(Graph<V,E> g,
+ V vertex)
+Returns a list of vertices that are the neighbors of a specified vertex.
+ |
+
static <V,E> List<V> |
+predecessorListOf(DirectedGraph<V,E> g,
+ V vertex)
+Returns a list of vertices that are the direct predecessors of a
+ specified vertex.
+ |
+
static <V,E> List<V> |
+successorListOf(DirectedGraph<V,E> g,
+ V vertex)
+Returns a list of vertices that are the direct successors of a specified
+ vertex.
+ |
+
static <V,E> boolean |
+testIncidence(Graph<V,E> g,
+ E e,
+ V v)
+Tests whether an edge is incident to a vertex.
+ |
+
static <V,E> UndirectedGraph<V,E> |
+undirectedGraph(Graph<V,E> g)
+Returns an undirected view of the specified graph.
+ |
+
public static <V,E> E addEdge(Graph<V,E> g, + V sourceVertex, + V targetVertex, + double weight)+
Graph.addEdge(Object, Object) method.g - the graph for which the edge to be added.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.weight - weight of the edge.
+ null.Graph.addEdge(Object, Object)public static <V,E> E addEdgeWithVertices(Graph<V,E> g, + V sourceVertex, + V targetVertex)+
Graph.addEdge(Object, Object) method.g - the graph for which the specified edge to be added.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.public static <V,E> boolean addEdgeWithVertices(Graph<V,E> targetGraph, + Graph<V,E> sourceGraph, + E edge)+
targetGraph - the graph for which the specified edge to be added.sourceGraph - the graph in which the specified edge is already
+ presentedge - edge to addpublic static <V,E> E addEdgeWithVertices(Graph<V,E> g, + V sourceVertex, + V targetVertex, + double weight)+
Graph.addEdge(Object, Object)
+ method.g - the graph for which the specified edge to be added.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.weight - weight of the edge.
+ null.public static <V,E> boolean addGraph(Graph<? super V,? super E> destination, + Graph<V,E> source)+
true
+ if the destination graph has been modified as a result of this operation,
+ otherwise it returns false.
+
+ The behavior of this operation is undefined if any of the specified + graphs is modified while operation is in progress.
destination - the graph to which vertices and edges are added.source - the graph used as source for vertices and edges to add.true if and only if the destination graph has been
+ changed as a result of this operation.public static <V,E> void addGraphReversed(DirectedGraph<? super V,? super E> destination, + DirectedGraph<V,E> source)+
EdgeReversedGraph instead.
+
+ The behavior of this operation is undefined if any of the specified + graphs is modified while operation is in progress.
destination - the graph to which vertices and edges are added.source - the graph used as source for vertices and edges to add.EdgeReversedGraphpublic static <V,E> boolean addAllEdges(Graph<? super V,? super E> destination, + Graph<V,E> source, + Collection<? extends E> edges)+
addEdgeWithVertices(org.jgrapht.Graph<V, E>, V, V) is used for the transfer, so source vertexes will
+ be added automatically to the target graph.destination - the graph to which edges are to be addedsource - the graph used as a source for edges to addedges - the edges to be addedpublic static <V,E> boolean addAllVertices(Graph<? super V,? super E> destination, + Collection<? extends V> vertices)+
Graph.addVertex(Object) method.destination - the graph to which edges are to be addedvertices - the vertices to be added to the graph.NullPointerException - if the specified vertices contains one or
+ more null vertices, or if the specified vertex collection is
+ null.Graph.addVertex(Object)public static <V,E> List<V> neighborListOf(Graph<V,E> g, + V vertex)+
g - the graph to look for neighbors in.vertex - the vertex to get the neighbors of.public static <V,E> List<V> predecessorListOf(DirectedGraph<V,E> g, + V vertex)+
g - the graph to look for predecessors in.vertex - the vertex to get the predecessors of.public static <V,E> List<V> successorListOf(DirectedGraph<V,E> g, + V vertex)+
g - the graph to look for successors in.vertex - the vertex to get the successors of.public static <V,E> UndirectedGraph<V,E> undirectedGraph(Graph<V,E> g)+
g - the graph for which an undirected view is to be returned.IllegalArgumentException - if the graph is neither DirectedGraph
+ nor UndirectedGraph.AsUndirectedGraphpublic static <V,E> boolean testIncidence(Graph<V,E> g, + E e, + V v)+
g - graph containing e and ve - edge in gv - vertex in gpublic static <V,E> V getOppositeVertex(Graph<V,E> g, + E e, + V v)+
g - graph containing e and ve - edge in gv - vertex in gCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ListenableGraph.html b/javadoc/org/jgrapht/ListenableGraph.html new file mode 100644 index 0000000..626d784 --- /dev/null +++ b/javadoc/org/jgrapht/ListenableGraph.html @@ -0,0 +1,288 @@ + + + + + + +public interface ListenableGraph<V,E> +extends Graph<V,E>+
GraphListener,
+VertexSetListener| Modifier and Type | +Method and Description | +
|---|---|
void |
+addGraphListener(GraphListener<V,E> l)
+Adds the specified graph listener to this graph, if not already present.
+ |
+
void |
+addVertexSetListener(VertexSetListener<V> l)
+Adds the specified vertex set listener to this graph, if not already
+ present.
+ |
+
void |
+removeGraphListener(GraphListener<V,E> l)
+Removes the specified graph listener from this graph, if present.
+ |
+
void |
+removeVertexSetListener(VertexSetListener<V> l)
+Removes the specified vertex set listener from this graph, if present.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetvoid addGraphListener(GraphListener<V,E> l)+
l - the listener to be added.void addVertexSetListener(VertexSetListener<V> l)+
l - the listener to be added.void removeGraphListener(GraphListener<V,E> l)+
l - the listener to be removed.void removeVertexSetListener(VertexSetListener<V> l)+
l - the listener to be removed.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/UndirectedGraph.html b/javadoc/org/jgrapht/UndirectedGraph.html new file mode 100644 index 0000000..dae85f9 --- /dev/null +++ b/javadoc/org/jgrapht/UndirectedGraph.html @@ -0,0 +1,242 @@ + + + + + + +public interface UndirectedGraph<V,E> +extends Graph<V,E>+
See + http://mathworld.wolfram.com/Graph.html for more on undirected and on + directed graphs.
| Modifier and Type | +Method and Description | +
|---|---|
int |
+degreeOf(V vertex)
+Returns the degree of the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetint degreeOf(V vertex)+
vertex - vertex whose degree is to be calculated.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/VertexFactory.html b/javadoc/org/jgrapht/VertexFactory.html new file mode 100644 index 0000000..f6cf0c7 --- /dev/null +++ b/javadoc/org/jgrapht/VertexFactory.html @@ -0,0 +1,223 @@ + + + + + + +public interface VertexFactory<V>
+| Modifier and Type | +Method and Description | +
|---|---|
V |
+createVertex()
+Creates a new vertex.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/WeightedGraph.html b/javadoc/org/jgrapht/WeightedGraph.html new file mode 100644 index 0000000..4787e7e --- /dev/null +++ b/javadoc/org/jgrapht/WeightedGraph.html @@ -0,0 +1,277 @@ + + + + + + +public interface WeightedGraph<V,E> +extends Graph<V,E>+
| Modifier and Type | +Field and Description | +
|---|---|
static double |
+DEFAULT_EDGE_WEIGHT
+The default weight for an edge.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+setEdgeWeight(E e,
+ double weight)
+Assigns a weight to an edge.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetstatic final double DEFAULT_EDGE_WEIGHT+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/AStarShortestPath.html b/javadoc/org/jgrapht/alg/AStarShortestPath.html new file mode 100644 index 0000000..ec0e350 --- /dev/null +++ b/javadoc/org/jgrapht/alg/AStarShortestPath.html @@ -0,0 +1,428 @@ + + + + + + +public class AStarShortestPath<V,E> +extends Object+
getShortestPath(Object,
+ Object, AStarAdmissibleHeuristic) getShortestPath} method; no new instance
+ of this class has to be created. The heuristic is implemented using a
+ FibonacciHeap data structure to maintain the set of open nodes. However,
+ there still exist several approaches in literature to improve the performance
+ of this heuristic which one could consider to implement. Another issue to
+ take into consideration is the following: given to candidate nodes, i, j to
+ expand, where f(i)=f(j), g(i)>g(j), h(i)<g(j), f(i)=g(i)+h(i), g(i) is
+ the actual distance from the source node to i, h(i) is the estimated distance
+ from i to the target node. Usually a depth-first search is desired, so
+ ideally we would expand node i first. Using the FibonacciHeap, this is not
+ necessarily the case though. This could be improved in a later version.| Modifier and Type | +Field and Description | +
|---|---|
protected AStarAdmissibleHeuristic<V> |
+admissibleHeuristic |
+
protected Map<V,E> |
+cameFrom |
+
protected Set<V> |
+closedList |
+
protected Map<V,Double> |
+gScoreMap |
+
protected int |
+numberOfExpandedNodes |
+
protected FibonacciHeap<V> |
+openList |
+
protected Map<V,FibonacciHeapNode<V>> |
+vertexToHeapNodeMap |
+
| Constructor and Description | +
|---|
AStarShortestPath(Graph<V,E> graph) |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+getNumberOfExpandedNodes()
+Returns how many nodes have been expanded in the A* search procedure in
+ its last invocation.
+ |
+
GraphPath<V,E> |
+getShortestPath(V sourceVertex,
+ V targetVertex,
+ AStarAdmissibleHeuristic<V> admissibleHeuristic)
+Calculates (and returns) the shortest path from the sourceVertex to the
+ targetVertex.
+ |
+
protected FibonacciHeap<V> openList+
protected Map<V,FibonacciHeapNode<V>> vertexToHeapNodeMap+
protected AStarAdmissibleHeuristic<V> admissibleHeuristic+
protected int numberOfExpandedNodes+
public GraphPath<V,E> getShortestPath(V sourceVertex, + V targetVertex, + AStarAdmissibleHeuristic<V> admissibleHeuristic)+
sourceVertex - source vertextargetVertex - target vertexadmissibleHeuristic - admissible heuristic which estimates the
+ distance from a node to the target node.public int getNumberOfExpandedNodes()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/AllDirectedPaths.html b/javadoc/org/jgrapht/alg/AllDirectedPaths.html new file mode 100644 index 0000000..b7faf6d --- /dev/null +++ b/javadoc/org/jgrapht/alg/AllDirectedPaths.html @@ -0,0 +1,312 @@ + + + + + + +public class AllDirectedPaths<V,E> +extends Object+
| Constructor and Description | +
|---|
AllDirectedPaths(DirectedGraph<V,E> graph) |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<GraphPath<V,E>> |
+getAllPaths(Set<V> sourceVertices,
+ Set<V> targetVertices,
+ boolean simplePathsOnly,
+ Integer maxPathLength)
+Calculate (and return) all paths from the source vertices to the target
+ vertices.
+ |
+
List<GraphPath<V,E>> |
+getAllPaths(V sourceVertex,
+ V targetVertex,
+ boolean simplePathsOnly,
+ Integer maxPathLength)
+Calculate (and return) all paths from the source vertex to the target
+ vertex.
+ |
+
public AllDirectedPaths(DirectedGraph<V,E> graph)+
public List<GraphPath<V,E>> getAllPaths(V sourceVertex, + V targetVertex, + boolean simplePathsOnly, + Integer maxPathLength)+
sourceVertex - the source vertextargetVertex - the target vertexsimplePathsOnly - if true, only search simple
+ (non-self-intersecting) pathsmaxPathLength - maximum number of edges to allow in a path (if null,
+ all paths are considered, which may be very slow due to potentially huge
+ output)public List<GraphPath<V,E>> getAllPaths(Set<V> sourceVertices, + Set<V> targetVertices, + boolean simplePathsOnly, + Integer maxPathLength)+
sourceVertices - the source verticestargetVertices - the target verticessimplePathsOnly - if true, only search simple
+ (non-self-intersecting) pathsmaxPathLength - maximum number of edges to allow in a path (if null,
+ all paths are considered, which may be very slow due to potentially huge
+ output)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/BellmanFordShortestPath.html b/javadoc/org/jgrapht/alg/BellmanFordShortestPath.html new file mode 100644 index 0000000..6a11237 --- /dev/null +++ b/javadoc/org/jgrapht/alg/BellmanFordShortestPath.html @@ -0,0 +1,426 @@ + + + + + + +public class BellmanFordShortestPath<V,E> +extends Object+
| Modifier and Type | +Field and Description | +
|---|---|
protected Graph<V,E> |
+graph
+Graph on which shortest paths are searched.
+ |
+
protected V |
+startVertex
+Start vertex.
+ |
+
| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> List<E> |
+findPathBetween(Graph<V,E> graph,
+ V startVertex,
+ V endVertex)
+Convenience method to find the shortest path via a single static method
+ call.
+ |
+
double |
+getCost(V endVertex) |
+
List<E> |
+getPathEdgeList(V endVertex) |
+
public BellmanFordShortestPath(Graph<V,E> graph, + V startVertex)+
graph - startVertex - public BellmanFordShortestPath(Graph<V,E> graph, + V startVertex, + int nMaxHops)+
graph - startVertex - nMaxHops - maximum number of edges of the calculated paths.public BellmanFordShortestPath(Graph<V,E> graph, + V startVertex, + int nMaxHops, + double epsilon)+
graph - startVertex - nMaxHops - maximum number of edges of the calculated paths.epsilon - tolerance factor.public double getCost(V endVertex)+
endVertex - end vertex.public List<E> getPathEdgeList(V endVertex)+
endVertex - end vertex.Edge, or null if no path exists between the
+ start vertex and the end vertex.public static <V,E> List<E> findPathBetween(Graph<V,E> graph, + V startVertex, + V endVertex)+
graph - the graph to be searchedstartVertex - the vertex at which the path should startendVertex - the vertex at which the path should endCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/BiconnectivityInspector.html b/javadoc/org/jgrapht/alg/BiconnectivityInspector.html new file mode 100644 index 0000000..2acfc34 --- /dev/null +++ b/javadoc/org/jgrapht/alg/BiconnectivityInspector.html @@ -0,0 +1,327 @@ + + + + + + +public class BiconnectivityInspector<V,E> +extends Object+
BlockCutpointGraph for more information. A biconnected graph has only one
+ block (i.e. no cutpoints).| Constructor and Description | +
|---|
BiconnectivityInspector(UndirectedGraph<V,E> graph)
+Running time = O(m) where m is the number of edges.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<Set<V>> |
+getBiconnectedVertexComponents()
+Returns the biconnected vertex-components of the graph.
+ |
+
Set<Set<V>> |
+getBiconnectedVertexComponents(V vertex)
+Returns the biconnected vertex-components containing the vertex.
+ |
+
Set<V> |
+getCutpoints()
+Returns the cutpoints of the graph.
+ |
+
boolean |
+isBiconnected()
+Returns
+true if the graph is biconnected (no cutpoint),
+ false otherwise. |
+
public BiconnectivityInspector(UndirectedGraph<V,E> graph)+
public Set<Set<V>> getBiconnectedVertexComponents()+
public Set<Set<V>> getBiconnectedVertexComponents(V vertex)+
vertex - public boolean isBiconnected()+
true if the graph is biconnected (no cutpoint),
+ false otherwise.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/BlockCutpointGraph.html b/javadoc/org/jgrapht/alg/BlockCutpointGraph.html new file mode 100644 index 0000000..8d23173 --- /dev/null +++ b/javadoc/org/jgrapht/alg/BlockCutpointGraph.html @@ -0,0 +1,398 @@ + + + + + + +public class BlockCutpointGraph<V,E> +extends SimpleGraph<UndirectedGraph<V,E>,DefaultEdge>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
BlockCutpointGraph(UndirectedGraph<V,E> graph)
+Running time = O(m) where m is the number of edges.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
UndirectedGraph<V,E> |
+getBlock(V vertex)
+Returns the vertex if vertex is a cutpoint, and otherwise returns the
+ block (biconnected component) containing the vertex.
+ |
+
Set<V> |
+getCutpoints()
+Returns the cutpoints of the initial graph.
+ |
+
boolean |
+isCutpoint(V vertex)
+Returns
+true if the vertex is a cutpoint, false
+ otherwise. |
+
builder, builderaddEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic BlockCutpointGraph(UndirectedGraph<V,E> graph)+
public UndirectedGraph<V,E> getBlock(V vertex)+
vertex - vertex in the initial graph.public boolean isCutpoint(V vertex)+
true if the vertex is a cutpoint, false
+ otherwise.vertex - vertex in the initial graph.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html b/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html new file mode 100644 index 0000000..70c832a --- /dev/null +++ b/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html @@ -0,0 +1,294 @@ + + + + + + +public class BronKerboschCliqueFinder<V,E> +extends Object+
| Constructor and Description | +
|---|
BronKerboschCliqueFinder(Graph<V,E> graph)
+Creates a new clique finder.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Collection<Set<V>> |
+getAllMaximalCliques()
+Finds all maximal cliques of the graph.
+ |
+
Collection<Set<V>> |
+getBiggestMaximalCliques()
+Finds the biggest maximal cliques of the graph.
+ |
+
public Collection<Set<V>> getAllMaximalCliques()+
public Collection<Set<V>> getBiggestMaximalCliques()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/ChromaticNumber.html b/javadoc/org/jgrapht/alg/ChromaticNumber.html new file mode 100644 index 0000000..567ee6b --- /dev/null +++ b/javadoc/org/jgrapht/alg/ChromaticNumber.html @@ -0,0 +1,291 @@ + + + + + + +public abstract class ChromaticNumber +extends Object+
| Constructor and Description | +
|---|
ChromaticNumber() |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> int |
+findGreedyChromaticNumber(UndirectedGraph<V,E> g)
+Finds the number of colors required for a greedy coloring of the graph.
+ |
+
static <V,E> Map<Integer,Set<V>> |
+findGreedyColoredGroups(UndirectedGraph<V,E> g)
+Finds a greedy coloring of the graph.
+ |
+
public static <V,E> int findGreedyChromaticNumber(UndirectedGraph<V,E> g)+
g - an undirected graph to find the chromatic number ofpublic static <V,E> Map<Integer,Set<V>> findGreedyColoredGroups(UndirectedGraph<V,E> g)+
g - an undirected graph for which to find the coloringCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/CliqueMinimalSeparatorDecomposition.html b/javadoc/org/jgrapht/alg/CliqueMinimalSeparatorDecomposition.html new file mode 100644 index 0000000..2ae149b --- /dev/null +++ b/javadoc/org/jgrapht/alg/CliqueMinimalSeparatorDecomposition.html @@ -0,0 +1,422 @@ + + + + + + +public class CliqueMinimalSeparatorDecomposition<V,E> +extends Object+
The Clique Minimal Separator (CMS) Decomposition is a procedure that + splits a graph into a set of subgraphs separated by minimal clique + separators, adding the separating clique to each component produced by the + separation. At the end we have a set of atoms. The CMS decomposition is + unique and yields the set of the atoms independent of the order of the + decomposition.
| Constructor and Description | +
|---|
CliqueMinimalSeparatorDecomposition(UndirectedGraph<V,E> g)
+Setup a clique minimal separator decomposition on undirected graph
+
+ g. |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<Set<V>> |
+getAtoms()
+Get the atoms generated by the decomposition.
+ |
+
Set<E> |
+getFillEdges()
+Get the fill edges generated by the triangulation.
+ |
+
Map<Set<V>,Integer> |
+getFullComponentCount()
+Get a map to know for each separator how many components it produces.
+ |
+
List<V> |
+getGenerators()
+Get the generators of the separators of the triangulated graph, i.e.
+ |
+
UndirectedGraph<V,E> |
+getGraph()
+Get the original graph.
+ |
+
LinkedList<V> |
+getMeo()
+Get the minimal elimination ordering produced by the triangulation.
+ |
+
UndirectedGraph<V,E> |
+getMinimalTriangulation()
+Get the minimal triangulation of the graph.
+ |
+
Set<Set<V>> |
+getSeparators()
+Get the clique minimal separators.
+ |
+
boolean |
+isChordal()
+Check if the graph is chordal.
+ |
+
public CliqueMinimalSeparatorDecomposition(UndirectedGraph<V,E> g)+
+ g. Loops and multiple edges are removed, i.e. the graph is
+ transformed to a simple graph.g - The graph to decompose.public boolean isChordal()+
public Set<E> getFillEdges()+
public UndirectedGraph<V,E> getMinimalTriangulation()+
public List<V> getGenerators()+
public LinkedList<V> getMeo()+
public Map<Set<V>,Integer> getFullComponentCount()+
public Set<Set<V>> getAtoms()+
public Set<Set<V>> getSeparators()+
public UndirectedGraph<V,E> getGraph()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/ConnectivityInspector.html b/javadoc/org/jgrapht/alg/ConnectivityInspector.html new file mode 100644 index 0000000..a295b50 --- /dev/null +++ b/javadoc/org/jgrapht/alg/ConnectivityInspector.html @@ -0,0 +1,473 @@ + + + + + + +public class ConnectivityInspector<V,E> +extends Object +implements GraphListener<V,E>+
KosarajuStrongConnectivityInspector
+ instead.
+
+ The inspector methods work in a lazy fashion: no computation is performed + unless immediately necessary. Computation are done once and results and + cached within this class for future need.
+ +The inspector is also a GraphListener. If added
+ as a listener to the inspected graph, the inspector will amend internal
+ cached results instead of recomputing them. It is efficient when a few
+ modifications are applied to a large graph. If many modifications are
+ expected it will not be efficient due to added overhead on graph update
+ operations. If inspector is added as listener to a graph other than the one
+ it inspects, results are undefined.
| Constructor and Description | +
|---|
ConnectivityInspector(DirectedGraph<V,E> g)
+Creates a connectivity inspector for the specified directed graph.
+ |
+
ConnectivityInspector(UndirectedGraph<V,E> g)
+Creates a connectivity inspector for the specified undirected graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<V> |
+connectedSetOf(V vertex)
+Returns a set of all vertices that are in the maximally connected
+ component together with the specified vertex.
+ |
+
List<Set<V>> |
+connectedSets()
+Returns a list of
+Set s, where each set contains all
+ vertices that are in the same maximally connected component. |
+
void |
+edgeAdded(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been added to the graph.
+ |
+
void |
+edgeRemoved(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been removed from the graph.
+ |
+
boolean |
+isGraphConnected()
+Test if the inspected graph is connected.
+ |
+
boolean |
+pathExists(V sourceVertex,
+ V targetVertex)
+Tests if there is a path from the specified source vertex to the
+ specified target vertices.
+ |
+
void |
+vertexAdded(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been added to the graph.
+ |
+
void |
+vertexRemoved(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been removed from the graph.
+ |
+
public ConnectivityInspector(UndirectedGraph<V,E> g)+
g - the graph for which a connectivity inspector to be created.public ConnectivityInspector(DirectedGraph<V,E> g)+
g - the graph for which a connectivity inspector to be created.public boolean isGraphConnected()+
true if and only if inspected graph is connected.public Set<V> connectedSetOf(V vertex)+
vertex - the vertex for which the connected set to be returned.public List<Set<V>> connectedSets()+
Set s, where each set contains all
+ vertices that are in the same maximally connected component. All graph
+ vertices occur in exactly one set. For more on maximally connected
+ component, see
+ http://www.nist.gov/dads/HTML/maximallyConnectedComponent.html.Set s, where each set contains all
+ vertices that are in the same maximally connected component.public void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeAdded in interface GraphListener<V,E>e - the edge event.GraphListener.edgeAdded(GraphEdgeChangeEvent)public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeRemoved in interface GraphListener<V,E>e - the edge event.GraphListener.edgeRemoved(GraphEdgeChangeEvent)public boolean pathExists(V sourceVertex, + V targetVertex)+
Note: Future versions of this method might not ignore edge directions + for directed graphs.
sourceVertex - one end of the path.targetVertex - another end of the path.true if and only if there is a path from the source
+ vertex to the target vertex.public void vertexAdded(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexAdded in interface VertexSetListener<V>e - the vertex event.VertexSetListener.vertexAdded(GraphVertexChangeEvent)public void vertexRemoved(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexRemoved in interface VertexSetListener<V>e - the vertex event.VertexSetListener.vertexRemoved(GraphVertexChangeEvent)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/CycleDetector.html b/javadoc/org/jgrapht/alg/CycleDetector.html new file mode 100644 index 0000000..5787db2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/CycleDetector.html @@ -0,0 +1,340 @@ + + + + + + +public class CycleDetector<V,E> +extends Object+
| Constructor and Description | +
|---|
CycleDetector(DirectedGraph<V,E> graph)
+Creates a cycle detector for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+detectCycles()
+Performs yes/no cycle detection on the entire graph.
+ |
+
boolean |
+detectCyclesContainingVertex(V v)
+Performs yes/no cycle detection on an individual vertex.
+ |
+
Set<V> |
+findCycles()
+Finds the vertex set for the subgraph of all cycles.
+ |
+
Set<V> |
+findCyclesContainingVertex(V v)
+Finds the vertex set for the subgraph of all cycles which contain a
+ particular vertex.
+ |
+
public CycleDetector(DirectedGraph<V,E> graph)+
graph - the DirectedGraph in which to detect cyclespublic boolean detectCycles()+
public boolean detectCyclesContainingVertex(V v)+
v - the vertex to testpublic Set<V> findCycles()+
public Set<V> findCyclesContainingVertex(V v)+
REVIEW jvs 25-Aug-2006: This implementation is not guaranteed to cover + all cases. If you want to be absolutely certain that you report vertices + from all cycles containing v, it's safer (but less efficient) to use + StrongConnectivityAlgorithm instead and return the strongly connected + component containing v.
v - the vertex to testCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/DijkstraShortestPath.html b/javadoc/org/jgrapht/alg/DijkstraShortestPath.html new file mode 100644 index 0000000..560366b --- /dev/null +++ b/javadoc/org/jgrapht/alg/DijkstraShortestPath.html @@ -0,0 +1,369 @@ + + + + + + +public final class DijkstraShortestPath<V,E> +extends Object+
ClosestFirstIterator.| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> List<E> |
+findPathBetween(Graph<V,E> graph,
+ V startVertex,
+ V endVertex)
+Convenience method to find the shortest path via a single static method
+ call.
+ |
+
GraphPath<V,E> |
+getPath()
+Return the path found.
+ |
+
List<E> |
+getPathEdgeList()
+Return the edges making up the path found.
+ |
+
double |
+getPathLength()
+Return the weighted length of the path found.
+ |
+
public DijkstraShortestPath(Graph<V,E> graph, + V startVertex, + V endVertex)+
graph - the graph to be searchedstartVertex - the vertex at which the path should startendVertex - the vertex at which the path should endpublic DijkstraShortestPath(Graph<V,E> graph, + V startVertex, + V endVertex, + double radius)+
graph - the graph to be searchedstartVertex - the vertex at which the path should startendVertex - the vertex at which the path should endradius - limit on weighted path length, or Double.POSITIVE_INFINITY
+ for unbounded searchpublic List<E> getPathEdgeList()+
public GraphPath<V,E> getPath()+
public double getPathLength()+
public static <V,E> List<E> findPathBetween(Graph<V,E> graph, + V startVertex, + V endVertex)+
graph - the graph to be searchedstartVertex - the vertex at which the path should startendVertex - the vertex at which the path should endCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/DirectedNeighborIndex.html b/javadoc/org/jgrapht/alg/DirectedNeighborIndex.html new file mode 100644 index 0000000..538376e --- /dev/null +++ b/javadoc/org/jgrapht/alg/DirectedNeighborIndex.html @@ -0,0 +1,450 @@ + + + + + + +public class DirectedNeighborIndex<V,E> +extends Object +implements GraphListener<V,E>+
Graphs, they are re-calculated at each invocation by
+ walking a vertex's incident edges, which becomes inordinately expensive when
+ performed often.
+
+ A vertex's neighbors are cached the first time they are asked for (i.e. + the index is built on demand). The index will only be updated automatically + if it is added to the associated graph as a listener. If it is added as a + listener to a graph other than the one it indexes, results are undefined.
| Constructor and Description | +
|---|
DirectedNeighborIndex(DirectedGraph<V,E> g)
+Creates a neighbor index for the specified directed graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+edgeAdded(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been added to the graph.
+ |
+
void |
+edgeRemoved(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been removed from the graph.
+ |
+
List<V> |
+predecessorListOf(V v)
+Returns the set of vertices which are the predecessors of a specified
+ vertex.
+ |
+
Set<V> |
+predecessorsOf(V v)
+Returns the set of vertices which are the predecessors of a specified
+ vertex.
+ |
+
List<V> |
+successorListOf(V v)
+Returns the set of vertices which are the successors of a specified
+ vertex.
+ |
+
Set<V> |
+successorsOf(V v)
+Returns the set of vertices which are the successors of a specified
+ vertex.
+ |
+
void |
+vertexAdded(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been added to the graph.
+ |
+
void |
+vertexRemoved(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been removed from the graph.
+ |
+
public DirectedNeighborIndex(DirectedGraph<V,E> g)+
g - the graph for which a neighbor index is to be created.public Set<V> predecessorsOf(V v)+
v - the vertex whose predecessors are desiredpublic List<V> predecessorListOf(V v)+
predecessorsOf(Object) unless duplicate neighbors are required.v - the vertex whose predecessors are desiredpublic Set<V> successorsOf(V v)+
v - the vertex whose successors are desiredpublic List<V> successorListOf(V v)+
successorsOf(Object) unless duplicate neighbors are required.v - the vertex whose successors are desiredpublic void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeAdded in interface GraphListener<V,E>e - the edge event.GraphListener.edgeAdded(GraphEdgeChangeEvent)public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeRemoved in interface GraphListener<V,E>e - the edge event.GraphListener.edgeRemoved(GraphEdgeChangeEvent)public void vertexAdded(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexAdded in interface VertexSetListener<V>e - the vertex event.VertexSetListener.vertexAdded(GraphVertexChangeEvent)public void vertexRemoved(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexRemoved in interface VertexSetListener<V>e - the vertex event.VertexSetListener.vertexRemoved(GraphVertexChangeEvent)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/EdmondsBlossomShrinking.html b/javadoc/org/jgrapht/alg/EdmondsBlossomShrinking.html new file mode 100644 index 0000000..dd65bf9 --- /dev/null +++ b/javadoc/org/jgrapht/alg/EdmondsBlossomShrinking.html @@ -0,0 +1,311 @@ + + + + + + +public class EdmondsBlossomShrinking<V,E> +extends Object +implements MatchingAlgorithm<V,E>+
| Constructor and Description | +
|---|
EdmondsBlossomShrinking()
+Deprecated.
+ |
+
EdmondsBlossomShrinking(UndirectedGraph<V,E> G) |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+findMatch(UndirectedGraph<V,E> g)
+Deprecated.
+ |
+
Set<E> |
+getMatching()
+Returns set of edges making up the matching
+ |
+
@Deprecated +public EdmondsBlossomShrinking()+
public EdmondsBlossomShrinking(UndirectedGraph<V,E> G)+
@Deprecated +public Set<E> findMatch(UndirectedGraph<V,E> g)+
public Set<E> getMatching()+
MatchingAlgorithmgetMatching in interface MatchingAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/EdmondsKarpMaximumFlow.html b/javadoc/org/jgrapht/alg/EdmondsKarpMaximumFlow.html new file mode 100644 index 0000000..5c7d163 --- /dev/null +++ b/javadoc/org/jgrapht/alg/EdmondsKarpMaximumFlow.html @@ -0,0 +1,491 @@ + + + + + + +EdmondsKarpMaximumFlow instead@Deprecated +public final class EdmondsKarpMaximumFlow<V,E> +extends Object +implements MaximumFlowAlgorithm<V,E>+
MaximumFlowAlgorithm.MaximumFlow<V,E>, MaximumFlowAlgorithm.MaximumFlowImpl<V,E>| Modifier and Type | +Field and Description | +
|---|---|
static double |
+DEFAULT_EPSILON
+Deprecated.
+Default tolerance.
+ |
+
| Constructor and Description | +
|---|
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)
+Deprecated.
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network,
+ double epsilon)
+Deprecated.
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+buildMaximumFlow(V source,
+ V sink)
+Deprecated.
+Builds maximum flow for the supplied network flow, for the supplied
+ ${source} and ${sink}
+ |
+
void |
+calculateMaximumFlow(V source,
+ V sink)
+Deprecated.
+Sets current source to source, current sink to sink,
+ then calculates maximum flow from source to sink.
+ |
+
V |
+getCurrentSink()
+Deprecated.
+Returns current sink vertex, or null if there was no
+ calculateMaximumFlow calls.
+ |
+
V |
+getCurrentSource()
+Deprecated.
+Returns current source vertex, or null if there was no
+ calculateMaximumFlow calls.
+ |
+
Map<E,Double> |
+getMaximumFlow()
+Deprecated.
+Returns maximum flow, that was calculated during last
+ calculateMaximumFlow call, or null, if there was no
+ calculateMaximumFlow calls.
+ |
+
Double |
+getMaximumFlowValue()
+Deprecated.
+Returns maximum flow value, that was calculated during last
+ calculateMaximumFlow call, or null, if there was no
+ calculateMaximumFlow calls.
+ |
+
public static final double DEFAULT_EPSILON+
public EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)+
network - network, where maximum flow will be calculatedpublic EdmondsKarpMaximumFlow(DirectedGraph<V,E> network, + double epsilon)+
network - network, where maximum flow will be calculatedepsilon - tolerance for comparing doublespublic void calculateMaximumFlow(V source, + V sink)+
source - source vertexsink - sink vertexpublic Double getMaximumFlowValue()+
public Map<E,Double> getMaximumFlow()+
public V getCurrentSource()+
public V getCurrentSink()+
public MaximumFlowAlgorithm.MaximumFlow<V,E> buildMaximumFlow(V source, + V sink)+
MaximumFlowAlgorithmbuildMaximumFlow in interface MaximumFlowAlgorithm<V,E>source - source of the flow inside the networksink - sink of the flow inside the networkCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/EulerianCircuit.html b/javadoc/org/jgrapht/alg/EulerianCircuit.html new file mode 100644 index 0000000..63bacbf --- /dev/null +++ b/javadoc/org/jgrapht/alg/EulerianCircuit.html @@ -0,0 +1,293 @@ + + + + + + +public abstract class EulerianCircuit +extends Object+
| Constructor and Description | +
|---|
EulerianCircuit() |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> List<V> |
+getEulerianCircuitVertices(UndirectedGraph<V,E> g)
+This method will return a list of vertices which represents the Eulerian
+ circuit of the graph.
+ |
+
static <V,E> boolean |
+isEulerian(UndirectedGraph<V,E> g)
+This method will check whether the graph passed in is Eulerian or not.
+ |
+
public static <V,E> boolean isEulerian(UndirectedGraph<V,E> g)+
g - The graph to be checkedpublic static <V,E> List<V> getEulerianCircuitVertices(UndirectedGraph<V,E> g)+
g - The graph to find an Eulerian circuitCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html b/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html new file mode 100644 index 0000000..c2c04f9 --- /dev/null +++ b/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html @@ -0,0 +1,397 @@ + + + + + + +public class FloydWarshallShortestPaths<V,E> +extends Object+
| Constructor and Description | +
|---|
FloydWarshallShortestPaths(Graph<V,E> graph) |
+
| Modifier and Type | +Method and Description | +
|---|---|
double |
+getDiameter() |
+
Graph<V,E> |
+getGraph() |
+
GraphPath<V,E> |
+getShortestPath(V a,
+ V b)
+Get the shortest path between two vertices.
+ |
+
List<V> |
+getShortestPathAsVertexList(V a,
+ V b) |
+
List<GraphPath<V,E>> |
+getShortestPaths()
+Get all shortest paths in the graph.
+ |
+
List<GraphPath<V,E>> |
+getShortestPaths(V v)
+Get shortest paths from a vertex to all other vertices in the graph.
+ |
+
int |
+getShortestPathsCount() |
+
double |
+shortestDistance(V a,
+ V b)
+Get the length of a shortest path.
+ |
+
public int getShortestPathsCount()+
public double shortestDistance(V a, + V b)+
a - first vertexb - second vertexpublic double getDiameter()+
public GraphPath<V,E> getShortestPath(V a, + V b)+
a - From verticeb - To verticepublic List<GraphPath<V,E>> getShortestPaths(V v)+
v - the originating vertexCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/GabowStrongConnectivityInspector.html b/javadoc/org/jgrapht/alg/GabowStrongConnectivityInspector.html new file mode 100644 index 0000000..3d6149a --- /dev/null +++ b/javadoc/org/jgrapht/alg/GabowStrongConnectivityInspector.html @@ -0,0 +1,356 @@ + + + + + + +public class GabowStrongConnectivityInspector<V,E> +extends Object +implements StrongConnectivityAlgorithm<V,E>+
| Constructor and Description | +
|---|
GabowStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+The constructor of GabowStrongConnectivityInspector class.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+getGraph()
+Returns the graph inspected
+ |
+
boolean |
+isStronglyConnected()
+Returns true if the graph instance is strongly connected.
+ |
+
List<Set<V>> |
+stronglyConnectedSets()
+
+ |
+
List<DirectedSubgraph<V,E>> |
+stronglyConnectedSubgraphs()
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
public GabowStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)+
directedGraph - the graph to inspectIllegalArgumentExceptionpublic DirectedGraph<V,E> getGraph()+
getGraph in interface StrongConnectivityAlgorithm<V,E>public boolean isStronglyConnected()+
isStronglyConnected in interface StrongConnectivityAlgorithm<V,E>public List<Set<V>> stronglyConnectedSets()+
List of Sets, where each set contains vertices
+ which together form a strongly connected component within the given
+ graph.stronglyConnectedSets in interface StrongConnectivityAlgorithm<V,E>List of Set s containing the strongly
+ connected componentspublic List<DirectedSubgraph<V,E>> stronglyConnectedSubgraphs()+
Computes a list of DirectedSubgraphs of the given graph. Each
+ subgraph will represent a strongly connected component and will contain
+ all vertices of that component. The subgraph will have an edge (u,v) iff
+ u and v are contained in the strongly connected component.
NOTE: Calling this method will first execute stronglyConnectedSets(). If you don't
+ need subgraphs, use that method.
stronglyConnectedSubgraphs in interface StrongConnectivityAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/HamiltonianCycle.html b/javadoc/org/jgrapht/alg/HamiltonianCycle.html new file mode 100644 index 0000000..fd799d0 --- /dev/null +++ b/javadoc/org/jgrapht/alg/HamiltonianCycle.html @@ -0,0 +1,277 @@ + + + + + + +public class HamiltonianCycle +extends Object+
| Constructor and Description | +
|---|
HamiltonianCycle() |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> List<V> |
+getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)
+This method will return an approximate minimal traveling salesman tour
+ (hamiltonian cycle).
+ |
+
public static <V,E> List<V> getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)+
V - E - g - is the graph to find the optimal tour for.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/HopcroftKarpBipartiteMatching.html b/javadoc/org/jgrapht/alg/HopcroftKarpBipartiteMatching.html new file mode 100644 index 0000000..174e885 --- /dev/null +++ b/javadoc/org/jgrapht/alg/HopcroftKarpBipartiteMatching.html @@ -0,0 +1,286 @@ + + + + + + +public class HopcroftKarpBipartiteMatching<V,E> +extends Object +implements MatchingAlgorithm<V,E>+
| Constructor and Description | +
|---|
HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph,
+ Set<V> partition1,
+ Set<V> partition2) |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getMatching()
+Returns set of edges making up the matching
+ |
+
public Set<E> getMatching()+
MatchingAlgorithmgetMatching in interface MatchingAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/KShortestPaths.html b/javadoc/org/jgrapht/alg/KShortestPaths.html new file mode 100644 index 0000000..76e5ced --- /dev/null +++ b/javadoc/org/jgrapht/alg/KShortestPaths.html @@ -0,0 +1,322 @@ + + + + + + +public class KShortestPaths<V,E> +extends Object+
The algorithm is a variant of the Bellman-Ford algorithm but instead of + only storing the best path it stores the "k" best paths at each pass, + yielding a complexity of O(k*n*(m^2)) where m is the number of edges and n is + the number of vertices.
| Constructor and Description | +
|---|
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.
+ |
+
public KShortestPaths(Graph<V,E> graph, + V startVertex, + int k)+
graph - startVertex - k - number of paths to be computed.public KShortestPaths(Graph<V,E> graph, + V startVertex, + int nPaths, + int nMaxHops)+
graph - graph on which shortest paths are searched.startVertex - start vertex of the calculated paths.nPaths - number of ranking paths between the start vertex and an end
+ vertex.nMaxHops - maximum number of edges of the calculated paths.NullPointerException - if the specified graph or startVertex is
+ null.IllegalArgumentException - if nPaths is negative or 0.IllegalArgumentException - if nMaxHops is negative or 0.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/KosarajuStrongConnectivityInspector.html b/javadoc/org/jgrapht/alg/KosarajuStrongConnectivityInspector.html new file mode 100644 index 0000000..3953762 --- /dev/null +++ b/javadoc/org/jgrapht/alg/KosarajuStrongConnectivityInspector.html @@ -0,0 +1,363 @@ + + + + + + +public class KosarajuStrongConnectivityInspector<V,E> +extends Object +implements StrongConnectivityAlgorithm<V,E>+
Complements the ConnectivityInspector class with
+ the capability to compute the strongly connected components of a directed
+ graph. The algorithm is implemented after "Cormen et al: Introduction to
+ agorithms", Chapter 22.5. It has a running time of O(V + E).
Unlike ConnectivityInspector, this class does not
+ implement incremental inspection. The full algorithm is executed at the first
+ call of stronglyConnectedSets()
+ or isStronglyConnected().
| Constructor and Description | +
|---|
KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+The constructor of the StrongConnectivityAlgorithm class.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+getGraph()
+Returns the graph inspected by the StrongConnectivityAlgorithm.
+ |
+
boolean |
+isStronglyConnected()
+Returns true if the graph of this
+
+ StronglyConnectivityInspector instance is strongly connected. |
+
List<Set<V>> |
+stronglyConnectedSets()
+
+ |
+
List<DirectedSubgraph<V,E>> |
+stronglyConnectedSubgraphs()
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
public KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)+
directedGraph - the graph to inspectIllegalArgumentExceptionpublic DirectedGraph<V,E> getGraph()+
getGraph in interface StrongConnectivityAlgorithm<V,E>public boolean isStronglyConnected()+
+ StronglyConnectivityInspector instance is strongly connected.isStronglyConnected in interface StrongConnectivityAlgorithm<V,E>public List<Set<V>> stronglyConnectedSets()+
List of Sets, where each set contains vertices
+ which together form a strongly connected component within the given
+ graph.stronglyConnectedSets in interface StrongConnectivityAlgorithm<V,E>List of Set s containing the strongly
+ connected componentspublic List<DirectedSubgraph<V,E>> stronglyConnectedSubgraphs()+
Computes a list of DirectedSubgraphs of the given graph. Each
+ subgraph will represent a strongly connected component and will contain
+ all vertices of that component. The subgraph will have an edge (u,v) iff
+ u and v are contained in the strongly connected component.
NOTE: Calling this method will first execute stronglyConnectedSets(). If you
+ don't need subgraphs, use that method.
stronglyConnectedSubgraphs in interface StrongConnectivityAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/KruskalMinimumSpanningTree.html b/javadoc/org/jgrapht/alg/KruskalMinimumSpanningTree.html new file mode 100644 index 0000000..47565f2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/KruskalMinimumSpanningTree.html @@ -0,0 +1,346 @@ + + + + + + +public class KruskalMinimumSpanningTree<V,E> +extends Object +implements MinimumSpanningTree<V,E>+
| Constructor and Description | +
|---|
KruskalMinimumSpanningTree(Graph<V,E> graph)
+Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getEdgeSet()
+Deprecated.
+ |
+
Set<E> |
+getMinimumSpanningTreeEdgeSet()
+Returns edges set constituting the minimum spanning tree/forest
+ |
+
double |
+getMinimumSpanningTreeTotalWeight()
+Returns total weight of the minimum spanning tree/forest.
+ |
+
double |
+getSpanningTreeCost()
+Deprecated.
+ |
+
public KruskalMinimumSpanningTree(Graph<V,E> graph)+
graph - the graph to be searchedpublic Set<E> getMinimumSpanningTreeEdgeSet()+
MinimumSpanningTreegetMinimumSpanningTreeEdgeSet in interface MinimumSpanningTree<V,E>public double getMinimumSpanningTreeTotalWeight()+
MinimumSpanningTreegetMinimumSpanningTreeTotalWeight in interface MinimumSpanningTree<V,E>@Deprecated +public Set<E> getEdgeSet()+
@Deprecated +public double getSpanningTreeCost()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender.html b/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender.html new file mode 100644 index 0000000..4151fbc --- /dev/null +++ b/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender.html @@ -0,0 +1,235 @@ + + + + + + +protected class KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender +extends Object+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.html b/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.html new file mode 100644 index 0000000..5f3fefd --- /dev/null +++ b/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.html @@ -0,0 +1,297 @@ + + + + + + +protected static class KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E> +extends Object+
| Modifier and Type | +Class and Description | +
|---|---|
protected class |
+KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
+Aggregates utilities to extend matching
+ |
+
| Constructor and Description | +
|---|
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation(WeightedGraph<V,E> G,
+ List<? extends V> S,
+ List<? extends V> T) |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected int[] |
+buildMatching()
+Gets costs-matrix as input and returns assignment of tasks
+ (designated by the columns of cost-matrix) to the workers (designated
+ by the rows of the cost-matrix) so that to MINIMIZE total
+ tasks-tackling costs
+ |
+
protected int[] buildMatching()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.html b/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.html new file mode 100644 index 0000000..06c4ae7 --- /dev/null +++ b/javadoc/org/jgrapht/alg/KuhnMunkresMinimalWeightBipartitePerfectMatching.html @@ -0,0 +1,332 @@ + + + + + + +public class KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> +extends Object +implements WeightedMatchingAlgorithm<V,E>+
Assignment problem could be set as follows: + +
Given + complete bipartite graph G = (S, T; E), such that |S| = |T|, and each + edge has non-negative cost c(i, j), find perfect + matching of minimal cost.
| Modifier and Type | +Class and Description | +
|---|---|
protected static class |
+KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E>
+...
+ |
+
| Constructor and Description | +
|---|
KuhnMunkresMinimalWeightBipartitePerfectMatching(WeightedGraph<V,E> G,
+ List<? extends V> S,
+ List<? extends V> T) |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getMatching()
+Returns set of edges making up the matching
+ |
+
double |
+getMatchingWeight()
+Returns weight of a matching found
+ |
+
public KuhnMunkresMinimalWeightBipartitePerfectMatching(WeightedGraph<V,E> G, + List<? extends V> S, + List<? extends V> T)+
G - target weighted bipartite graph to find matching inS - first vertex partition of the target bipartite graphT - second vertex partition of the target bipartite graphpublic Set<E> getMatching()+
MatchingAlgorithmgetMatching in interface MatchingAlgorithm<V,E>public double getMatchingWeight()+
WeightedMatchingAlgorithmgetMatchingWeight in interface WeightedMatchingAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/MaximumWeightBipartiteMatching.html b/javadoc/org/jgrapht/alg/MaximumWeightBipartiteMatching.html new file mode 100644 index 0000000..b623696 --- /dev/null +++ b/javadoc/org/jgrapht/alg/MaximumWeightBipartiteMatching.html @@ -0,0 +1,313 @@ + + + + + + +public class MaximumWeightBipartiteMatching<V,E> +extends Object +implements WeightedMatchingAlgorithm<V,E>+
| Constructor and Description | +
|---|
MaximumWeightBipartiteMatching(WeightedGraph<V,E> graph,
+ Set<V> vertexPartition1,
+ Set<V> vertexPartition2)
+Creates a new MaximumWeightBipartiteMatching algorithm instance.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getMatching()
+Returns set of edges making up the matching
+ |
+
double |
+getMatchingWeight()
+Returns weight of a matching found
+ |
+
public MaximumWeightBipartiteMatching(WeightedGraph<V,E> graph, + Set<V> vertexPartition1, + Set<V> vertexPartition2)+
graph - simple undirected weighted bipartite graph to find matching
+ in, with positive integer edge weightsvertexPartition1 - first vertex partition of the bipartite graph,
+ disjoint from vertexPartition2vertexPartition2 - second vertex partition of the bipartite graph,
+ disjoint from vertexPartition1public Set<E> getMatching()+
MatchingAlgorithmgetMatching in interface MatchingAlgorithm<V,E>public double getMatchingWeight()+
WeightedMatchingAlgorithmgetMatchingWeight in interface WeightedMatchingAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/MinSourceSinkCut.html b/javadoc/org/jgrapht/alg/MinSourceSinkCut.html new file mode 100644 index 0000000..aef89bf --- /dev/null +++ b/javadoc/org/jgrapht/alg/MinSourceSinkCut.html @@ -0,0 +1,393 @@ + + + + + + +public class MinSourceSinkCut<V,E> +extends Object+
| Constructor and Description | +
|---|
MinSourceSinkCut(DirectedGraph<V,E> graph) |
+
MinSourceSinkCut(DirectedGraph<V,E> graph,
+ double epsilon) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+computeMinCut(V source,
+ V sink)
+Compute a minimum s-t cut
+ |
+
V |
+getCurrentSink()
+Returns the sink of the last call
+ |
+
V |
+getCurrentSource()
+Returns the source of the last call
+ |
+
Set<E> |
+getCutEdges()
+Let S be the set containing the source, and T be the set containing the
+ sink, i.e.
+ |
+
double |
+getCutWeight()
+Get the cut weight.
+ |
+
Set<V> |
+getSinkPartition()
+Returns the min cut partition containing the sink
+ |
+
Set<V> |
+getSourcePartition() |
+
public MinSourceSinkCut(DirectedGraph<V,E> graph)+
public MinSourceSinkCut(DirectedGraph<V,E> graph, + double epsilon)+
public void computeMinCut(V source, + V sink)+
source - sink - public Set<V> getSourcePartition()+
public Set<V> getSinkPartition()+
public double getCutWeight()+
public Set<E> getCutEdges()+
public V getCurrentSource()+
public V getCurrentSink()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/NaiveLcaFinder.html b/javadoc/org/jgrapht/alg/NaiveLcaFinder.html new file mode 100644 index 0000000..12478c2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/NaiveLcaFinder.html @@ -0,0 +1,328 @@ + + + + + + +public class NaiveLcaFinder<V,E> +extends Object+
| Constructor and Description | +
|---|
NaiveLcaFinder(DirectedGraph<V,E> graph)
+Find the Lowest Common Ancestor of a directed graph.
+ |
+
public NaiveLcaFinder(DirectedGraph<V,E> graph)+
Find the LCA, defined as Let G = (V, E) be a DAG, and let x, y ∈ V + . Let G x,y be the subgraph of G induced by the set of all common + ancestors of x and y. Define SLCA (x, y) to be the set of out-degree 0 + nodes (leafs) in G x,y . The lowest common ancestors of x and y are the + elements of SLCA (x, y). This naive algorithm simply starts at a and b, + recursing upwards to the root(s) of the DAG. Wherever the recursion paths + cross we have found our LCA. from + http://www.cs.sunysb.edu/~bender/pub/JALG05-daglca.pdf. The algorithm: + +
+ 1. Start at each of nodes you wish to find the lca for (a and b) + 2. Create sets aSet containing a, and bSet containing b + 3. If either set intersects with the union of the other sets previous values (i.e. the set of notes visited) then + that intersection is LCA. if there are multiple intersections then the earliest one added is the LCA. + 4. Repeat from step 3, with aSet now the parents of everything in aSet, and bSet the parents of everything in bSet + 5. If there are no more parents to descend to then there is no LCA ++ + The rationale for this working is that in each iteration of the loop we + are considering all the ancestors of a that have a path of length n back + to a, where n is the depth of the recursion. The same is true of b. + +
We start by checking if a == b.
+ if not we look to see if there is any intersection between parents(a) and
+ (parents(b) union b) (and the same with a and b swapped)
+ if not we look to see if there is any intersection between
+ parents(parents(a)) and (parents(parents(b)) union parents(b) union b)
+ (and the same with a and b swapped)
+ continues
+
+
This means at the end of recursion n, we know if there is an LCA that + has a path of <=n to a and b. Of course we may have to wait longer if + the path to a is of length n, but the path to b>n. at the first loop + we have a path of 0 length from the nodes we are considering as LCA to + their respective children which we wish to find the LCA for.
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/NeighborIndex.html b/javadoc/org/jgrapht/alg/NeighborIndex.html new file mode 100644 index 0000000..745f6b8 --- /dev/null +++ b/javadoc/org/jgrapht/alg/NeighborIndex.html @@ -0,0 +1,400 @@ + + + + + + +public class NeighborIndex<V,E> +extends Object +implements GraphListener<V,E>+
Graphs, they are re-calculated at each invocation by
+ walking a vertex's incident edges, which becomes inordinately expensive when
+ performed often.
+
+ Edge direction is ignored when evaluating neighbors; to take edge
+ direction into account when indexing neighbors, use DirectedNeighborIndex.
+
+
A vertex's neighbors are cached the first time they are asked for (i.e. + the index is built on demand). The index will only be updated automatically + if it is added to the associated graph as a listener. If it is added as a + listener to a graph other than the one it indexes, results are undefined.
| Constructor and Description | +
|---|
NeighborIndex(Graph<V,E> g)
+Creates a neighbor index for the specified undirected graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+edgeAdded(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been added to the graph.
+ |
+
void |
+edgeRemoved(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been removed from the graph.
+ |
+
List<V> |
+neighborListOf(V v)
+Returns a list of vertices which are adjacent to a specified vertex.
+ |
+
Set<V> |
+neighborsOf(V v)
+Returns the set of vertices which are adjacent to a specified vertex.
+ |
+
void |
+vertexAdded(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been added to the graph.
+ |
+
void |
+vertexRemoved(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been removed from the graph.
+ |
+
public Set<V> neighborsOf(V v)+
v - the vertex whose neighbors are desiredpublic List<V> neighborListOf(V v)+
neighborsOf(Object) unless duplicate neighbors are important.v - the vertex whose neighbors are desiredpublic void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeAdded in interface GraphListener<V,E>e - the edge event.GraphListener.edgeAdded(GraphEdgeChangeEvent)public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeRemoved in interface GraphListener<V,E>e - the edge event.GraphListener.edgeRemoved(GraphEdgeChangeEvent)public void vertexAdded(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexAdded in interface VertexSetListener<V>e - the vertex event.VertexSetListener.vertexAdded(GraphVertexChangeEvent)public void vertexRemoved(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexRemoved in interface VertexSetListener<V>e - the vertex event.VertexSetListener.vertexRemoved(GraphVertexChangeEvent)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/PrimMinimumSpanningTree.html b/javadoc/org/jgrapht/alg/PrimMinimumSpanningTree.html new file mode 100644 index 0000000..7e74a72 --- /dev/null +++ b/javadoc/org/jgrapht/alg/PrimMinimumSpanningTree.html @@ -0,0 +1,301 @@ + + + + + + +public class PrimMinimumSpanningTree<V,E> +extends Object +implements MinimumSpanningTree<V,E>+
| Constructor and Description | +
|---|
PrimMinimumSpanningTree(Graph<V,E> g) |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getMinimumSpanningTreeEdgeSet()
+Returns edges set constituting the minimum spanning tree/forest
+ |
+
double |
+getMinimumSpanningTreeTotalWeight()
+Returns total weight of the minimum spanning tree/forest.
+ |
+
public Set<E> getMinimumSpanningTreeEdgeSet()+
MinimumSpanningTreegetMinimumSpanningTreeEdgeSet in interface MinimumSpanningTree<V,E>public double getMinimumSpanningTreeTotalWeight()+
MinimumSpanningTreegetMinimumSpanningTreeTotalWeight in interface MinimumSpanningTree<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/StoerWagnerMinimumCut.VertexAndWeight.html b/javadoc/org/jgrapht/alg/StoerWagnerMinimumCut.VertexAndWeight.html new file mode 100644 index 0000000..7907fe1 --- /dev/null +++ b/javadoc/org/jgrapht/alg/StoerWagnerMinimumCut.VertexAndWeight.html @@ -0,0 +1,360 @@ + + + + + + +protected class StoerWagnerMinimumCut.VertexAndWeight +extends Object +implements Comparable<StoerWagnerMinimumCut.VertexAndWeight>+
| Modifier and Type | +Field and Description | +
|---|---|
boolean |
+active |
+
Set<V> |
+vertex |
+
Double |
+weight |
+
| Constructor and Description | +
|---|
StoerWagnerMinimumCut.VertexAndWeight(Set<V> v,
+ double w,
+ boolean active) |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+compareTo(StoerWagnerMinimumCut.VertexAndWeight that)
+compareTo that sorts in reverse order because we need extract-max and
+ queue provides extract-min.
+ |
+
String |
+toString() |
+
public Double weight+
public boolean active+
public int compareTo(StoerWagnerMinimumCut.VertexAndWeight that)+
compareTo in interface Comparable<StoerWagnerMinimumCut.VertexAndWeight>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/StoerWagnerMinimumCut.html b/javadoc/org/jgrapht/alg/StoerWagnerMinimumCut.html new file mode 100644 index 0000000..72bd040 --- /dev/null +++ b/javadoc/org/jgrapht/alg/StoerWagnerMinimumCut.html @@ -0,0 +1,412 @@ + + + + + + +public class StoerWagnerMinimumCut<V,E> +extends Object+
| Modifier and Type | +Class and Description | +
|---|---|
protected class |
+StoerWagnerMinimumCut.VertexAndWeight
+Class for weighted vertices
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected Set<V> |
+bestCut |
+
protected double |
+bestCutWeight |
+
| Constructor and Description | +
|---|
StoerWagnerMinimumCut(UndirectedGraph<V,E> graph)
+Will compute the minimum cut in graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected StoerWagnerMinimumCut.VertexAndWeight |
+mergeVertices(Set<V> s,
+ Set<V> t)
+Merges vertex t into vertex s, summing the weights as required.
+ |
+
Set<V> |
+minCut()
+Return a set of vertices on one side of the cut
+ |
+
double |
+minCutWeight()
+Return the weight of the minimum cut
+ |
+
protected void |
+minimumCutPhase(Set<V> a)
+Implements the MinimumCutPhase function of Stoer and Wagner
+ |
+
double |
+vertexWeight(Set<V> v)
+Compute the sum of the weights entering a vertex
+ |
+
public StoerWagnerMinimumCut(UndirectedGraph<V,E> graph)+
graph - graph over which to run algorithmIllegalArgumentException - if a negative weight edge is foundIllegalArgumentException - if graph has less than 2 verticesprotected void minimumCutPhase(Set<V> a)+
public double minCutWeight()+
protected StoerWagnerMinimumCut.VertexAndWeight mergeVertices(Set<V> s, + Set<V> t)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/StrongConnectivityInspector.html b/javadoc/org/jgrapht/alg/StrongConnectivityInspector.html new file mode 100644 index 0000000..8e9615a --- /dev/null +++ b/javadoc/org/jgrapht/alg/StrongConnectivityInspector.html @@ -0,0 +1,376 @@ + + + + + + +KosarajuStrongConnectivityInspector instead.@Deprecated +public class StrongConnectivityInspector<V,E> +extends Object +implements StrongConnectivityAlgorithm<V,E>+
Complements the ConnectivityInspector class with the capability to
+ compute the strongly connected components of a directed graph. The algorithm
+ is implemented after "Cormen et al: Introduction to algorithms", Chapter
+ 22.5. It has a running time of O(V + E).
Unlike ConnectivityInspector, this class does not implement
+ incremental inspection. The full algorithm is executed at the first call of
+ stronglyConnectedSets() or isStronglyConnected().
| Constructor and Description | +
|---|
StrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+Deprecated.
+The constructor of the StrongConnectivityAlgorithm class.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+getGraph()
+Deprecated.
+Returns the graph inspected by the StrongConnectivityAlgorithm.
+ |
+
boolean |
+isStronglyConnected()
+Deprecated.
+Returns true if the graph of this
+
+ StronglyConnectivityInspector instance is strongly connected. |
+
List<Set<V>> |
+stronglyConnectedSets()
+Deprecated.
+
+ |
+
List<DirectedSubgraph<V,E>> |
+stronglyConnectedSubgraphs()
+Deprecated.
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
public StrongConnectivityInspector(DirectedGraph<V,E> directedGraph)+
directedGraph - the graph to inspectIllegalArgumentExceptionpublic DirectedGraph<V,E> getGraph()+
getGraph in interface StrongConnectivityAlgorithm<V,E>public boolean isStronglyConnected()+
+ StronglyConnectivityInspector instance is strongly connected.isStronglyConnected in interface StrongConnectivityAlgorithm<V,E>public List<Set<V>> stronglyConnectedSets()+
List of Sets, where each set contains vertices
+ which together form a strongly connected component within the given
+ graph.stronglyConnectedSets in interface StrongConnectivityAlgorithm<V,E>List of Set s containing the strongly
+ connected componentspublic List<DirectedSubgraph<V,E>> stronglyConnectedSubgraphs()+
Computes a list of DirectedSubgraphs of the given graph. Each
+ subgraph will represent a strongly connected component and will contain
+ all vertices of that component. The subgraph will have an edge (u,v) iff
+ u and v are contained in the strongly connected component.
NOTE: Calling this method will first execute stronglyConnectedSets(). If you don't need
+ subgraphs, use that method.
stronglyConnectedSubgraphs in interface StrongConnectivityAlgorithm<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/TarjanLowestCommonAncestor.LcaRequestResponse.html b/javadoc/org/jgrapht/alg/TarjanLowestCommonAncestor.LcaRequestResponse.html new file mode 100644 index 0000000..aaf66cd --- /dev/null +++ b/javadoc/org/jgrapht/alg/TarjanLowestCommonAncestor.LcaRequestResponse.html @@ -0,0 +1,292 @@ + + + + + + +public static class TarjanLowestCommonAncestor.LcaRequestResponse<V> +extends Object+
| Constructor and Description | +
|---|
TarjanLowestCommonAncestor.LcaRequestResponse(V a,
+ V b) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/TarjanLowestCommonAncestor.html b/javadoc/org/jgrapht/alg/TarjanLowestCommonAncestor.html new file mode 100644 index 0000000..6238771 --- /dev/null +++ b/javadoc/org/jgrapht/alg/TarjanLowestCommonAncestor.html @@ -0,0 +1,320 @@ + + + + + + +public class TarjanLowestCommonAncestor<V,E> +extends Object+
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+TarjanLowestCommonAncestor.LcaRequestResponse<V> |
+
| Constructor and Description | +
|---|
TarjanLowestCommonAncestor(Graph<V,E> g)
+Create an instance with a reference to the graph that we will find LCAs
+ for
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<V> |
+calculate(V start,
+ List<TarjanLowestCommonAncestor.LcaRequestResponse<V>> lrr)
+Calculate the LCMs between a set of pairs (
+a and
+ b) treating start as the root we want to search from,
+ and setting the LCA of each pair in its LCA field |
+
V |
+calculate(V start,
+ V a,
+ V b)
+Calculate the LCM between
+a and b treating
+ start as the root we want to search from. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/TransitiveClosure.html b/javadoc/org/jgrapht/alg/TransitiveClosure.html new file mode 100644 index 0000000..3d0077f --- /dev/null +++ b/javadoc/org/jgrapht/alg/TransitiveClosure.html @@ -0,0 +1,272 @@ + + + + + + +public class TransitiveClosure +extends Object+
| Modifier and Type | +Field and Description | +
|---|---|
static TransitiveClosure |
+INSTANCE
+Singleton instance.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
<V,E> void |
+closeSimpleDirectedGraph(SimpleDirectedGraph<V,E> graph)
+Computes the transitive closure of the given graph.
+ |
+
public static final TransitiveClosure INSTANCE+
public <V,E> void closeSimpleDirectedGraph(SimpleDirectedGraph<V,E> graph)+
graph - - Graph to compute transitive closure for.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/TransitiveReduction.html b/javadoc/org/jgrapht/alg/TransitiveReduction.html new file mode 100644 index 0000000..b291610 --- /dev/null +++ b/javadoc/org/jgrapht/alg/TransitiveReduction.html @@ -0,0 +1,303 @@ + + + + + + +public class TransitiveReduction +extends Object+
This is a port from a python example by Michael Clerx, posted as an answer + to a question about + transitive reduction algorithm pseudocode on Stack Overflow
| Modifier and Type | +Field and Description | +
|---|---|
static TransitiveReduction |
+INSTANCE
+Singleton instance.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
<V,E> void |
+reduce(DirectedGraph<V,E> directedGraph)
+This method will remove all transitive edges from the graph passed as
+ input parameter.
+ |
+
public static final TransitiveReduction INSTANCE+
public <V,E> void reduce(DirectedGraph<V,E> directedGraph)+
You may want to clone the graph before, as transitive edges will be + pitilessly removed.
+ + e.g. + +
+ {
+ @code
+ DirectedGraph<V, T> soonToBePrunedDirectedGraph;
+
+ TransitiveReduction.INSTANCE.reduce(soonToBePrunedDirectedGraph);
+
+ // pruned !
+ }
+ directedGraph - the directed graph that will be reduced transitivelyCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/VertexCovers.html b/javadoc/org/jgrapht/alg/VertexCovers.html new file mode 100644 index 0000000..31e3f36 --- /dev/null +++ b/javadoc/org/jgrapht/alg/VertexCovers.html @@ -0,0 +1,311 @@ + + + + + + +public abstract class VertexCovers +extends Object+
| Constructor and Description | +
|---|
VertexCovers() |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> Set<V> |
+find2ApproximationCover(Graph<V,E> g)
+Finds a 2-approximation for a minimal vertex cover of the specified
+ graph.
+ |
+
static <V,E> Set<V> |
+findGreedyCover(UndirectedGraph<V,E> g)
+Finds a greedy approximation for a minimal vertex cover of a specified
+ graph.
+ |
+
public static <V,E> Set<V> find2ApproximationCover(Graph<V,E> g)+
For more details see Jenny Walter, CMPU-240: Lecture notes for + Language Theory and Computation, Fall 2002, Vassar College, + http://www.cs.vassar.edu/~walter/cs241index/lectures/PDF/approx.pdf. +
g - the graph for which vertex cover approximation is to be found.public static <V,E> Set<V> findGreedyCover(UndirectedGraph<V,E> g)+
The algorithm works on undirected graphs, but can also work on
+ directed graphs when their edge-directions are ignored. To ignore edge
+ directions you can use Graphs.undirectedGraph(Graph)
+ or AsUndirectedGraph.
g - the graph for which vertex cover approximation is to be found.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/AStarShortestPath.html b/javadoc/org/jgrapht/alg/class-use/AStarShortestPath.html new file mode 100644 index 0000000..a066cd7 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/AStarShortestPath.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/AllDirectedPaths.html b/javadoc/org/jgrapht/alg/class-use/AllDirectedPaths.html new file mode 100644 index 0000000..76a38ee --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/AllDirectedPaths.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/BellmanFordShortestPath.html b/javadoc/org/jgrapht/alg/class-use/BellmanFordShortestPath.html new file mode 100644 index 0000000..0351ea3 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/BellmanFordShortestPath.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/BiconnectivityInspector.html b/javadoc/org/jgrapht/alg/class-use/BiconnectivityInspector.html new file mode 100644 index 0000000..c296f03 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/BiconnectivityInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/BlockCutpointGraph.html b/javadoc/org/jgrapht/alg/class-use/BlockCutpointGraph.html new file mode 100644 index 0000000..fc62097 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/BlockCutpointGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/BronKerboschCliqueFinder.html b/javadoc/org/jgrapht/alg/class-use/BronKerboschCliqueFinder.html new file mode 100644 index 0000000..d0f4aab --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/BronKerboschCliqueFinder.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/ChromaticNumber.html b/javadoc/org/jgrapht/alg/class-use/ChromaticNumber.html new file mode 100644 index 0000000..165ed29 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/ChromaticNumber.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/CliqueMinimalSeparatorDecomposition.html b/javadoc/org/jgrapht/alg/class-use/CliqueMinimalSeparatorDecomposition.html new file mode 100644 index 0000000..7f1e34c --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/CliqueMinimalSeparatorDecomposition.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/ConnectivityInspector.html b/javadoc/org/jgrapht/alg/class-use/ConnectivityInspector.html new file mode 100644 index 0000000..b7ef531 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/ConnectivityInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/CycleDetector.html b/javadoc/org/jgrapht/alg/class-use/CycleDetector.html new file mode 100644 index 0000000..b7645f1 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/CycleDetector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/DijkstraShortestPath.html b/javadoc/org/jgrapht/alg/class-use/DijkstraShortestPath.html new file mode 100644 index 0000000..898862d --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/DijkstraShortestPath.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/DirectedNeighborIndex.html b/javadoc/org/jgrapht/alg/class-use/DirectedNeighborIndex.html new file mode 100644 index 0000000..c8d20dd --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/DirectedNeighborIndex.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/EdmondsBlossomShrinking.html b/javadoc/org/jgrapht/alg/class-use/EdmondsBlossomShrinking.html new file mode 100644 index 0000000..1a77e69 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/EdmondsBlossomShrinking.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/EdmondsKarpMaximumFlow.html b/javadoc/org/jgrapht/alg/class-use/EdmondsKarpMaximumFlow.html new file mode 100644 index 0000000..6d53460 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/EdmondsKarpMaximumFlow.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/EulerianCircuit.html b/javadoc/org/jgrapht/alg/class-use/EulerianCircuit.html new file mode 100644 index 0000000..1d3f7d6 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/EulerianCircuit.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/FloydWarshallShortestPaths.html b/javadoc/org/jgrapht/alg/class-use/FloydWarshallShortestPaths.html new file mode 100644 index 0000000..15f2d45 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/FloydWarshallShortestPaths.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/GabowStrongConnectivityInspector.html b/javadoc/org/jgrapht/alg/class-use/GabowStrongConnectivityInspector.html new file mode 100644 index 0000000..980d922 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/GabowStrongConnectivityInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/HamiltonianCycle.html b/javadoc/org/jgrapht/alg/class-use/HamiltonianCycle.html new file mode 100644 index 0000000..865ca41 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/HamiltonianCycle.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/HopcroftKarpBipartiteMatching.html b/javadoc/org/jgrapht/alg/class-use/HopcroftKarpBipartiteMatching.html new file mode 100644 index 0000000..6f0e921 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/HopcroftKarpBipartiteMatching.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/KShortestPaths.html b/javadoc/org/jgrapht/alg/class-use/KShortestPaths.html new file mode 100644 index 0000000..46f2251 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/KShortestPaths.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/KosarajuStrongConnectivityInspector.html b/javadoc/org/jgrapht/alg/class-use/KosarajuStrongConnectivityInspector.html new file mode 100644 index 0000000..b6ac234 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/KosarajuStrongConnectivityInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/KruskalMinimumSpanningTree.html b/javadoc/org/jgrapht/alg/class-use/KruskalMinimumSpanningTree.html new file mode 100644 index 0000000..1d47e5e --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/KruskalMinimumSpanningTree.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender.html b/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender.html new file mode 100644 index 0000000..49d6b90 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.html b/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.html new file mode 100644 index 0000000..773334d --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.html b/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.html new file mode 100644 index 0000000..c87bfb1 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/KuhnMunkresMinimalWeightBipartitePerfectMatching.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/MaximumWeightBipartiteMatching.html b/javadoc/org/jgrapht/alg/class-use/MaximumWeightBipartiteMatching.html new file mode 100644 index 0000000..0f20c92 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/MaximumWeightBipartiteMatching.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/MinSourceSinkCut.html b/javadoc/org/jgrapht/alg/class-use/MinSourceSinkCut.html new file mode 100644 index 0000000..8f60a72 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/MinSourceSinkCut.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/NaiveLcaFinder.html b/javadoc/org/jgrapht/alg/class-use/NaiveLcaFinder.html new file mode 100644 index 0000000..9d23680 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/NaiveLcaFinder.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/NeighborIndex.html b/javadoc/org/jgrapht/alg/class-use/NeighborIndex.html new file mode 100644 index 0000000..b077faf --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/NeighborIndex.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/PrimMinimumSpanningTree.html b/javadoc/org/jgrapht/alg/class-use/PrimMinimumSpanningTree.html new file mode 100644 index 0000000..4921dbf --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/PrimMinimumSpanningTree.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/StoerWagnerMinimumCut.VertexAndWeight.html b/javadoc/org/jgrapht/alg/class-use/StoerWagnerMinimumCut.VertexAndWeight.html new file mode 100644 index 0000000..1f7b9cc --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/StoerWagnerMinimumCut.VertexAndWeight.html @@ -0,0 +1,178 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected StoerWagnerMinimumCut.VertexAndWeight |
+StoerWagnerMinimumCut.mergeVertices(Set<V> s,
+ Set<V> t)
+Merges vertex t into vertex s, summing the weights as required.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+StoerWagnerMinimumCut.VertexAndWeight.compareTo(StoerWagnerMinimumCut.VertexAndWeight that)
+compareTo that sorts in reverse order because we need extract-max and
+ queue provides extract-min.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/StoerWagnerMinimumCut.html b/javadoc/org/jgrapht/alg/class-use/StoerWagnerMinimumCut.html new file mode 100644 index 0000000..a31dff1 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/StoerWagnerMinimumCut.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/StrongConnectivityInspector.html b/javadoc/org/jgrapht/alg/class-use/StrongConnectivityInspector.html new file mode 100644 index 0000000..f0a015e --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/StrongConnectivityInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/TarjanLowestCommonAncestor.LcaRequestResponse.html b/javadoc/org/jgrapht/alg/class-use/TarjanLowestCommonAncestor.LcaRequestResponse.html new file mode 100644 index 0000000..2b7ffe5 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/TarjanLowestCommonAncestor.LcaRequestResponse.html @@ -0,0 +1,164 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<V> |
+TarjanLowestCommonAncestor.calculate(V start,
+ List<TarjanLowestCommonAncestor.LcaRequestResponse<V>> lrr)
+Calculate the LCMs between a set of pairs (
+a and
+ b) treating start as the root we want to search from,
+ and setting the LCA of each pair in its LCA field |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/TarjanLowestCommonAncestor.html b/javadoc/org/jgrapht/alg/class-use/TarjanLowestCommonAncestor.html new file mode 100644 index 0000000..f1a1540 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/TarjanLowestCommonAncestor.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/TransitiveClosure.html b/javadoc/org/jgrapht/alg/class-use/TransitiveClosure.html new file mode 100644 index 0000000..2efc12b --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/TransitiveClosure.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
static TransitiveClosure |
+TransitiveClosure.INSTANCE
+Singleton instance.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/TransitiveReduction.html b/javadoc/org/jgrapht/alg/class-use/TransitiveReduction.html new file mode 100644 index 0000000..ce1f4e9 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/TransitiveReduction.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
static TransitiveReduction |
+TransitiveReduction.INSTANCE
+Singleton instance.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/class-use/VertexCovers.html b/javadoc/org/jgrapht/alg/class-use/VertexCovers.html new file mode 100644 index 0000000..52bc277 --- /dev/null +++ b/javadoc/org/jgrapht/alg/class-use/VertexCovers.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/DirectedSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/DirectedSimpleCycles.html new file mode 100644 index 0000000..3b4531b --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/DirectedSimpleCycles.html @@ -0,0 +1,268 @@ + + + + + + +V - the vertex type.E - the edge type.public interface DirectedSimpleCycles<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findSimpleCycles()
+Finds the simple cycles of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
DirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
void |
+setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
DirectedGraph<V,E> getGraph()+
void setGraph(DirectedGraph<V,E> graph)+
graph - the graph.IllegalArgumentException - if the argument is null.List<List<V>> findSimpleCycles()+
+ null.IllegalArgumentException - if the current graph is null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/HawickJamesSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/HawickJamesSimpleCycles.html new file mode 100644 index 0000000..504cb05 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/HawickJamesSimpleCycles.html @@ -0,0 +1,395 @@ + + + + + + +V - the vertex type.E - the edge type.public class HawickJamesSimpleCycles<V,E> +extends Object +implements DirectedSimpleCycles<V,E>+
See:
+ K. A. Hawick, H. A. James. Enumerating Circuits and Loops in Graphs with
+ Self-Arcs and Multiple-Arcs. Computational Science Technical Note CSTN-013,
+ 2008
| Constructor and Description | +
|---|
HawickJamesSimpleCycles()
+Create a simple cycle finder with an unspecified graph.
+ |
+
HawickJamesSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
long |
+countSimpleCycles()
+Count the number of simple cycles.
+ |
+
List<List<V>> |
+findSimpleCycles()
+Finds the simple cycles of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
DirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
void |
+printSimpleCycles()
+Print to the standard output all simple cycles without building a list to
+ keep them, thus avoiding high memory consumption when investigating large
+ and much connected graphs.
+ |
+
void |
+setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
public HawickJamesSimpleCycles()+
public HawickJamesSimpleCycles(DirectedGraph<V,E> graph) + throws IllegalArgumentException+
graph - the DirectedGraph in which to find cycles.IllegalArgumentException - if the graph argument is
+ null.public DirectedGraph<V,E> getGraph()+
getGraph in interface DirectedSimpleCycles<V,E>public void setGraph(DirectedGraph<V,E> graph) + throws IllegalArgumentException+
setGraph in interface DirectedSimpleCycles<V,E>graph - the graph.IllegalArgumentException - if the argument is null.public List<List<V>> findSimpleCycles() + throws IllegalArgumentException+
findSimpleCycles in interface DirectedSimpleCycles<V,E>
+ null.IllegalArgumentException - if the current graph is null.public void printSimpleCycles()+
public long countSimpleCycles()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/JohnsonSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/JohnsonSimpleCycles.html new file mode 100644 index 0000000..d327a22 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/JohnsonSimpleCycles.html @@ -0,0 +1,349 @@ + + + + + + +V - the vertex type.E - the edge type.public class JohnsonSimpleCycles<V,E> +extends Object +implements DirectedSimpleCycles<V,E>+
See:
+ D.B.Johnson, Finding all the elementary circuits of a directed graph, SIAM J.
+ Comput., 4 (1975), pp. 77-84.
| Constructor and Description | +
|---|
JohnsonSimpleCycles()
+Create a simple cycle finder with an unspecified graph.
+ |
+
JohnsonSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findSimpleCycles()
+Finds the simple cycles of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
DirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
void |
+setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
public JohnsonSimpleCycles()+
public JohnsonSimpleCycles(DirectedGraph<V,E> graph)+
graph - - the DirectedGraph in which to find cycles.IllegalArgumentException - if the graph argument is
+ null.public DirectedGraph<V,E> getGraph()+
getGraph in interface DirectedSimpleCycles<V,E>public void setGraph(DirectedGraph<V,E> graph)+
setGraph in interface DirectedSimpleCycles<V,E>graph - the graph.public List<List<V>> findSimpleCycles()+
findSimpleCycles in interface DirectedSimpleCycles<V,E>
+ null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/PatonCycleBase.html b/javadoc/org/jgrapht/alg/cycle/PatonCycleBase.html new file mode 100644 index 0000000..0ee0c82 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/PatonCycleBase.html @@ -0,0 +1,349 @@ + + + + + + +V - the vertex type.E - the edge type.public class PatonCycleBase<V,E> +extends Object +implements UndirectedCycleBase<V,E>+
See:
+ K. Paton, An algorithm for finding a fundamental set of cycles for an
+ undirected linear graph, Comm. ACM 12 (1969), pp. 514-518.
| Constructor and Description | +
|---|
PatonCycleBase()
+Create a cycle base finder with an unspecified graph.
+ |
+
PatonCycleBase(UndirectedGraph<V,E> graph)
+Create a cycle base finder for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findCycleBase()
+Finds a cycle base of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
UndirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
void |
+setGraph(UndirectedGraph<V,E> graph)
+Sets the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
public PatonCycleBase()+
public PatonCycleBase(UndirectedGraph<V,E> graph)+
graph - - the DirectedGraph in which to find cycles.IllegalArgumentException - if the graph argument is
+ null.public UndirectedGraph<V,E> getGraph()+
getGraph in interface UndirectedCycleBase<V,E>public void setGraph(UndirectedGraph<V,E> graph)+
setGraph in interface UndirectedCycleBase<V,E>graph - the graph.public List<List<V>> findCycleBase()+
findCycleBase in interface UndirectedCycleBase<V,E>null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/SzwarcfiterLauerSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/SzwarcfiterLauerSimpleCycles.html new file mode 100644 index 0000000..21c1833 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/SzwarcfiterLauerSimpleCycles.html @@ -0,0 +1,351 @@ + + + + + + +V - the vertex type.E - the edge type.public class SzwarcfiterLauerSimpleCycles<V,E> +extends Object +implements DirectedSimpleCycles<V,E>+
See:
+ J.L.Szwarcfiter and P.E.Lauer, Finding the elementary cycles of a directed
+ graph in O(n + m) per cycle, Technical Report Series, #60, May 1974, Univ. of
+ Newcastle upon Tyne, Newcastle upon Tyne, England.
| Constructor and Description | +
|---|
SzwarcfiterLauerSimpleCycles()
+Create a simple cycle finder with an unspecified graph.
+ |
+
SzwarcfiterLauerSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findSimpleCycles()
+Finds the simple cycles of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
DirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
void |
+setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
public SzwarcfiterLauerSimpleCycles()+
public SzwarcfiterLauerSimpleCycles(DirectedGraph<V,E> graph)+
graph - - the DirectedGraph in which to find cycles.IllegalArgumentException - if the graph argument is
+ null.public DirectedGraph<V,E> getGraph()+
getGraph in interface DirectedSimpleCycles<V,E>public void setGraph(DirectedGraph<V,E> graph)+
setGraph in interface DirectedSimpleCycles<V,E>graph - the graph.public List<List<V>> findSimpleCycles()+
findSimpleCycles in interface DirectedSimpleCycles<V,E>
+ null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/TarjanSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/TarjanSimpleCycles.html new file mode 100644 index 0000000..f3d5617 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/TarjanSimpleCycles.html @@ -0,0 +1,349 @@ + + + + + + +V - the vertex type.E - the edge type.public class TarjanSimpleCycles<V,E> +extends Object +implements DirectedSimpleCycles<V,E>+
See:
+ R. Tarjan, Enumeration of the elementary circuits of a directed graph, SIAM
+ J. Comput., 2 (1973), pp. 211-216.
| Constructor and Description | +
|---|
TarjanSimpleCycles()
+Create a simple cycle finder with an unspecified graph.
+ |
+
TarjanSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findSimpleCycles()
+Finds the simple cycles of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
DirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
void |
+setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
public TarjanSimpleCycles()+
public TarjanSimpleCycles(DirectedGraph<V,E> graph)+
graph - - the DirectedGraph in which to find cycles.IllegalArgumentException - if the graph argument is
+ null.public DirectedGraph<V,E> getGraph()+
getGraph in interface DirectedSimpleCycles<V,E>public void setGraph(DirectedGraph<V,E> graph)+
setGraph in interface DirectedSimpleCycles<V,E>graph - the graph.public List<List<V>> findSimpleCycles()+
findSimpleCycles in interface DirectedSimpleCycles<V,E>
+ null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/TiernanSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/TiernanSimpleCycles.html new file mode 100644 index 0000000..bf8f17e --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/TiernanSimpleCycles.html @@ -0,0 +1,349 @@ + + + + + + +V - the vertex type.E - the edge type.public class TiernanSimpleCycles<V,E> +extends Object +implements DirectedSimpleCycles<V,E>+
See:
+ J.C.Tiernan An Efficient Search Algorithm Find the Elementary Circuits of a
+ Graph., Communications of the ACM, vol.13, 12, (1970), pp. 722 - 726.
| Constructor and Description | +
|---|
TiernanSimpleCycles()
+Create a simple cycle finder with an unspecified graph.
+ |
+
TiernanSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findSimpleCycles()
+Finds the simple cycles of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
DirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
void |
+setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
public TiernanSimpleCycles()+
public TiernanSimpleCycles(DirectedGraph<V,E> graph)+
graph - - the DirectedGraph in which to find cycles.IllegalArgumentException - if the graph argument is
+ null.public DirectedGraph<V,E> getGraph()+
getGraph in interface DirectedSimpleCycles<V,E>public void setGraph(DirectedGraph<V,E> graph)+
setGraph in interface DirectedSimpleCycles<V,E>graph - the graph.public List<List<V>> findSimpleCycles()+
findSimpleCycles in interface DirectedSimpleCycles<V,E>
+ null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/UndirectedCycleBase.html b/javadoc/org/jgrapht/alg/cycle/UndirectedCycleBase.html new file mode 100644 index 0000000..f9597ee --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/UndirectedCycleBase.html @@ -0,0 +1,268 @@ + + + + + + +V - the vertex type.E - the edge type.public interface UndirectedCycleBase<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
List<List<V>> |
+findCycleBase()
+Finds a cycle base of the graph.
++ Note that the full algorithm is executed on every call since the graph + may have changed between calls. |
+
UndirectedGraph<V,E> |
+getGraph()
+Returns the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
void |
+setGraph(UndirectedGraph<V,E> graph)
+Sets the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
UndirectedGraph<V,E> getGraph()+
void setGraph(UndirectedGraph<V,E> graph)+
graph - the graph.IllegalArgumentException - if the argument is null.List<List<V>> findCycleBase()+
null.IllegalArgumentException - if the current graph is null.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/DirectedSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/class-use/DirectedSimpleCycles.html new file mode 100644 index 0000000..831e66f --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/DirectedSimpleCycles.html @@ -0,0 +1,187 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+HawickJamesSimpleCycles<V,E>
+Find all simple cycles of a directed graph using the algorithm described by
+ Hawick and James.
+ |
+
class |
+JohnsonSimpleCycles<V,E>
+Find all simple cycles of a directed graph using the Johnson's algorithm.
+ |
+
class |
+SzwarcfiterLauerSimpleCycles<V,E>
+Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's
+ algorithm.
+ |
+
class |
+TarjanSimpleCycles<V,E>
+Find all simple cycles of a directed graph using the Tarjan's algorithm.
+ |
+
class |
+TiernanSimpleCycles<V,E>
+Find all simple cycles of a directed graph using the Tiernan's algorithm.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/HawickJamesSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/class-use/HawickJamesSimpleCycles.html new file mode 100644 index 0000000..59a1d57 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/HawickJamesSimpleCycles.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/JohnsonSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/class-use/JohnsonSimpleCycles.html new file mode 100644 index 0000000..4bf2c87 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/JohnsonSimpleCycles.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/PatonCycleBase.html b/javadoc/org/jgrapht/alg/cycle/class-use/PatonCycleBase.html new file mode 100644 index 0000000..64d83a8 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/PatonCycleBase.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/SzwarcfiterLauerSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/class-use/SzwarcfiterLauerSimpleCycles.html new file mode 100644 index 0000000..e757ae0 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/SzwarcfiterLauerSimpleCycles.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/TarjanSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/class-use/TarjanSimpleCycles.html new file mode 100644 index 0000000..fbf69e0 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/TarjanSimpleCycles.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/TiernanSimpleCycles.html b/javadoc/org/jgrapht/alg/cycle/class-use/TiernanSimpleCycles.html new file mode 100644 index 0000000..10fba52 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/TiernanSimpleCycles.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/class-use/UndirectedCycleBase.html b/javadoc/org/jgrapht/alg/cycle/class-use/UndirectedCycleBase.html new file mode 100644 index 0000000..b4f7132 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/class-use/UndirectedCycleBase.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+PatonCycleBase<V,E>
+Find a cycle base of an undirected graph using the Paton's algorithm.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/package-frame.html b/javadoc/org/jgrapht/alg/cycle/package-frame.html new file mode 100644 index 0000000..5dc7095 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/package-frame.html @@ -0,0 +1,30 @@ + + + + + + +See: Description
+| Interface | +Description | +
|---|---|
| DirectedSimpleCycles<V,E> | +
+ A common interface for classes implementing algorithms for enumeration of the
+ simple cycles of a directed graph.
+ |
+
| UndirectedCycleBase<V,E> | +
+ A common interface for classes implementing algorithms for finding a cycle
+ base of an undirected graph.
+ |
+
| Class | +Description | +
|---|---|
| HawickJamesSimpleCycles<V,E> | +
+ Find all simple cycles of a directed graph using the algorithm described by
+ Hawick and James.
+ |
+
| JohnsonSimpleCycles<V,E> | +
+ Find all simple cycles of a directed graph using the Johnson's algorithm.
+ |
+
| PatonCycleBase<V,E> | +
+ Find a cycle base of an undirected graph using the Paton's algorithm.
+ |
+
| SzwarcfiterLauerSimpleCycles<V,E> | +
+ Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's
+ algorithm.
+ |
+
| TarjanSimpleCycles<V,E> | +
+ Find all simple cycles of a directed graph using the Tarjan's algorithm.
+ |
+
| TiernanSimpleCycles<V,E> | +
+ Find all simple cycles of a directed graph using the Tiernan's algorithm.
+ |
+
Algorithms for enumeration of simple cycles in graphs.
+ + Implementation Note:All the implementations work correctly + with loops but not with multiple duplicate edges. +
+ Performance Notes: +The worst case time complexity of + the algorithms for finding cycles in directed graphs is: +
The worst case performance is + achieved for graphs with special structure, so on practical + workloads an algorithm with higher worst case complexity may + outperform an algorithm with lower worst case complexity. Note + also that "administrative costs" of algorithms with better worst + case performance are higher. Also higher is their memory cost + (which is in all cases O(V+E)).
+The package author's workloads + contain typically several hundred nodes and from tens to several + thousand simple cycles. On these workloads the algorithms score + by performance (best to worst ) so : +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/package-tree.html b/javadoc/org/jgrapht/alg/cycle/package-tree.html new file mode 100644 index 0000000..80dfb05 --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/package-tree.html @@ -0,0 +1,140 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/cycle/package-use.html b/javadoc/org/jgrapht/alg/cycle/package-use.html new file mode 100644 index 0000000..e1ddd5a --- /dev/null +++ b/javadoc/org/jgrapht/alg/cycle/package-use.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| Class and Description | +
|---|
| DirectedSimpleCycles
+ A common interface for classes implementing algorithms for enumeration of the
+ simple cycles of a directed graph.
+ |
+
| UndirectedCycleBase
+ A common interface for classes implementing algorithms for finding a cycle
+ base of an undirected graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/EdmondsKarpMaximumFlow.html b/javadoc/org/jgrapht/alg/flow/EdmondsKarpMaximumFlow.html new file mode 100644 index 0000000..e26f299 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/EdmondsKarpMaximumFlow.html @@ -0,0 +1,434 @@ + + + + + + +public final class EdmondsKarpMaximumFlow<V,E> +extends MaximumFlowAlgorithmBase<V,E>+
This class computes maximum flow in a network using Edmonds-Karp + algorithm. Be careful: for large networks this algorithm may consume + significant amount of time (its upper-bound complexity is O(VE^2), where V - + amount of vertices, E - amount of edges in the network). + +
For more details see Andrew V. Goldberg's Combinatorial Optimization + (Lecture Notes).
MaximumFlowAlgorithm.MaximumFlow<V,E>, MaximumFlowAlgorithm.MaximumFlowImpl<V,E>DEFAULT_EPSILON| Constructor and Description | +
|---|
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network,
+ double epsilon)
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+buildMaximumFlow(V source,
+ V sink)
+Sets current source to source, current sink to sink,
+ then calculates maximum flow from source to sink.
+ |
+
protected org.jgrapht.alg.flow.EdmondsKarpMaximumFlow.EdgeExtension |
+extendedEdge(E e) |
+
protected org.jgrapht.alg.flow.EdmondsKarpMaximumFlow.VertexExtension |
+extendedVertex(V v) |
+
V |
+getCurrentSink()
+Returns current sink vertex, or null if there was no
+ calculateMaximumFlow calls.
+ |
+
V |
+getCurrentSource()
+Returns current source vertex, or null if there was no
+ calculateMaximumFlow calls.
+ |
+
compareFlowTo, composeFlow, edgeExtended, pushFlowThrough, vertexExtendedpublic EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)+
network - network, where maximum flow will be calculatedpublic EdmondsKarpMaximumFlow(DirectedGraph<V,E> network, + double epsilon)+
network - network, where maximum flow will be calculatedepsilon - tolerance for comparing doublespublic MaximumFlowAlgorithm.MaximumFlow<V,E> buildMaximumFlow(V source, + V sink)+
source - source vertexsink - sink vertexprotected org.jgrapht.alg.flow.EdmondsKarpMaximumFlow.VertexExtension extendedVertex(V v)+
protected org.jgrapht.alg.flow.EdmondsKarpMaximumFlow.EdgeExtension extendedEdge(E e)+
public V getCurrentSource()+
public V getCurrentSink()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/MaximumFlowAlgorithmBase.html b/javadoc/org/jgrapht/alg/flow/MaximumFlowAlgorithmBase.html new file mode 100644 index 0000000..b27f83c --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/MaximumFlowAlgorithmBase.html @@ -0,0 +1,396 @@ + + + + + + +V - vertex concept typeE - edge concept typepublic abstract class MaximumFlowAlgorithmBase<V,E> +extends Object +implements MaximumFlowAlgorithm<V,E>+
MaximumFlowAlgorithm.MaximumFlow<V,E>, MaximumFlowAlgorithm.MaximumFlowImpl<V,E>| Modifier and Type | +Field and Description | +
|---|---|
static double |
+DEFAULT_EPSILON
+Default tolerance.
+ |
+
| Constructor and Description | +
|---|
MaximumFlowAlgorithmBase() |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected int |
+compareFlowTo(double flow,
+ double val) |
+
protected Map<E,Double> |
+composeFlow() |
+
protected <EE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase> |
+edgeExtended(E e) |
+
protected void |
+pushFlowThrough(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase ex,
+ double f) |
+
protected <VE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase> |
+vertexExtended(V v) |
+
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitbuildMaximumFlowpublic static final double DEFAULT_EPSILON+
public MaximumFlowAlgorithmBase()+
protected <VE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase> VE vertexExtended(V v)+
protected <EE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase> EE edgeExtended(E e)+
protected void pushFlowThrough(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase ex, + double f)+
protected int compareFlowTo(double flow, + double val)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.EdgeExtension.html b/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.EdgeExtension.html new file mode 100644 index 0000000..2cd89c7 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.EdgeExtension.html @@ -0,0 +1,349 @@ + + + + + + +public class PushRelabelMaximumFlow.EdgeExtension +extends Extension.BaseExtension+
| Constructor and Description | +
|---|
PushRelabelMaximumFlow.EdgeExtension() |
+
| Modifier and Type | +Method and Description | +
|---|---|
<EE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase> |
+getInverse() |
+
<VE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase> |
+getSource() |
+
<VE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase> |
+getTarget() |
+
void |
+setInverse(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase inverse) |
+
void |
+setSource(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase source) |
+
void |
+setTarget(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase target) |
+
String |
+toString() |
+
public PushRelabelMaximumFlow.EdgeExtension()+
public <VE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase> VE getSource()+
public void setSource(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase source)+
public <VE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase> VE getTarget()+
public void setTarget(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase target)+
public <EE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase> EE getInverse()+
public void setInverse(org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase inverse)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.VertexExtension.html b/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.VertexExtension.html new file mode 100644 index 0000000..037e67c --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.VertexExtension.html @@ -0,0 +1,284 @@ + + + + + + +public class PushRelabelMaximumFlow.VertexExtension +extends Extension.BaseExtension+
| Constructor and Description | +
|---|
PushRelabelMaximumFlow.VertexExtension() |
+
| Modifier and Type | +Method and Description | +
|---|---|
<EE extends org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.EdgeExtensionBase> |
+getOutgoing() |
+
String |
+toString() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.html b/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.html new file mode 100644 index 0000000..cdee32b --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/PushRelabelMaximumFlow.html @@ -0,0 +1,372 @@ + + + + + + +public class PushRelabelMaximumFlow<V,E> +extends MaximumFlowAlgorithmBase<V,E>+
+ Push-relabel maximum flow algorithm designed by Andrew V. Goldberg and + Robert Tarjan. Current implementation complexity upper-bound is O(V^3). For + more details see: "A new approach to the maximum flow problem" by + Andrew V. Goldberg and Robert Tarjan STOC '86: Proceedings of the + eighteenth annual ACM symposium on Theory of computing
| Modifier and Type | +Class and Description | +
|---|---|
class |
+PushRelabelMaximumFlow.EdgeExtension |
+
class |
+PushRelabelMaximumFlow.VertexExtension |
+
MaximumFlowAlgorithm.MaximumFlow<V,E>, MaximumFlowAlgorithm.MaximumFlowImpl<V,E>DEFAULT_EPSILON| Constructor and Description | +
|---|
PushRelabelMaximumFlow(DirectedGraph<V,E> network) |
+
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+buildMaximumFlow(V source,
+ V sink)
+Builds maximum flow for the supplied network flow, for the supplied
+ ${source} and ${sink}
+ |
+
void |
+initialize(PushRelabelMaximumFlow.VertexExtension source,
+ PushRelabelMaximumFlow.VertexExtension sink,
+ Queue<PushRelabelMaximumFlow.VertexExtension> active) |
+
protected void |
+pushFlowThrough(PushRelabelMaximumFlow.EdgeExtension ex,
+ double f) |
+
compareFlowTo, composeFlow, edgeExtended, pushFlowThrough, vertexExtendedpublic PushRelabelMaximumFlow(DirectedGraph<V,E> network)+
public void initialize(PushRelabelMaximumFlow.VertexExtension source, + PushRelabelMaximumFlow.VertexExtension sink, + Queue<PushRelabelMaximumFlow.VertexExtension> active)+
public MaximumFlowAlgorithm.MaximumFlow<V,E> buildMaximumFlow(V source, + V sink)+
MaximumFlowAlgorithmsource - source of the flow inside the networksink - sink of the flow inside the networkprotected void pushFlowThrough(PushRelabelMaximumFlow.EdgeExtension ex, + double f)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/class-use/EdmondsKarpMaximumFlow.html b/javadoc/org/jgrapht/alg/flow/class-use/EdmondsKarpMaximumFlow.html new file mode 100644 index 0000000..770d6e3 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/class-use/EdmondsKarpMaximumFlow.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/class-use/MaximumFlowAlgorithmBase.html b/javadoc/org/jgrapht/alg/flow/class-use/MaximumFlowAlgorithmBase.html new file mode 100644 index 0000000..b624f34 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/class-use/MaximumFlowAlgorithmBase.html @@ -0,0 +1,168 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.flow | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+EdmondsKarpMaximumFlow<V,E>
+A flow network is a
+ directed graph where each edge has a capacity and each edge receives a flow.
+ |
+
class |
+PushRelabelMaximumFlow<V,E>
+
+ Push-relabel maximum flow algorithm designed by Andrew V.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.EdgeExtension.html b/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.EdgeExtension.html new file mode 100644 index 0000000..252579a --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.EdgeExtension.html @@ -0,0 +1,158 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.flow | ++ |
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+PushRelabelMaximumFlow.pushFlowThrough(PushRelabelMaximumFlow.EdgeExtension ex,
+ double f) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.VertexExtension.html b/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.VertexExtension.html new file mode 100644 index 0000000..553ff16 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.VertexExtension.html @@ -0,0 +1,180 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.flow | ++ |
| Modifier and Type | +Method and Description | +
|---|---|
void |
+PushRelabelMaximumFlow.initialize(PushRelabelMaximumFlow.VertexExtension source,
+ PushRelabelMaximumFlow.VertexExtension sink,
+ Queue<PushRelabelMaximumFlow.VertexExtension> active) |
+
void |
+PushRelabelMaximumFlow.initialize(PushRelabelMaximumFlow.VertexExtension source,
+ PushRelabelMaximumFlow.VertexExtension sink,
+ Queue<PushRelabelMaximumFlow.VertexExtension> active) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+PushRelabelMaximumFlow.initialize(PushRelabelMaximumFlow.VertexExtension source,
+ PushRelabelMaximumFlow.VertexExtension sink,
+ Queue<PushRelabelMaximumFlow.VertexExtension> active) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.html b/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.html new file mode 100644 index 0000000..fde3d07 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/class-use/PushRelabelMaximumFlow.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/package-frame.html b/javadoc/org/jgrapht/alg/flow/package-frame.html new file mode 100644 index 0000000..f0db02c --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/package-frame.html @@ -0,0 +1,22 @@ + + + + + + +| Class | +Description | +
|---|---|
| EdmondsKarpMaximumFlow<V,E> | +
+ A flow network is a
+ directed graph where each edge has a capacity and each edge receives a flow.
+ |
+
| MaximumFlowAlgorithmBase<V,E> | +
+ Base class backing algorithms allowing to derive maximum-flow
+ from the supplied flow
+ network
+ |
+
| PushRelabelMaximumFlow<V,E> | +
+
+ Push-relabel maximum flow algorithm designed by Andrew V.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/package-tree.html b/javadoc/org/jgrapht/alg/flow/package-tree.html new file mode 100644 index 0000000..67a55f0 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/package-tree.html @@ -0,0 +1,141 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/flow/package-use.html b/javadoc/org/jgrapht/alg/flow/package-use.html new file mode 100644 index 0000000..3c506c4 --- /dev/null +++ b/javadoc/org/jgrapht/alg/flow/package-use.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.flow | ++ |
| Class and Description | +
|---|
| MaximumFlowAlgorithmBase
+ Base class backing algorithms allowing to derive maximum-flow
+ from the supplied flow
+ network
+ |
+
| PushRelabelMaximumFlow.EdgeExtension | +
| PushRelabelMaximumFlow.VertexExtension | +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/AStarAdmissibleHeuristic.html b/javadoc/org/jgrapht/alg/interfaces/AStarAdmissibleHeuristic.html new file mode 100644 index 0000000..394b1b9 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/AStarAdmissibleHeuristic.html @@ -0,0 +1,222 @@ + + + + + + +V - vertex typepublic interface AStarAdmissibleHeuristic<V>
+| Modifier and Type | +Method and Description | +
|---|---|
double |
+getCostEstimate(V sourceVertex,
+ V targetVertex)
+An admissible "heuristic estimate" of the distance from x, the
+ sourceVertex, to the goal (usually denoted h(x)).
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/MatchingAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/MatchingAlgorithm.html new file mode 100644 index 0000000..9db75e7 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/MatchingAlgorithm.html @@ -0,0 +1,223 @@ + + + + + + +V - vertex concept typeE - edge concept typepublic interface MatchingAlgorithm<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getMatching()
+Returns set of edges making up the matching
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.MaximumFlow.html b/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.MaximumFlow.html new file mode 100644 index 0000000..aed09fb --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.MaximumFlow.html @@ -0,0 +1,237 @@ + + + + + + +public static interface MaximumFlowAlgorithm.MaximumFlow<V,E>
+Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.MaximumFlowImpl.html b/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.MaximumFlowImpl.html new file mode 100644 index 0000000..215849d --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.MaximumFlowImpl.html @@ -0,0 +1,298 @@ + + + + + + +public static class MaximumFlowAlgorithm.MaximumFlowImpl<V,E> +extends Object +implements MaximumFlowAlgorithm.MaximumFlow+
| Constructor and Description | +
|---|
MaximumFlowAlgorithm.MaximumFlowImpl(Double value,
+ Map<E,Double> flow) |
+
public Double getValue()+
MaximumFlowAlgorithm.MaximumFlowgetValue in interface MaximumFlowAlgorithm.MaximumFlowpublic Map<E,Double> getFlow()+
MaximumFlowAlgorithm.MaximumFlowgetFlow in interface MaximumFlowAlgorithm.MaximumFlowCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.html new file mode 100644 index 0000000..ecf169d --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/MaximumFlowAlgorithm.html @@ -0,0 +1,251 @@ + + + + + + +V - vertex concept typeE - edge concept typepublic interface MaximumFlowAlgorithm<V,E>
+| Modifier and Type | +Interface and Description | +
|---|---|
static interface |
+MaximumFlowAlgorithm.MaximumFlow<V,E> |
+
static class |
+MaximumFlowAlgorithm.MaximumFlowImpl<V,E> |
+
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+buildMaximumFlow(V source,
+ V sink)
+Builds maximum flow for the supplied network flow, for the supplied
+ ${source} and ${sink}
+ |
+
MaximumFlowAlgorithm.MaximumFlow<V,E> buildMaximumFlow(V source, + V sink)+
source - source of the flow inside the networksink - sink of the flow inside the networkCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/MinimumSpanningTree.html b/javadoc/org/jgrapht/alg/interfaces/MinimumSpanningTree.html new file mode 100644 index 0000000..a301133 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/MinimumSpanningTree.html @@ -0,0 +1,237 @@ + + + + + + +V - vertex concept typeE - edge concept typepublic interface MinimumSpanningTree<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+getMinimumSpanningTreeEdgeSet()
+Returns edges set constituting the minimum spanning tree/forest
+ |
+
double |
+getMinimumSpanningTreeTotalWeight()
+Returns total weight of the minimum spanning tree/forest.
+ |
+
Set<E> getMinimumSpanningTreeEdgeSet()+
double getMinimumSpanningTreeTotalWeight()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/StrongConnectivityAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/StrongConnectivityAlgorithm.html new file mode 100644 index 0000000..cb7c832 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/StrongConnectivityAlgorithm.html @@ -0,0 +1,285 @@ + + + + + + +V - vertex concept typeE - edge concept typepublic interface StrongConnectivityAlgorithm<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+getGraph()
+Returns the graph inspected by the StrongConnectivityAlgorithm.
+ |
+
boolean |
+isStronglyConnected()
+Returns true if the graph of this
+
+ StrongConnectivityAlgorithm instance is strongly connected. |
+
List<Set<V>> |
+stronglyConnectedSets()
+
+ |
+
List<DirectedSubgraph<V,E>> |
+stronglyConnectedSubgraphs()
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
DirectedGraph<V,E> getGraph()+
boolean isStronglyConnected()+
+ StrongConnectivityAlgorithm instance is strongly connected.List<Set<V>> stronglyConnectedSets()+
List of Sets, where each set contains vertices
+ which together form a strongly connected component within the given
+ graph.List of Set s containing the strongly
+ connected componentsList<DirectedSubgraph<V,E>> stronglyConnectedSubgraphs()+
Computes a list of DirectedSubgraphs of the given graph. Each
+ subgraph will represent a strongly connected component and will contain
+ all vertices of that component. The subgraph will have an edge (u,v) iff
+ u and v are contained in the strongly connected component.
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/WeightedMatchingAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/WeightedMatchingAlgorithm.html new file mode 100644 index 0000000..28b64c5 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/WeightedMatchingAlgorithm.html @@ -0,0 +1,231 @@ + + + + + + +V - E - public interface WeightedMatchingAlgorithm<V,E> +extends MatchingAlgorithm<V,E>+
MatchingAlgorithm| Modifier and Type | +Method and Description | +
|---|---|
double |
+getMatchingWeight()
+Returns weight of a matching found
+ |
+
getMatchingCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/AStarAdmissibleHeuristic.html b/javadoc/org/jgrapht/alg/interfaces/class-use/AStarAdmissibleHeuristic.html new file mode 100644 index 0000000..2160d09 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/AStarAdmissibleHeuristic.html @@ -0,0 +1,177 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected AStarAdmissibleHeuristic<V> |
+AStarShortestPath.admissibleHeuristic |
+
| Modifier and Type | +Method and Description | +
|---|---|
GraphPath<V,E> |
+AStarShortestPath.getShortestPath(V sourceVertex,
+ V targetVertex,
+ AStarAdmissibleHeuristic<V> admissibleHeuristic)
+Calculates (and returns) the shortest path from the sourceVertex to the
+ targetVertex.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/MatchingAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/class-use/MatchingAlgorithm.html new file mode 100644 index 0000000..0c2ecb3 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/MatchingAlgorithm.html @@ -0,0 +1,209 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.interfaces | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+EdmondsBlossomShrinking<V,E>
+An implementation of Edmonds Blossom Shrinking algorithm for constructing
+ maximum matchings on graphs.
+ |
+
class |
+HopcroftKarpBipartiteMatching<V,E>
+This class is an implementation of the Hopcroft-Karp algorithm which finds a
+ maximum matching in an undirected simple bipartite graph.
+ |
+
class |
+KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E>
+Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres)
+ solving assignment problem also known as hungarian algorithm
+ (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
+ |
+
class |
+MaximumWeightBipartiteMatching<V,E>
+This class finds a maximum weight matching of a simple undirected weighted
+ bipartite graph.
+ |
+
| Modifier and Type | +Interface and Description | +
|---|---|
interface |
+WeightedMatchingAlgorithm<V,E>
+Allows to derive weighted matching from general graph
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.MaximumFlow.html b/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.MaximumFlow.html new file mode 100644 index 0000000..84f5357 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.MaximumFlow.html @@ -0,0 +1,232 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.flow | ++ |
| org.jgrapht.alg.interfaces | ++ |
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+EdmondsKarpMaximumFlow.buildMaximumFlow(V source,
+ V sink)
+Deprecated.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+EdmondsKarpMaximumFlow.buildMaximumFlow(V source,
+ V sink)
+Sets current source to source, current sink to sink,
+ then calculates maximum flow from source to sink.
+ |
+
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+PushRelabelMaximumFlow.buildMaximumFlow(V source,
+ V sink) |
+
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+MaximumFlowAlgorithm.MaximumFlowImpl<V,E> |
+
| Modifier and Type | +Method and Description | +
|---|---|
MaximumFlowAlgorithm.MaximumFlow<V,E> |
+MaximumFlowAlgorithm.buildMaximumFlow(V source,
+ V sink)
+Builds maximum flow for the supplied network flow, for the supplied
+ ${source} and ${sink}
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.MaximumFlowImpl.html b/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.MaximumFlowImpl.html new file mode 100644 index 0000000..08d1cc5 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.MaximumFlowImpl.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.html new file mode 100644 index 0000000..37d6502 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/MaximumFlowAlgorithm.html @@ -0,0 +1,198 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.flow | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+EdmondsKarpMaximumFlow<V,E>
+Deprecated.
+
+Use
+EdmondsKarpMaximumFlow instead |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+MaximumFlowAlgorithmBase<V,E>
+Base class backing algorithms allowing to derive maximum-flow
+ from the supplied flow
+ network
+ |
+
class |
+PushRelabelMaximumFlow<V,E>
+
+ Push-relabel maximum flow algorithm designed by Andrew V.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/MinimumSpanningTree.html b/javadoc/org/jgrapht/alg/interfaces/class-use/MinimumSpanningTree.html new file mode 100644 index 0000000..4abebd2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/MinimumSpanningTree.html @@ -0,0 +1,171 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+KruskalMinimumSpanningTree<V,E>
+An implementation of Kruskal's minimum
+ spanning tree algorithm.
+ |
+
class |
+PrimMinimumSpanningTree<V,E>
+An implementation of
+ Prim's algorithm that finds a minimum spanning tree/forest subject to
+ connectivity of the supplied weighted undirected graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/StrongConnectivityAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/class-use/StrongConnectivityAlgorithm.html new file mode 100644 index 0000000..83dcefd --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/StrongConnectivityAlgorithm.html @@ -0,0 +1,177 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GabowStrongConnectivityInspector<V,E>
+Allows obtaining the strongly connected components of a directed graph.
+ |
+
class |
+KosarajuStrongConnectivityInspector<V,E>
+Complements the
+ConnectivityInspector class with
+ the capability to compute the strongly connected components of a directed
+ graph. |
+
class |
+StrongConnectivityInspector<V,E>
+Deprecated.
+
+Use
+KosarajuStrongConnectivityInspector instead. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/class-use/WeightedMatchingAlgorithm.html b/javadoc/org/jgrapht/alg/interfaces/class-use/WeightedMatchingAlgorithm.html new file mode 100644 index 0000000..6497121 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/class-use/WeightedMatchingAlgorithm.html @@ -0,0 +1,171 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E>
+Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres)
+ solving assignment problem also known as hungarian algorithm
+ (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
+ |
+
class |
+MaximumWeightBipartiteMatching<V,E>
+This class finds a maximum weight matching of a simple undirected weighted
+ bipartite graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/package-frame.html b/javadoc/org/jgrapht/alg/interfaces/package-frame.html new file mode 100644 index 0000000..6a3f71c --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/package-frame.html @@ -0,0 +1,30 @@ + + + + + + +| Interface | +Description | +
|---|---|
| AStarAdmissibleHeuristic<V> | +
+ Interface for an admissible heuristic used in A* search.
+ |
+
| MatchingAlgorithm<V,E> | +
+ Allows to derive matching from
+ given graph
+ |
+
| MaximumFlowAlgorithm<V,E> | +
+ Allows to derive maximum-flow
+ from the supplied flow
+ network
+ |
+
| MaximumFlowAlgorithm.MaximumFlow<V,E> | ++ |
| MinimumSpanningTree<V,E> | +
+ Allows to derive
+ minimum spanning tree from given undirected connected graph.
+ |
+
| StrongConnectivityAlgorithm<V,E> | +
+ An interface to the StrongConnectivityInspector algorithm classes.
+ |
+
| WeightedMatchingAlgorithm<V,E> | +
+ Allows to derive weighted matching from general graph
+ |
+
| Class | +Description | +
|---|---|
| MaximumFlowAlgorithm.MaximumFlowImpl<V,E> | ++ |
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/package-tree.html b/javadoc/org/jgrapht/alg/interfaces/package-tree.html new file mode 100644 index 0000000..ff757e2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/package-tree.html @@ -0,0 +1,143 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/interfaces/package-use.html b/javadoc/org/jgrapht/alg/interfaces/package-use.html new file mode 100644 index 0000000..a15f39d --- /dev/null +++ b/javadoc/org/jgrapht/alg/interfaces/package-use.html @@ -0,0 +1,241 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.flow | ++ |
| org.jgrapht.alg.interfaces | ++ |
| Class and Description | +
|---|
| AStarAdmissibleHeuristic
+ Interface for an admissible heuristic used in A* search.
+ |
+
| MatchingAlgorithm
+ Allows to derive matching from
+ given graph
+ |
+
| MaximumFlowAlgorithm
+ Allows to derive maximum-flow
+ from the supplied flow
+ network
+ |
+
| MaximumFlowAlgorithm.MaximumFlow | +
| MinimumSpanningTree
+ Allows to derive
+ minimum spanning tree from given undirected connected graph.
+ |
+
| StrongConnectivityAlgorithm
+ An interface to the StrongConnectivityInspector algorithm classes.
+ |
+
| WeightedMatchingAlgorithm
+ Allows to derive weighted matching from general graph
+ |
+
| Class and Description | +
|---|
| MaximumFlowAlgorithm
+ Allows to derive maximum-flow
+ from the supplied flow
+ network
+ |
+
| MaximumFlowAlgorithm.MaximumFlow | +
| Class and Description | +
|---|
| MatchingAlgorithm
+ Allows to derive matching from
+ given graph
+ |
+
| MaximumFlowAlgorithm.MaximumFlow | +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/IsomorphicGraphMapping.html b/javadoc/org/jgrapht/alg/isomorphism/IsomorphicGraphMapping.html new file mode 100644 index 0000000..078c045 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/IsomorphicGraphMapping.html @@ -0,0 +1,392 @@ + + + + + + +V - the type of the verticesE - the type of the edgespublic class IsomorphicGraphMapping<V,E> +extends Object +implements GraphMapping<V,E>+
| Constructor and Description | +
|---|
IsomorphicGraphMapping(org.jgrapht.alg.isomorphism.GraphOrdering<V,E> g1,
+ org.jgrapht.alg.isomorphism.GraphOrdering<V,E> g2,
+ int[] core1,
+ int[] core2) |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+getEdgeCorrespondence(E e,
+ boolean forward)
+Gets the mapped value where the key is
+edge |
+
V |
+getVertexCorrespondence(V v,
+ boolean forward)
+Gets the mapped value where the key is
+vertex |
+
boolean |
+hasEdgeCorrespondence(E e)
+Checks if a edge e from the first graph has a corresponding edge in the
+ second graph
+ |
+
boolean |
+hasVertexCorrespondence(V v)
+Checks if a vertex v from the first graph has a corresponding vertex in
+ the second graph
+ |
+
boolean |
+isEqualMapping(GraphMapping<V,E> rel)
+Checks for equality.
+ |
+
String |
+toString() |
+
public IsomorphicGraphMapping(org.jgrapht.alg.isomorphism.GraphOrdering<V,E> g1, + org.jgrapht.alg.isomorphism.GraphOrdering<V,E> g2, + int[] core1, + int[] core2)+
g1 - the first graphg2 - the second graph which is a possible subgraph of g1core1 - the mapping as array (forwards)core2 - the mapping as array (backwards)public V getVertexCorrespondence(V v, + boolean forward)+
GraphMappingvertexgetVertexCorrespondence in interface GraphMapping<V,E>v - vertex in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
+ mapping from graph2 to graph1public E getEdgeCorrespondence(E e, + boolean forward)+
GraphMappingedgegetEdgeCorrespondence in interface GraphMapping<V,E>e - edge in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
+ mapping from graph2 to graph1public boolean hasVertexCorrespondence(V v)+
public boolean hasEdgeCorrespondence(E e)+
public boolean isEqualMapping(GraphMapping<V,E> rel)+
rel - the corresponding mappingCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/IsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/IsomorphismInspector.html new file mode 100644 index 0000000..0192d3e --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/IsomorphismInspector.html @@ -0,0 +1,227 @@ + + + + + + +V - the type of the verticesE - the type of the edgespublic interface IsomorphismInspector<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
Iterator<GraphMapping<V,E>> |
+getMappings() |
+
boolean |
+isomorphismExists() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/VF2AbstractIsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/VF2AbstractIsomorphismInspector.html new file mode 100644 index 0000000..c15cf46 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/VF2AbstractIsomorphismInspector.html @@ -0,0 +1,451 @@ + + + + + + +public abstract class VF2AbstractIsomorphismInspector<V,E> +extends Object +implements IsomorphismInspector<V,E>+
| Modifier and Type | +Field and Description | +
|---|---|
protected Comparator<E> |
+edgeComparator |
+
protected Graph<V,E> |
+graph1 |
+
protected Graph<V,E> |
+graph2 |
+
protected org.jgrapht.alg.isomorphism.GraphOrdering<V,E> |
+ordering1 |
+
protected org.jgrapht.alg.isomorphism.GraphOrdering<V,E> |
+ordering2 |
+
protected Comparator<V> |
+vertexComparator |
+
| Constructor and Description | +
|---|
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
abstract Iterator<GraphMapping<V,E>> |
+getMappings() |
+
boolean |
+isomorphismExists() |
+
protected Comparator<V> vertexComparator+
protected Comparator<E> edgeComparator+
public VF2AbstractIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + Comparator<V> vertexComparator, + Comparator<E> edgeComparator, + boolean cacheEdges)+
graph1 - the first graphgraph2 - the second graphvertexComparator - comparator for semantic equivalence of verticesedgeComparator - comparator for semantic equivalence of edgescacheEdges - if true, edges get cached for faster accesspublic VF2AbstractIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + Comparator<V> vertexComparator, + Comparator<E> edgeComparator)+
public VF2AbstractIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + boolean cacheEdges)+
public abstract Iterator<GraphMapping<V,E>> getMappings()+
getMappings in interface IsomorphismInspector<V,E>public boolean isomorphismExists()+
isomorphismExists in interface IsomorphismInspector<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/VF2GraphIsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/VF2GraphIsomorphismInspector.html new file mode 100644 index 0000000..bc3538c --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/VF2GraphIsomorphismInspector.html @@ -0,0 +1,365 @@ + + + + + + +V - the type of the verticesE - the type of the edgespublic class VF2GraphIsomorphismInspector<V,E> +extends VF2AbstractIsomorphismInspector<V,E>+
edgeComparator, graph1, graph2, ordering1, ordering2, vertexComparator| Constructor and Description | +
|---|
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
org.jgrapht.alg.isomorphism.VF2GraphMappingIterator<V,E> |
+getMappings() |
+
isomorphismExistspublic VF2GraphIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + Comparator<V> vertexComparator, + Comparator<E> edgeComparator, + boolean cacheEdges)+
graph1 - the first graphgraph2 - the second graphvertexComparator - comparator for semantic equivalence of verticesedgeComparator - comparator for semantic equivalence of edgescacheEdges - if true, edges get cached for faster accesspublic VF2GraphIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + Comparator<V> vertexComparator, + Comparator<E> edgeComparator)+
public VF2GraphIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + boolean cacheEdges)+
public org.jgrapht.alg.isomorphism.VF2GraphMappingIterator<V,E> getMappings()+
getMappings in interface IsomorphismInspector<V,E>getMappings in class VF2AbstractIsomorphismInspector<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/VF2SubgraphIsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/VF2SubgraphIsomorphismInspector.html new file mode 100644 index 0000000..7c168bb --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/VF2SubgraphIsomorphismInspector.html @@ -0,0 +1,365 @@ + + + + + + +V - the type of the verticesE - the type of the edgespublic class VF2SubgraphIsomorphismInspector<V,E> +extends VF2AbstractIsomorphismInspector<V,E>+
edgeComparator, graph1, graph2, ordering1, ordering2, vertexComparator| Constructor and Description | +
|---|
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
org.jgrapht.alg.isomorphism.VF2SubgraphMappingIterator<V,E> |
+getMappings() |
+
isomorphismExistspublic VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + Comparator<V> vertexComparator, + Comparator<E> edgeComparator, + boolean cacheEdges)+
graph1 - the first graphgraph2 - the second graph (possible subgraph of graph1)vertexComparator - comparator for semantic equivalence of verticesedgeComparator - comparator for semantic equivalence of edgescacheEdges - if true, edges get cached for faster accesspublic VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + Comparator<V> vertexComparator, + Comparator<E> edgeComparator)+
public VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, + Graph<V,E> graph2, + boolean cacheEdges)+
public org.jgrapht.alg.isomorphism.VF2SubgraphMappingIterator<V,E> getMappings()+
getMappings in interface IsomorphismInspector<V,E>getMappings in class VF2AbstractIsomorphismInspector<V,E>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/class-use/IsomorphicGraphMapping.html b/javadoc/org/jgrapht/alg/isomorphism/class-use/IsomorphicGraphMapping.html new file mode 100644 index 0000000..1438714 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/class-use/IsomorphicGraphMapping.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/class-use/IsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/class-use/IsomorphismInspector.html new file mode 100644 index 0000000..b1e0342 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/class-use/IsomorphismInspector.html @@ -0,0 +1,173 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.isomorphism | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+VF2AbstractIsomorphismInspector<V,E> |
+
class |
+VF2GraphIsomorphismInspector<V,E>
+This is an implementation of the VF2 algorithm using its feature of detecting
+ isomorphism
+ between two graphs as described in Cordella et al.
+ |
+
class |
+VF2SubgraphIsomorphismInspector<V,E>
+This is an implementation of the VF2 algorithm using its feature of detecting
+ subgraph
+ isomorphism between two graphs as described in Cordella et al.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2AbstractIsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2AbstractIsomorphismInspector.html new file mode 100644 index 0000000..c8f1e43 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2AbstractIsomorphismInspector.html @@ -0,0 +1,169 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.isomorphism | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+VF2GraphIsomorphismInspector<V,E>
+This is an implementation of the VF2 algorithm using its feature of detecting
+ isomorphism
+ between two graphs as described in Cordella et al.
+ |
+
class |
+VF2SubgraphIsomorphismInspector<V,E>
+This is an implementation of the VF2 algorithm using its feature of detecting
+ subgraph
+ isomorphism between two graphs as described in Cordella et al.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2GraphIsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2GraphIsomorphismInspector.html new file mode 100644 index 0000000..f4139c1 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2GraphIsomorphismInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2SubgraphIsomorphismInspector.html b/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2SubgraphIsomorphismInspector.html new file mode 100644 index 0000000..19bd1c1 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/class-use/VF2SubgraphIsomorphismInspector.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/package-frame.html b/javadoc/org/jgrapht/alg/isomorphism/package-frame.html new file mode 100644 index 0000000..e882bc6 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/package-frame.html @@ -0,0 +1,27 @@ + + + + + + +| Interface | +Description | +
|---|---|
| IsomorphismInspector<V,E> | +
+ This is a general interface for graph and subgraph isomorphism.
+ |
+
| Class | +Description | +
|---|---|
| IsomorphicGraphMapping<V,E> | +
+ This class represents a GraphMapping between two (subgraph)isomorphic graphs.
+ |
+
| VF2AbstractIsomorphismInspector<V,E> | ++ |
| VF2GraphIsomorphismInspector<V,E> | +
+ This is an implementation of the VF2 algorithm using its feature of detecting
+ isomorphism
+ between two graphs as described in Cordella et al.
+ |
+
| VF2SubgraphIsomorphismInspector<V,E> | +
+ This is an implementation of the VF2 algorithm using its feature of detecting
+ subgraph
+ isomorphism between two graphs as described in Cordella et al.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/package-tree.html b/javadoc/org/jgrapht/alg/isomorphism/package-tree.html new file mode 100644 index 0000000..43a9e7f --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/package-tree.html @@ -0,0 +1,140 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/isomorphism/package-use.html b/javadoc/org/jgrapht/alg/isomorphism/package-use.html new file mode 100644 index 0000000..66bedf8 --- /dev/null +++ b/javadoc/org/jgrapht/alg/isomorphism/package-use.html @@ -0,0 +1,155 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.isomorphism | ++ |
| Class and Description | +
|---|
| IsomorphismInspector
+ This is a general interface for graph and subgraph isomorphism.
+ |
+
| VF2AbstractIsomorphismInspector | +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/package-frame.html b/javadoc/org/jgrapht/alg/package-frame.html new file mode 100644 index 0000000..bdda154 --- /dev/null +++ b/javadoc/org/jgrapht/alg/package-frame.html @@ -0,0 +1,55 @@ + + + + + + +| Class | +Description | +
|---|---|
| AllDirectedPaths<V,E> | +
+ A Dijkstra-like algorithm to find all paths between two sets of nodes in a
+ directed graph, with options to search only simple paths and to limit the
+ path length.
+ |
+
| AStarShortestPath<V,E> | +
+ An implementation of A* shortest path
+ algorithm.
+ |
+
| BellmanFordShortestPath<V,E> | +
+ Bellman-Ford
+ algorithm: weights could be negative, paths could be constrained by a
+ maximum number of edges.
+ |
+
| BiconnectivityInspector<V,E> | +
+ Inspects a graph for the biconnectivity property.
+ |
+
| 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. |
+
| BronKerboschCliqueFinder<V,E> | +
+ This class implements Bron-Kerbosch clique detection algorithm as it is
+ described in [Samudrala R.,Moult J.:A Graph-theoretic Algorithm for
+ comparative Modeling of Protein Structure; J.Mol.
+ |
+
| ChromaticNumber | +
+ Allows the
+ chromatic number of a graph to be calculated.
+ |
+
| CliqueMinimalSeparatorDecomposition<V,E> | +
+ Clique Minimal Separator Decomposition using MCS-M+ and Atoms algorithm as
+ described in Berry et al.
+ |
+
| ConnectivityInspector<V,E> | +
+ Allows obtaining various connectivity aspects of a graph.
+ |
+
| CycleDetector<V,E> | +
+ Performs cycle detection on a graph.
+ |
+
| DijkstraShortestPath<V,E> | +
+ An implementation of Dijkstra's
+ shortest path algorithm using
+ClosestFirstIterator. |
+
| DirectedNeighborIndex<V,E> | +
+ Maintains a cache of each vertex's neighbors.
+ |
+
| EdmondsBlossomShrinking<V,E> | +
+ An implementation of Edmonds Blossom Shrinking algorithm for constructing
+ maximum matchings on graphs.
+ |
+
| EdmondsKarpMaximumFlow<V,E> | +Deprecated
+ Use
+EdmondsKarpMaximumFlow instead |
+
| EulerianCircuit | +
+ This algorithm will check whether a graph is Eulerian (hence it contains an
+ Eulerian
+ circuit).
+ |
+
| FloydWarshallShortestPaths<V,E> | +
+ The
+ Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in
+ O(n^3) time.
+ |
+
| GabowStrongConnectivityInspector<V,E> | +
+ Allows obtaining the strongly connected components of a directed graph.
+ |
+
| HamiltonianCycle | +
+ This class will deal with finding the optimal or approximately optimal
+ minimum tour (hamiltonian cycle) or commonly known as the Traveling
+ Salesman Problem.
+ |
+
| HopcroftKarpBipartiteMatching<V,E> | +
+ This class is an implementation of the Hopcroft-Karp algorithm which finds a
+ maximum matching in an undirected simple bipartite graph.
+ |
+
| KosarajuStrongConnectivityInspector<V,E> | +
+ Complements the
+ConnectivityInspector class with
+ the capability to compute the strongly connected components of a directed
+ graph. |
+
| KruskalMinimumSpanningTree<V,E> | +
+ An implementation of Kruskal's minimum
+ spanning tree algorithm.
+ |
+
| KShortestPaths<V,E> | +
+ The algorithm determines the k shortest simple paths in increasing order of
+ weight.
+ |
+
| KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> | +
+ Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres)
+ solving assignment problem also known as hungarian algorithm
+ (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
+ |
+
| KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E> | +
+ ...
+ |
+
| MaximumWeightBipartiteMatching<V,E> | +
+ This class finds a maximum weight matching of a simple undirected weighted
+ bipartite graph.
+ |
+
| MinSourceSinkCut<V,E> | +
+ Given a directed, weighted graph G(V,E).
+ |
+
| NaiveLcaFinder<V,E> | ++ |
| NeighborIndex<V,E> | +
+ Maintains a cache of each vertex's neighbors.
+ |
+
| PrimMinimumSpanningTree<V,E> | +
+ An implementation of
+ Prim's algorithm that finds a minimum spanning tree/forest subject to
+ connectivity of the supplied weighted undirected graph.
+ |
+
| StoerWagnerMinimumCut<V,E> | +
+ Implements the Stoer and
+ Wagner minimum cut algorithm.
+ |
+
| StrongConnectivityInspector<V,E> | +Deprecated
+ Use
+KosarajuStrongConnectivityInspector instead. |
+
| TarjanLowestCommonAncestor<V,E> | +
+ Used to calculate Tarjan's Lowest Common Ancestors Algorithm
+ |
+
| TarjanLowestCommonAncestor.LcaRequestResponse<V> | ++ |
| TransitiveClosure | +
+ Constructs the transitive closure of the input graph.
+ |
+
| TransitiveReduction | +
+ An implementation of Harry Hsu's transitive
+ reduction algorithm.
+ |
+
| VertexCovers | +
+ Algorithms to find a vertex cover for a graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/package-tree.html b/javadoc/org/jgrapht/alg/package-tree.html new file mode 100644 index 0000000..69dce4f --- /dev/null +++ b/javadoc/org/jgrapht/alg/package-tree.html @@ -0,0 +1,179 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/package-use.html b/javadoc/org/jgrapht/alg/package-use.html new file mode 100644 index 0000000..5f8a7b2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/package-use.html @@ -0,0 +1,169 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| Class and Description | +
|---|
| StoerWagnerMinimumCut.VertexAndWeight
+ Class for weighted vertices
+ |
+
| TarjanLowestCommonAncestor.LcaRequestResponse | +
| TransitiveClosure
+ Constructs the transitive closure of the input graph.
+ |
+
| TransitiveReduction
+ An implementation of Harry Hsu's transitive
+ reduction algorithm.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/AlwaysEqualComparator.html b/javadoc/org/jgrapht/alg/util/AlwaysEqualComparator.html new file mode 100644 index 0000000..4dc20ff --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/AlwaysEqualComparator.html @@ -0,0 +1,279 @@ + + + + + + +public class AlwaysEqualComparator<T> +extends Object +implements Comparator<T>+
| Constructor and Description | +
|---|
AlwaysEqualComparator() |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+compare(T arg0,
+ T arg1) |
+
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitequalsCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/Extension.BaseExtension.html b/javadoc/org/jgrapht/alg/util/Extension.BaseExtension.html new file mode 100644 index 0000000..94d87b5 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/Extension.BaseExtension.html @@ -0,0 +1,238 @@ + + + + + + +public abstract static class Extension.BaseExtension +extends Object+
| Constructor and Description | +
|---|
Extension.BaseExtension() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/Extension.ExtensionFactory.html b/javadoc/org/jgrapht/alg/util/Extension.ExtensionFactory.html new file mode 100644 index 0000000..c450147 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/Extension.ExtensionFactory.html @@ -0,0 +1,215 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/Extension.ExtensionManagerInstantiationException.html b/javadoc/org/jgrapht/alg/util/Extension.ExtensionManagerInstantiationException.html new file mode 100644 index 0000000..bc0a1fc --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/Extension.ExtensionManagerInstantiationException.html @@ -0,0 +1,261 @@ + + + + + + +public static class Extension.ExtensionManagerInstantiationException +extends RuntimeException+
| Constructor and Description | +
|---|
Extension.ExtensionManagerInstantiationException(Exception e) |
+
addSuppressed, fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, getSuppressed, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toStringCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/Extension.html b/javadoc/org/jgrapht/alg/util/Extension.html new file mode 100644 index 0000000..93d4478 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/Extension.html @@ -0,0 +1,306 @@ + + + + + + +T - class-type to be extendedE - extension concept class-typepublic class Extension<T,E> +extends Object+
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+Extension.BaseExtension |
+
static interface |
+Extension.ExtensionFactory<E>
+Factory capable of producing given extension objects of the given
+ class-type
+ |
+
static class |
+Extension.ExtensionManagerInstantiationException |
+
| Constructor and Description | +
|---|
Extension(Extension.ExtensionFactory<E> factory) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/Pair.html b/javadoc/org/jgrapht/alg/util/Pair.html new file mode 100644 index 0000000..3a1e119 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/Pair.html @@ -0,0 +1,360 @@ + + + + + + +public class Pair<A,B> +extends Object+
| Modifier and Type | +Field and Description | +
|---|---|
A |
+first |
+
B |
+second |
+
| Constructor and Description | +
|---|
Pair(A a,
+ B b) |
+
| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+equals(Object other) |
+
int |
+hashCode() |
+
static <A,B> Pair<A,B> |
+of(A a,
+ B b)
+Creates new pair of elements pulling of the necessity to provide
+ corresponding types of the elements supplied
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/UnionFind.html b/javadoc/org/jgrapht/alg/util/UnionFind.html new file mode 100644 index 0000000..12948d8 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/UnionFind.html @@ -0,0 +1,350 @@ + + + + + + +public class UnionFind<T> +extends Object+
| Constructor and Description | +
|---|
UnionFind(Set<T> elements)
+Creates a UnionFind instance with all of the elements of elements in
+ seperate sets.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+addElement(T element)
+Adds a new element to the data structure in its own set.
+ |
+
T |
+find(T element)
+Returns the representative element of the set that element is in.
+ |
+
protected Map<T,T> |
+getParentMap() |
+
protected Map<T,Integer> |
+getRankMap() |
+
void |
+union(T element1,
+ T element2)
+Merges the sets which contain element1 and element2.
+ |
+
public void addElement(T element)+
element - The element to add.public T find(T element)+
element - The element to find.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/VertexDegreeComparator.html b/javadoc/org/jgrapht/alg/util/VertexDegreeComparator.html new file mode 100644 index 0000000..bcd64db --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/VertexDegreeComparator.html @@ -0,0 +1,322 @@ + + + + + + +public class VertexDegreeComparator<V,E> +extends Object +implements Comparator<V>+
Used by greedy algorithms that need to sort vertices by their degree. Two + vertices are considered equal if their degrees are equal.
| Constructor and Description | +
|---|
VertexDegreeComparator(UndirectedGraph<V,E> g)
+Creates a comparator for comparing the degrees of vertices in the
+ specified graph.
+ |
+
VertexDegreeComparator(UndirectedGraph<V,E> g,
+ boolean ascendingOrder)
+Creates a comparator for comparing the degrees of vertices in the
+ specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+compare(V v1,
+ V v2)
+Compare the degrees of
+v1 and v2, taking into
+ account whether ascending or descending order is used. |
+
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitequalspublic VertexDegreeComparator(UndirectedGraph<V,E> g)+
g - graph with respect to which the degree is calculated.public VertexDegreeComparator(UndirectedGraph<V,E> g, + boolean ascendingOrder)+
g - graph with respect to which the degree is calculated.ascendingOrder - true - compares in ascending order of degrees
+ (lowest first), false - compares in descending order of degrees (highest
+ first).public int compare(V v1, + V v2)+
v1 and v2, taking into
+ account whether ascending or descending order is used.compare in interface Comparator<V>v1 - the first vertex to be compared.v2 - the second vertex to be compared.v1 comes before v2, +1 if
+ v1 comes after v2, 0 if equal.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/AlwaysEqualComparator.html b/javadoc/org/jgrapht/alg/util/class-use/AlwaysEqualComparator.html new file mode 100644 index 0000000..c2c345f --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/AlwaysEqualComparator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/Extension.BaseExtension.html b/javadoc/org/jgrapht/alg/util/class-use/Extension.BaseExtension.html new file mode 100644 index 0000000..ef2cbe2 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/Extension.BaseExtension.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.flow | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+PushRelabelMaximumFlow.EdgeExtension |
+
class |
+PushRelabelMaximumFlow.VertexExtension |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/Extension.ExtensionFactory.html b/javadoc/org/jgrapht/alg/util/class-use/Extension.ExtensionFactory.html new file mode 100644 index 0000000..6bbd880 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/Extension.ExtensionFactory.html @@ -0,0 +1,157 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.util | +
+ Utilities used by JGraphT algorithms.
+ |
+
| Constructor and Description | +
|---|
Extension(Extension.ExtensionFactory<E> factory) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/Extension.ExtensionManagerInstantiationException.html b/javadoc/org/jgrapht/alg/util/class-use/Extension.ExtensionManagerInstantiationException.html new file mode 100644 index 0000000..53a7083 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/Extension.ExtensionManagerInstantiationException.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/Extension.html b/javadoc/org/jgrapht/alg/util/class-use/Extension.html new file mode 100644 index 0000000..a9d05c7 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/Extension.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/Pair.html b/javadoc/org/jgrapht/alg/util/class-use/Pair.html new file mode 100644 index 0000000..b9c2508 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/Pair.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.util | +
+ Utilities used by JGraphT algorithms.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <A,B> Pair<A,B> |
+Pair.of(A a,
+ B b)
+Creates new pair of elements pulling of the necessity to provide
+ corresponding types of the elements supplied
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/UnionFind.html b/javadoc/org/jgrapht/alg/util/class-use/UnionFind.html new file mode 100644 index 0000000..21e7533 --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/UnionFind.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/class-use/VertexDegreeComparator.html b/javadoc/org/jgrapht/alg/util/class-use/VertexDegreeComparator.html new file mode 100644 index 0000000..4a75e8f --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/class-use/VertexDegreeComparator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/package-frame.html b/javadoc/org/jgrapht/alg/util/package-frame.html new file mode 100644 index 0000000..d880c4d --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/package-frame.html @@ -0,0 +1,33 @@ + + + + + + +| Interface | +Description | +
|---|---|
| Extension.ExtensionFactory<E> | +
+ Factory capable of producing given extension objects of the given
+ class-type
+ |
+
| Class | +Description | +
|---|---|
| AlwaysEqualComparator<T> | +
+ A default implementation for a check on equality (that always holds)
+ |
+
| Extension<T,E> | +
+ Abstract extension manager allowing to extend given class-types with supplied
+ extension's class-type saving source class object references
+ |
+
| Extension.BaseExtension | ++ |
| Pair<A,B> | +
+ Generic pair.
++ Although the instances of this class are immutable, it is impossible to + ensure that the references passed to the constructor will not be modified by + the caller. |
+
| UnionFind<T> | +
+ An implementation of Union
+ Find data structure.
+ |
+
| VertexDegreeComparator<V,E> | +
+ Compares two vertices based on their degree.
+ |
+
| Exception | +Description | +
|---|---|
| Extension.ExtensionManagerInstantiationException | ++ |
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/package-tree.html b/javadoc/org/jgrapht/alg/util/package-tree.html new file mode 100644 index 0000000..c5fe51d --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/package-tree.html @@ -0,0 +1,152 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/alg/util/package-use.html b/javadoc/org/jgrapht/alg/util/package-use.html new file mode 100644 index 0000000..7fa65ec --- /dev/null +++ b/javadoc/org/jgrapht/alg/util/package-use.html @@ -0,0 +1,182 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.flow | ++ |
| org.jgrapht.alg.util | +
+ Utilities used by JGraphT algorithms.
+ |
+
| Class and Description | +
|---|
| Extension.BaseExtension | +
| Class and Description | +
|---|
| Extension.ExtensionFactory
+ Factory capable of producing given extension objects of the given
+ class-type
+ |
+
| Pair
+ Generic pair.
++ Although the instances of this class are immutable, it is impossible to + ensure that the references passed to the constructor will not be modified by + the caller. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/DirectedGraph.html b/javadoc/org/jgrapht/class-use/DirectedGraph.html new file mode 100644 index 0000000..42714ba --- /dev/null +++ b/javadoc/org/jgrapht/class-use/DirectedGraph.html @@ -0,0 +1,863 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| org.jgrapht.alg.flow | ++ |
| org.jgrapht.alg.interfaces | ++ |
| org.jgrapht.experimental.dag | ++ |
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> void |
+Graphs.addGraphReversed(DirectedGraph<? super V,? super E> destination,
+ DirectedGraph<V,E> source)
+Adds all the vertices and all the edges of the specified source digraph
+ to the specified destination digraph, reversing all of the edges.
+ |
+
static <V,E> void |
+Graphs.addGraphReversed(DirectedGraph<? super V,? super E> destination,
+ DirectedGraph<V,E> source)
+Adds all the vertices and all the edges of the specified source digraph
+ to the specified destination digraph, reversing all of the edges.
+ |
+
static <V,E> List<V> |
+Graphs.predecessorListOf(DirectedGraph<V,E> g,
+ V vertex)
+Returns a list of vertices that are the direct predecessors of a
+ specified vertex.
+ |
+
static <V,E> List<V> |
+Graphs.successorListOf(DirectedGraph<V,E> g,
+ V vertex)
+Returns a list of vertices that are the direct successors of a specified
+ vertex.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+GabowStrongConnectivityInspector.getGraph()
+Returns the graph inspected
+ |
+
DirectedGraph<V,E> |
+StrongConnectivityInspector.getGraph()
+Deprecated.
+Returns the graph inspected by the StrongConnectivityAlgorithm.
+ |
+
DirectedGraph<V,E> |
+KosarajuStrongConnectivityInspector.getGraph()
+Returns the graph inspected by the StrongConnectivityAlgorithm.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
<V,E> void |
+TransitiveReduction.reduce(DirectedGraph<V,E> directedGraph)
+This method will remove all transitive edges from the graph passed as
+ input parameter.
+ |
+
| Constructor and Description | +
|---|
AllDirectedPaths(DirectedGraph<V,E> graph) |
+
ConnectivityInspector(DirectedGraph<V,E> g)
+Creates a connectivity inspector for the specified directed graph.
+ |
+
CycleDetector(DirectedGraph<V,E> graph)
+Creates a cycle detector for the specified graph.
+ |
+
DirectedNeighborIndex(DirectedGraph<V,E> g)
+Creates a neighbor index for the specified directed graph.
+ |
+
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)
+Deprecated.
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network,
+ double epsilon)
+Deprecated.
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
GabowStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+The constructor of GabowStrongConnectivityInspector class.
+ |
+
KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+The constructor of the StrongConnectivityAlgorithm class.
+ |
+
MinSourceSinkCut(DirectedGraph<V,E> graph) |
+
MinSourceSinkCut(DirectedGraph<V,E> graph,
+ double epsilon) |
+
NaiveLcaFinder(DirectedGraph<V,E> graph)
+Find the Lowest Common Ancestor of a directed graph.
+ |
+
StrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+Deprecated.
+The constructor of the StrongConnectivityAlgorithm class.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+SzwarcfiterLauerSimpleCycles.getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
DirectedGraph<V,E> |
+HawickJamesSimpleCycles.getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
DirectedGraph<V,E> |
+TarjanSimpleCycles.getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
DirectedGraph<V,E> |
+JohnsonSimpleCycles.getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
DirectedGraph<V,E> |
+DirectedSimpleCycles.getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
DirectedGraph<V,E> |
+TiernanSimpleCycles.getGraph()
+Returns the graph on which the simple cycle search algorithm is executed
+ by this object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+SzwarcfiterLauerSimpleCycles.setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
void |
+HawickJamesSimpleCycles.setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
void |
+TarjanSimpleCycles.setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
void |
+JohnsonSimpleCycles.setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
void |
+DirectedSimpleCycles.setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
void |
+TiernanSimpleCycles.setGraph(DirectedGraph<V,E> graph)
+Sets the graph on which the simple cycle search algorithm is executed by
+ this object.
+ |
+
| Constructor and Description | +
|---|
HawickJamesSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
JohnsonSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
SzwarcfiterLauerSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
TarjanSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
TiernanSimpleCycles(DirectedGraph<V,E> graph)
+Create a simple cycle finder for the specified graph.
+ |
+
| Constructor and Description | +
|---|
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
EdmondsKarpMaximumFlow(DirectedGraph<V,E> network,
+ double epsilon)
+Constructs MaximumFlow instance to work with a copy of
+ network.
+ |
+
PushRelabelMaximumFlow(DirectedGraph<V,E> network) |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedGraph<V,E> |
+StrongConnectivityAlgorithm.getGraph()
+Returns the graph inspected by the StrongConnectivityAlgorithm.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+GmlExporter.export(Writer output,
+ DirectedGraph<V,E> g)
+Exports a directed graph into a plain text file in GML format.
+ |
+
void |
+MatrixExporter.exportAdjacencyMatrix(Writer output,
+ DirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's adjacency matrix.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AsUnweightedDirectedGraph<V,E>
+An unweighted view of the backing weighted graph specified in the
+ constructor.
+ |
+
class |
+AsWeightedDirectedGraph<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 |
+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 |
+ListenableDirectedGraph<V,E>
+A directed graph which is also
+ListenableGraph. |
+
class |
+ListenableDirectedWeightedGraph<V,E>
+A directed weighted graph which is also
+ListenableGraph. |
+
class |
+MixedGraphUnion<V,E> |
+
class |
+SimpleDirectedGraph<V,E>
+A simple directed graph.
+ |
+
class |
+SimpleDirectedWeightedGraph<V,E>
+A simple directed weighted graph.
+ |
+
class |
+UnmodifiableDirectedGraph<V,E>
+A directed graph that cannot be modified.
+ |
+
| Constructor and Description | +
|---|
AsUndirectedGraph(DirectedGraph<V,E> g)
+Constructor for AsUndirectedGraph.
+ |
+
AsUnweightedDirectedGraph(DirectedGraph<V,E> g)
+Constructor for AsUnweightedGraph.
+ |
+
AsWeightedDirectedGraph(DirectedGraph<V,E> g,
+ Map<E,Double> weightMap)
+Constructor for AsWeightedGraph.
+ |
+
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2) |
+
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2) |
+
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
DirectedMaskSubgraph(DirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask) |
+
DirectedSubgraph(DirectedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new directed subgraph.
+ |
+
EdgeReversedGraph(DirectedGraph<V,E> g)
+Creates a new EdgeReversedGraph.
+ |
+
ListenableDirectedGraph(DirectedGraph<V,E> base)
+Creates a new listenable directed graph.
+ |
+
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2) |
+
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
UnmodifiableDirectedGraph(DirectedGraph<V,E> g)
+Creates a new unmodifiable directed graph based on the specified backing
+ graph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>>
+A builder class for
+Graph. |
+
class |
+DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedGraphBuilder for extending. |
+
class |
+DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for directed weighted graphs}.
+ |
+
class |
+DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedWeightedGraphBuilder for extending. |
+
| Constructor and Description | +
|---|
TopologicalOrderIterator(DirectedGraph<V,E> dg)
+Creates a new topological order iterator over the directed graph
+ specified, with arbitrary tie-breaking in case of partial order.
+ |
+
TopologicalOrderIterator(DirectedGraph<V,E> dg,
+ Queue<V> queue)
+Creates a new topological order iterator over the directed graph
+ specified, with a user-supplied queue implementation to allow customized
+ control over tie-breaking in case of partial order.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/EdgeFactory.html b/javadoc/org/jgrapht/class-use/EdgeFactory.html new file mode 100644 index 0000000..50b1fd6 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/EdgeFactory.html @@ -0,0 +1,428 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.experimental.dag | ++ |
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
EdgeFactory<V,E> |
+Graph.getEdgeFactory()
+Returns the edge factory using which this graph creates new edges.
+ |
+
| Constructor and Description | +
|---|
DirectedAcyclicGraph(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected EdgeFactory<V,E> |
+WeightedGraphGenerator.edgeFactory |
+
| Modifier and Type | +Method and Description | +
|---|---|
WeightedGraphGenerator<V,E> |
+WeightedGraphGenerator.edgeFactory(EdgeFactory<V,E> edgeFactory) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+ClassBasedEdgeFactory<V,E>
+An
+EdgeFactory for producing edges by using a class as a factory. |
+
| Modifier and Type | +Method and Description | +
|---|---|
EdgeFactory<V,E> |
+MaskSubgraph.getEdgeFactory() |
+
EdgeFactory<V,E> |
+GraphUnion.getEdgeFactory()
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
EdgeFactory<V,E> |
+GraphDelegator.getEdgeFactory() |
+
EdgeFactory<V,E> |
+AbstractBaseGraph.getEdgeFactory() |
+
EdgeFactory<V,E> |
+Subgraph.getEdgeFactory() |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+DirectedWeightedMultigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+DefaultDirectedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+WeightedPseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+Pseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+SimpleGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+DefaultDirectedWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+WeightedMultigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+DirectedPseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+SimpleDirectedWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+DirectedMultigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+SimpleWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+DirectedWeightedPseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+Multigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+SimpleDirectedGraph.builder(EdgeFactory<V,E> ef) |
+
| Constructor and Description | +
|---|
AbstractBaseGraph(EdgeFactory<V,E> ef,
+ boolean allowMultipleEdges,
+ boolean allowLoops)
+Construct a new graph.
+ |
+
DefaultDirectedGraph(EdgeFactory<V,E> ef)
+Creates a new directed graph with the specified edge factory.
+ |
+
DefaultDirectedWeightedGraph(EdgeFactory<V,E> ef)
+Creates a new directed weighted graph with the specified edge factory.
+ |
+
DirectedMultigraph(EdgeFactory<V,E> ef)
+Creates a new directed multigraph with the specified edge factory.
+ |
+
DirectedPseudograph(EdgeFactory<V,E> ef) |
+
DirectedWeightedMultigraph(EdgeFactory<V,E> ef)
+Creates a new directed weighted multigraph with the specified edge
+ factory.
+ |
+
DirectedWeightedPseudograph(EdgeFactory<V,E> ef)
+Creates a new directed weighted pseudograph with the specified edge
+ factory.
+ |
+
Multigraph(EdgeFactory<V,E> ef)
+Creates a new multigraph with the specified edge factory.
+ |
+
Pseudograph(EdgeFactory<V,E> ef)
+Creates a new pseudograph with the specified edge factory.
+ |
+
SimpleDirectedGraph(EdgeFactory<V,E> ef)
+Creates a new simple directed graph with the specified edge factory.
+ |
+
SimpleDirectedWeightedGraph(EdgeFactory<V,E> ef)
+Creates a new simple directed weighted graph with the specified edge
+ factory.
+ |
+
SimpleGraph(EdgeFactory<V,E> ef)
+Creates a new simple graph with the specified edge factory.
+ |
+
SimpleWeightedGraph(EdgeFactory<V,E> ef)
+Creates a new simple weighted graph with the specified edge factory.
+ |
+
WeightedMultigraph(EdgeFactory<V,E> ef)
+Creates a new weighted multigraph with the specified edge factory.
+ |
+
WeightedPseudograph(EdgeFactory<V,E> ef)
+Creates a new weighted pseudograph with the specified edge factory.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/Graph.html b/javadoc/org/jgrapht/class-use/Graph.html new file mode 100644 index 0000000..89966d0 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/Graph.html @@ -0,0 +1,1649 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.isomorphism | ++ |
| 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.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.graph.builder | +
+ Various builder for graphs.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Interface and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Graph<V,E> |
+GraphPath.getGraph()
+Returns the graph over which this path is defined.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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. |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected Graph<V,E> |
+BellmanFordShortestPath.graph
+Graph on which shortest paths are searched.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Graph<V,E> |
+FloydWarshallShortestPaths.getGraph() |
+
| Modifier and Type | +Method and Description | +
|---|---|
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> |
+DijkstraShortestPath.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> |
+BellmanFordShortestPath.findPathBetween(Graph<V,E> graph,
+ V startVertex,
+ V endVertex)
+Convenience method to find the shortest path via a single static method
+ call.
+ |
+
| Constructor and Description | +
|---|
AStarShortestPath(Graph<V,E> 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) |
+
TarjanLowestCommonAncestor(Graph<V,E> g)
+Create an instance with a reference to the graph that we will find LCAs
+ for
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected Graph<V,E> |
+VF2AbstractIsomorphismInspector.graph1 |
+
protected Graph<V,E> |
+VF2AbstractIsomorphismInspector.graph2 |
+
| Constructor and Description | +
|---|
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
VF2AbstractIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
VF2GraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ boolean cacheEdges) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator) |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1,
+ Graph<V,E> graph2,
+ Comparator<V> vertexComparator,
+ Comparator<E> edgeComparator,
+ boolean cacheEdges)
+This implementation of the VF2 algorithm does not support graphs with
+ multiple edges.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphSquare<V,E>
+DOCUMENT ME!
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
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) |
+
| Constructor and Description | +
|---|
GraphSquare(Graph<V,E> g,
+ boolean createLoops)
+Constructor for GraphSquare.
+ |
+
| Constructor and Description | +
|---|
IntArrayGraphAlgorithm(Graph<V,E> g) |
+
| Constructor and Description | +
|---|
BrownBacktrackColoring(Graph<V,E> g) |
+
GreedyColoring(Graph<V,E> g) |
+
GreedyColoring(Graph<V,E> g,
+ int method) |
+
| Modifier and Type | +Class and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
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 |
+DOTExporter.export(Writer writer,
+ Graph<V,E> g)
+Exports a graph into a plain text file in DOT format.
+ |
+
void |
+GraphMLExporter.export(Writer writer,
+ Graph<V,E> g)
+Exports a graph into a plain text file in GraphML format.
+ |
+
| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
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 |
+EmptyGraphGenerator.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 |
+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 |
+LinearGraphGenerator.generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
void |
+HyperCubeGraphGenerator.generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+This will generate the hypercube graph
+ |
+
void |
+GridGraphGenerator.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 |
+CompleteGraphGenerator.generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
void |
+RingGraphGenerator.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:
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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 |
+AsWeightedDirectedGraph<V,E>
+A weighted view of the backing 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 |
+MixedGraphUnion<V,E> |
+
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Graph<V,E> |
+GraphPathImpl.getGraph() |
+
| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>>
+Base class for builders of
+Graph |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected G |
+AbstractGraphBuilder.graph |
+
| Modifier and Type | +Method and Description | +
|---|---|
B |
+AbstractGraphBuilder.addGraph(Graph<? extends V,? extends E> sourceGraph)
+Adds all the vertices and all the edges of the
+sourceGraph to the
+ graph being built. |
+
| Modifier and Type | +Method and Description | +
|---|---|
Graph<V,E> |
+CrossComponentIterator.getGraph() |
+
| Constructor and Description | +
|---|
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 © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/GraphHelper.html b/javadoc/org/jgrapht/class-use/GraphHelper.html new file mode 100644 index 0000000..b428cc6 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/GraphHelper.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/GraphMapping.html b/javadoc/org/jgrapht/class-use/GraphMapping.html new file mode 100644 index 0000000..f8b1843 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/GraphMapping.html @@ -0,0 +1,217 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg.isomorphism | ++ |
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+IsomorphicGraphMapping<V,E>
+This class represents a GraphMapping between two (subgraph)isomorphic graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
abstract Iterator<GraphMapping<V,E>> |
+VF2AbstractIsomorphismInspector.getMappings() |
+
Iterator<GraphMapping<V,E>> |
+IsomorphismInspector.getMappings() |
+
| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+IsomorphicGraphMapping.isEqualMapping(GraphMapping<V,E> rel)
+Checks for equality.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DefaultGraphMapping<V,E>
+Implementation of the GraphMapping interface.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/GraphPath.html b/javadoc/org/jgrapht/class-use/GraphPath.html new file mode 100644 index 0000000..83b0de6 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/GraphPath.html @@ -0,0 +1,283 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> List<V> |
+Graphs.getPathVertexList(GraphPath<V,E> path)
+Gets the list of vertices visited by a path.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
GraphPath<V,E> |
+DijkstraShortestPath.getPath()
+Return the path found.
+ |
+
GraphPath<V,E> |
+FloydWarshallShortestPaths.getShortestPath(V a,
+ V b)
+Get the shortest path between two vertices.
+ |
+
GraphPath<V,E> |
+AStarShortestPath.getShortestPath(V sourceVertex,
+ V targetVertex,
+ AStarAdmissibleHeuristic<V> admissibleHeuristic)
+Calculates (and returns) the shortest path from the sourceVertex to the
+ targetVertex.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<GraphPath<V,E>> |
+AllDirectedPaths.getAllPaths(Set<V> sourceVertices,
+ Set<V> targetVertices,
+ boolean simplePathsOnly,
+ Integer maxPathLength)
+Calculate (and return) all paths from the source vertices to the target
+ vertices.
+ |
+
List<GraphPath<V,E>> |
+AllDirectedPaths.getAllPaths(V sourceVertex,
+ V targetVertex,
+ boolean simplePathsOnly,
+ Integer maxPathLength)
+Calculate (and return) all paths from the source vertex to the target
+ vertex.
+ |
+
List<GraphPath<V,E>> |
+KShortestPaths.getPaths(V endVertex)
+Returns the k shortest simple paths in increasing order of weight.
+ |
+
List<GraphPath<V,E>> |
+FloydWarshallShortestPaths.getShortestPaths()
+Get all shortest paths in the graph.
+ |
+
List<GraphPath<V,E>> |
+FloydWarshallShortestPaths.getShortestPaths(V v)
+Get shortest paths from a vertex to all other vertices in the graph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphPathImpl<V,E>
+GraphPathImpl is a default implementation of
+GraphPath. |
+
class |
+SimpleGraphPath<V,E>
+A vertex-based representation of a simple path.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/Graphs.html b/javadoc/org/jgrapht/class-use/Graphs.html new file mode 100644 index 0000000..4a9937e --- /dev/null +++ b/javadoc/org/jgrapht/class-use/Graphs.html @@ -0,0 +1,164 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphHelper
+Deprecated.
+
+Use
+Graphs instead. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/ListenableGraph.html b/javadoc/org/jgrapht/class-use/ListenableGraph.html new file mode 100644 index 0000000..d1803fe --- /dev/null +++ b/javadoc/org/jgrapht/class-use/ListenableGraph.html @@ -0,0 +1,212 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Constructor and Description | +
|---|
JGraphXAdapter(ListenableGraph<V,E> graph)
+Constructs and draws a new ListenableGraph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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 |
+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. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/UndirectedGraph.html b/javadoc/org/jgrapht/class-use/UndirectedGraph.html new file mode 100644 index 0000000..4815cba --- /dev/null +++ b/javadoc/org/jgrapht/class-use/UndirectedGraph.html @@ -0,0 +1,652 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| org.jgrapht.alg.util | +
+ Utilities used by JGraphT algorithms.
+ |
+
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraph<V,E> |
+Graphs.undirectedGraph(Graph<V,E> g)
+Returns an undirected view of the specified graph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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. |
+
| Modifier and Type | +Method and Description | +
|---|---|
UndirectedGraph<V,E> |
+BlockCutpointGraph.getBlock(V vertex)
+Returns the vertex if vertex is a cutpoint, and otherwise returns the
+ block (biconnected component) containing the vertex.
+ |
+
UndirectedGraph<V,E> |
+CliqueMinimalSeparatorDecomposition.getGraph()
+Get the original graph.
+ |
+
UndirectedGraph<V,E> |
+CliqueMinimalSeparatorDecomposition.getMinimalTriangulation()
+Get the minimal triangulation of the graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> int |
+ChromaticNumber.findGreedyChromaticNumber(UndirectedGraph<V,E> g)
+Finds the number of colors required for a greedy coloring of the graph.
+ |
+
static <V,E> Map<Integer,Set<V>> |
+ChromaticNumber.findGreedyColoredGroups(UndirectedGraph<V,E> g)
+Finds a greedy coloring of the graph.
+ |
+
static <V,E> Set<V> |
+VertexCovers.findGreedyCover(UndirectedGraph<V,E> g)
+Finds a greedy approximation for a minimal vertex cover of a specified
+ graph.
+ |
+
Set<E> |
+EdmondsBlossomShrinking.findMatch(UndirectedGraph<V,E> g)
+Deprecated.
+ |
+
static <V,E> List<V> |
+EulerianCircuit.getEulerianCircuitVertices(UndirectedGraph<V,E> g)
+This method will return a list of vertices which represents the Eulerian
+ circuit of the graph.
+ |
+
static <V,E> boolean |
+EulerianCircuit.isEulerian(UndirectedGraph<V,E> g)
+This method will check whether the graph passed in is Eulerian or not.
+ |
+
| Constructor and Description | +
|---|
BiconnectivityInspector(UndirectedGraph<V,E> graph)
+Running time = O(m) where m is the number of edges.
+ |
+
BlockCutpointGraph(UndirectedGraph<V,E> graph)
+Running time = O(m) where m is the number of edges.
+ |
+
CliqueMinimalSeparatorDecomposition(UndirectedGraph<V,E> g)
+Setup a clique minimal separator decomposition on undirected graph
+
+ g. |
+
ConnectivityInspector(UndirectedGraph<V,E> g)
+Creates a connectivity inspector for the specified undirected graph.
+ |
+
EdmondsBlossomShrinking(UndirectedGraph<V,E> G) |
+
HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph,
+ Set<V> partition1,
+ Set<V> partition2) |
+
StoerWagnerMinimumCut(UndirectedGraph<V,E> graph)
+Will compute the minimum cut in graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
UndirectedGraph<V,E> |
+UndirectedCycleBase.getGraph()
+Returns the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
UndirectedGraph<V,E> |
+PatonCycleBase.getGraph()
+Returns the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+UndirectedCycleBase.setGraph(UndirectedGraph<V,E> graph)
+Sets the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
void |
+PatonCycleBase.setGraph(UndirectedGraph<V,E> graph)
+Sets the graph on which the cycle base search algorithm is executed by
+ this object.
+ |
+
| Constructor and Description | +
|---|
PatonCycleBase(UndirectedGraph<V,E> graph)
+Create a cycle base finder for the specified graph.
+ |
+
| Constructor and Description | +
|---|
VertexDegreeComparator(UndirectedGraph<V,E> g)
+Creates a comparator for comparing the degrees of vertices in the
+ specified graph.
+ |
+
VertexDegreeComparator(UndirectedGraph<V,E> g,
+ boolean ascendingOrder)
+Creates a comparator for comparing the degrees of vertices in the
+ specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+GmlExporter.export(Writer output,
+ UndirectedGraph<V,E> g)
+Exports an undirected graph into a plain text file in GML format.
+ |
+
void |
+MatrixExporter.exportAdjacencyMatrix(Writer output,
+ UndirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's adjacency matrix.
+ |
+
void |
+MatrixExporter.exportLaplacianMatrix(Writer output,
+ UndirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's Laplacian matrix.
+ |
+
void |
+MatrixExporter.exportNormalizedLaplacianMatrix(Writer output,
+ UndirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's normalized Laplacian matrix.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AsUndirectedGraph<V,E>
+An undirected view of the backing directed graph specified in the
+ constructor.
+ |
+
class |
+ListenableUndirectedGraph<V,E>
+An undirected graph which is also
+ListenableGraph. |
+
class |
+ListenableUndirectedWeightedGraph<V,E>
+An undirected weighted graph which is also
+ListenableGraph. |
+
class |
+Multigraph<V,E>
+A multigraph.
+ |
+
class |
+Pseudograph<V,E>
+A pseudograph.
+ |
+
class |
+SimpleGraph<V,E>
+A simple graph.
+ |
+
class |
+SimpleWeightedGraph<V,E>
+A simple weighted 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 |
+UnmodifiableUndirectedGraph<V,E>
+An undirected graph that cannot be modified.
+ |
+
class |
+WeightedMultigraph<V,E>
+A weighted multigraph.
+ |
+
class |
+WeightedPseudograph<V,E>
+A weighted pseudograph.
+ |
+
| Constructor and Description | +
|---|
ListenableUndirectedGraph(UndirectedGraph<V,E> base)
+Creates a new listenable undirected graph.
+ |
+
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2) |
+
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
UndirectedMaskSubgraph(UndirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask) |
+
UndirectedSubgraph(UndirectedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new undirected subgraph.
+ |
+
UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)
+Creates a new unmodifiable undirected graph based on the specified
+ backing graph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>>
+A builder class for
+Graph. |
+
class |
+UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedGraphBuilder for extending. |
+
class |
+UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for undirected weighted graphs.
+ |
+
class |
+UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/VertexFactory.html b/javadoc/org/jgrapht/class-use/VertexFactory.html new file mode 100644 index 0000000..cd37d30 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/VertexFactory.html @@ -0,0 +1,353 @@ + + + + + + +| Package | +Description | +
|---|---|
| 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.generate | +
+ Generators for graphs of various topologies.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
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) |
+
| Modifier and Type | +Method and Description | +
|---|---|
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 |
+EmptyGraphGenerator.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 |
+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 |
+LinearGraphGenerator.generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
void |
+HyperCubeGraphGenerator.generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+This will generate the hypercube graph
+ |
+
void |
+GridGraphGenerator.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 |
+CompleteGraphGenerator.generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
void |
+RingGraphGenerator.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.
+ |
+
abstract void |
+WeightedGraphGeneratorAdapter.generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,T> resultMap) |
+
void |
+SimpleWeightedGraphMatrixGenerator.generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap) |
+
void |
+SimpleWeightedBipartiteGraphMatrixGenerator.generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+ClassBasedVertexFactory<V>
+A
+VertexFactory for producing vertices by using a class as a factory. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/class-use/WeightedGraph.html b/javadoc/org/jgrapht/class-use/WeightedGraph.html new file mode 100644 index 0000000..0567be5 --- /dev/null +++ b/javadoc/org/jgrapht/class-use/WeightedGraph.html @@ -0,0 +1,383 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Constructor and Description | +
|---|
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation(WeightedGraph<V,E> G,
+ List<? extends V> S,
+ List<? extends V> T) |
+
KuhnMunkresMinimalWeightBipartitePerfectMatching(WeightedGraph<V,E> G,
+ List<? extends V> S,
+ List<? extends V> T) |
+
MaximumWeightBipartiteMatching(WeightedGraph<V,E> graph,
+ Set<V> vertexPartition1,
+ Set<V> vertexPartition2)
+Creates a new MaximumWeightBipartiteMatching algorithm instance.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
abstract void |
+WeightedGraphGeneratorAdapter.generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,T> resultMap) |
+
void |
+SimpleWeightedGraphMatrixGenerator.generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap) |
+
void |
+SimpleWeightedBipartiteGraphMatrixGenerator.generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AsWeightedDirectedGraph<V,E>
+A weighted view of the backing graph specified in the constructor.
+ |
+
class |
+AsWeightedGraph<V,E>
+A weighted view of the backing graph specified in the constructor.
+ |
+
class |
+DefaultDirectedWeightedGraph<V,E>
+A directed weighted 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 |
+ListenableDirectedWeightedGraph<V,E>
+A directed weighted graph which is also
+ListenableGraph. |
+
class |
+ListenableUndirectedWeightedGraph<V,E>
+An undirected weighted graph which is also
+ListenableGraph. |
+
class |
+SimpleDirectedWeightedGraph<V,E>
+A simple directed weighted graph.
+ |
+
class |
+SimpleWeightedGraph<V,E>
+A simple weighted graph.
+ |
+
class |
+UndirectedWeightedSubgraph<V,E>
+An undirected weighted graph that is a subgraph on other graph.
+ |
+
class |
+WeightedMultigraph<V,E>
+A weighted multigraph.
+ |
+
class |
+WeightedPseudograph<V,E>
+A weighted pseudograph.
+ |
+
| Constructor and Description | +
|---|
DirectedWeightedSubgraph(WeightedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new weighted directed subgraph.
+ |
+
ListenableDirectedWeightedGraph(WeightedGraph<V,E> base)
+Creates a new listenable directed weighted graph.
+ |
+
ListenableUndirectedWeightedGraph(WeightedGraph<V,E> base)
+Creates a new listenable undirected weighted graph.
+ |
+
UndirectedWeightedSubgraph(WeightedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new undirected weighted subgraph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for directed weighted graphs}.
+ |
+
class |
+DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedWeightedGraphBuilder for extending. |
+
class |
+UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for undirected weighted graphs.
+ |
+
class |
+UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/CompleteGraphDemo.html b/javadoc/org/jgrapht/demo/CompleteGraphDemo.html new file mode 100644 index 0000000..7e683a4 --- /dev/null +++ b/javadoc/org/jgrapht/demo/CompleteGraphDemo.html @@ -0,0 +1,273 @@ + + + + + + +public final class CompleteGraphDemo +extends Object+
| Constructor and Description | +
|---|
CompleteGraphDemo() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/HelloJGraphT.html b/javadoc/org/jgrapht/demo/HelloJGraphT.html new file mode 100644 index 0000000..01c2e92 --- /dev/null +++ b/javadoc/org/jgrapht/demo/HelloJGraphT.html @@ -0,0 +1,233 @@ + + + + + + +public final class HelloJGraphT +extends Object+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/JGraphAdapterDemo.html b/javadoc/org/jgrapht/demo/JGraphAdapterDemo.html new file mode 100644 index 0000000..64b5230 --- /dev/null +++ b/javadoc/org/jgrapht/demo/JGraphAdapterDemo.html @@ -0,0 +1,423 @@ + + + + + + +public class JGraphAdapterDemo +extends JApplet+
JApplet.AccessibleJAppletApplet.AccessibleAppletPanel.AccessibleAWTPanelContainer.AccessibleAWTContainerComponent.AccessibleAWTComponent, Component.BaselineResizeBehavior, Component.BltBufferStrategy, Component.FlipBufferStrategyaccessibleContext, rootPane, rootPaneCheckingEnabledBOTTOM_ALIGNMENT, CENTER_ALIGNMENT, LEFT_ALIGNMENT, RIGHT_ALIGNMENT, TOP_ALIGNMENTABORT, ALLBITS, ERROR, FRAMEBITS, HEIGHT, PROPERTIES, SOMEBITS, WIDTH| Constructor and Description | +
|---|
JGraphAdapterDemo() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+init() |
+
static void |
+main(String[] args)
+An alternative starting point for this demo, to also allow running this
+ applet as an application.
+ |
+
addImpl, createRootPane, getAccessibleContext, getContentPane, getGlassPane, getGraphics, getJMenuBar, getLayeredPane, getRootPane, getTransferHandler, isRootPaneCheckingEnabled, paramString, remove, repaint, setContentPane, setGlassPane, setJMenuBar, setLayeredPane, setLayout, setRootPane, setRootPaneCheckingEnabled, setTransferHandler, updatedestroy, getAppletContext, getAppletInfo, getAudioClip, getAudioClip, getCodeBase, getDocumentBase, getImage, getImage, getLocale, getParameter, getParameterInfo, isActive, isValidateRoot, newAudioClip, play, play, resize, resize, setStub, showStatus, start, stopadd, add, add, add, add, addContainerListener, addPropertyChangeListener, addPropertyChangeListener, applyComponentOrientation, areFocusTraversalKeysSet, countComponents, deliverEvent, doLayout, findComponentAt, findComponentAt, getAlignmentX, getAlignmentY, getComponent, getComponentAt, getComponentAt, getComponentCount, getComponents, getComponentZOrder, getContainerListeners, getFocusTraversalKeys, getFocusTraversalPolicy, getInsets, getLayout, getListeners, getMaximumSize, getMinimumSize, getMousePosition, getPreferredSize, insets, invalidate, isAncestorOf, isFocusCycleRoot, isFocusCycleRoot, isFocusTraversalPolicyProvider, isFocusTraversalPolicySet, layout, list, list, locate, minimumSize, paint, paintComponents, preferredSize, print, printComponents, processContainerEvent, processEvent, remove, removeAll, removeContainerListener, removeNotify, setComponentZOrder, setFocusCycleRoot, setFocusTraversalKeys, setFocusTraversalPolicy, setFocusTraversalPolicyProvider, setFont, transferFocusDownCycle, validate, validateTreeaction, add, addComponentListener, addFocusListener, addHierarchyBoundsListener, addHierarchyListener, addInputMethodListener, addKeyListener, addMouseListener, addMouseMotionListener, addMouseWheelListener, bounds, checkImage, checkImage, coalesceEvents, contains, contains, createImage, createImage, createVolatileImage, createVolatileImage, disable, disableEvents, dispatchEvent, enable, enable, enableEvents, enableInputMethods, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, getBackground, getBaseline, getBaselineResizeBehavior, getBounds, getBounds, getColorModel, getComponentListeners, getComponentOrientation, getCursor, getDropTarget, getFocusCycleRootAncestor, getFocusListeners, getFocusTraversalKeysEnabled, getFont, getFontMetrics, getForeground, getGraphicsConfiguration, getHeight, getHierarchyBoundsListeners, getHierarchyListeners, getIgnoreRepaint, getInputContext, getInputMethodListeners, getInputMethodRequests, getKeyListeners, getLocation, getLocation, getLocationOnScreen, getMouseListeners, getMouseMotionListeners, getMousePosition, getMouseWheelListeners, getName, getParent, getPeer, getPropertyChangeListeners, getPropertyChangeListeners, getSize, getSize, getToolkit, getTreeLock, getWidth, getX, getY, gotFocus, handleEvent, hasFocus, hide, imageUpdate, inside, isBackgroundSet, isCursorSet, isDisplayable, isDoubleBuffered, isEnabled, isFocusable, isFocusOwner, isFocusTraversable, isFontSet, isForegroundSet, isLightweight, isMaximumSizeSet, isMinimumSizeSet, isOpaque, isPreferredSizeSet, isShowing, isValid, isVisible, keyDown, keyUp, list, list, list, location, lostFocus, mouseDown, mouseDrag, mouseEnter, mouseExit, mouseMove, mouseUp, move, nextFocus, paintAll, postEvent, prepareImage, prepareImage, printAll, processComponentEvent, processFocusEvent, processHierarchyBoundsEvent, processHierarchyEvent, processInputMethodEvent, processKeyEvent, processMouseEvent, processMouseMotionEvent, processMouseWheelEvent, remove, removeComponentListener, removeFocusListener, removeHierarchyBoundsListener, removeHierarchyListener, removeInputMethodListener, removeKeyListener, removeMouseListener, removeMouseMotionListener, removeMouseWheelListener, removePropertyChangeListener, removePropertyChangeListener, repaint, repaint, repaint, requestFocus, requestFocus, requestFocusInWindow, requestFocusInWindow, reshape, revalidate, setBackground, setBounds, setBounds, setComponentOrientation, setCursor, setDropTarget, setEnabled, setFocusable, setFocusTraversalKeysEnabled, setForeground, setIgnoreRepaint, setLocale, setLocation, setLocation, setMaximumSize, setMinimumSize, setName, setPreferredSize, setSize, setSize, setVisible, show, show, size, toString, transferFocus, transferFocusBackward, transferFocusUpCycleCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/JGraphXAdapterDemo.html b/javadoc/org/jgrapht/demo/JGraphXAdapterDemo.html new file mode 100644 index 0000000..a763611 --- /dev/null +++ b/javadoc/org/jgrapht/demo/JGraphXAdapterDemo.html @@ -0,0 +1,422 @@ + + + + + + +public class JGraphXAdapterDemo +extends JApplet+
JApplet.AccessibleJAppletApplet.AccessibleAppletPanel.AccessibleAWTPanelContainer.AccessibleAWTContainerComponent.AccessibleAWTComponent, Component.BaselineResizeBehavior, Component.BltBufferStrategy, Component.FlipBufferStrategyaccessibleContext, rootPane, rootPaneCheckingEnabledBOTTOM_ALIGNMENT, CENTER_ALIGNMENT, LEFT_ALIGNMENT, RIGHT_ALIGNMENT, TOP_ALIGNMENTABORT, ALLBITS, ERROR, FRAMEBITS, HEIGHT, PROPERTIES, SOMEBITS, WIDTH| Constructor and Description | +
|---|
JGraphXAdapterDemo() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+init() |
+
static void |
+main(String[] args)
+An alternative starting point for this demo, to also allow running this
+ applet as an application.
+ |
+
addImpl, createRootPane, getAccessibleContext, getContentPane, getGlassPane, getGraphics, getJMenuBar, getLayeredPane, getRootPane, getTransferHandler, isRootPaneCheckingEnabled, paramString, remove, repaint, setContentPane, setGlassPane, setJMenuBar, setLayeredPane, setLayout, setRootPane, setRootPaneCheckingEnabled, setTransferHandler, updatedestroy, getAppletContext, getAppletInfo, getAudioClip, getAudioClip, getCodeBase, getDocumentBase, getImage, getImage, getLocale, getParameter, getParameterInfo, isActive, isValidateRoot, newAudioClip, play, play, resize, resize, setStub, showStatus, start, stopadd, add, add, add, add, addContainerListener, addPropertyChangeListener, addPropertyChangeListener, applyComponentOrientation, areFocusTraversalKeysSet, countComponents, deliverEvent, doLayout, findComponentAt, findComponentAt, getAlignmentX, getAlignmentY, getComponent, getComponentAt, getComponentAt, getComponentCount, getComponents, getComponentZOrder, getContainerListeners, getFocusTraversalKeys, getFocusTraversalPolicy, getInsets, getLayout, getListeners, getMaximumSize, getMinimumSize, getMousePosition, getPreferredSize, insets, invalidate, isAncestorOf, isFocusCycleRoot, isFocusCycleRoot, isFocusTraversalPolicyProvider, isFocusTraversalPolicySet, layout, list, list, locate, minimumSize, paint, paintComponents, preferredSize, print, printComponents, processContainerEvent, processEvent, remove, removeAll, removeContainerListener, removeNotify, setComponentZOrder, setFocusCycleRoot, setFocusTraversalKeys, setFocusTraversalPolicy, setFocusTraversalPolicyProvider, setFont, transferFocusDownCycle, validate, validateTreeaction, add, addComponentListener, addFocusListener, addHierarchyBoundsListener, addHierarchyListener, addInputMethodListener, addKeyListener, addMouseListener, addMouseMotionListener, addMouseWheelListener, bounds, checkImage, checkImage, coalesceEvents, contains, contains, createImage, createImage, createVolatileImage, createVolatileImage, disable, disableEvents, dispatchEvent, enable, enable, enableEvents, enableInputMethods, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, firePropertyChange, getBackground, getBaseline, getBaselineResizeBehavior, getBounds, getBounds, getColorModel, getComponentListeners, getComponentOrientation, getCursor, getDropTarget, getFocusCycleRootAncestor, getFocusListeners, getFocusTraversalKeysEnabled, getFont, getFontMetrics, getForeground, getGraphicsConfiguration, getHeight, getHierarchyBoundsListeners, getHierarchyListeners, getIgnoreRepaint, getInputContext, getInputMethodListeners, getInputMethodRequests, getKeyListeners, getLocation, getLocation, getLocationOnScreen, getMouseListeners, getMouseMotionListeners, getMousePosition, getMouseWheelListeners, getName, getParent, getPeer, getPropertyChangeListeners, getPropertyChangeListeners, getSize, getSize, getToolkit, getTreeLock, getWidth, getX, getY, gotFocus, handleEvent, hasFocus, hide, imageUpdate, inside, isBackgroundSet, isCursorSet, isDisplayable, isDoubleBuffered, isEnabled, isFocusable, isFocusOwner, isFocusTraversable, isFontSet, isForegroundSet, isLightweight, isMaximumSizeSet, isMinimumSizeSet, isOpaque, isPreferredSizeSet, isShowing, isValid, isVisible, keyDown, keyUp, list, list, list, location, lostFocus, mouseDown, mouseDrag, mouseEnter, mouseExit, mouseMove, mouseUp, move, nextFocus, paintAll, postEvent, prepareImage, prepareImage, printAll, processComponentEvent, processFocusEvent, processHierarchyBoundsEvent, processHierarchyEvent, processInputMethodEvent, processKeyEvent, processMouseEvent, processMouseMotionEvent, processMouseWheelEvent, remove, removeComponentListener, removeFocusListener, removeHierarchyBoundsListener, removeHierarchyListener, removeInputMethodListener, removeKeyListener, removeMouseListener, removeMouseMotionListener, removeMouseWheelListener, removePropertyChangeListener, removePropertyChangeListener, repaint, repaint, repaint, requestFocus, requestFocus, requestFocusInWindow, requestFocusInWindow, reshape, revalidate, setBackground, setBounds, setBounds, setComponentOrientation, setCursor, setDropTarget, setEnabled, setFocusable, setFocusTraversalKeysEnabled, setForeground, setIgnoreRepaint, setLocale, setLocation, setLocation, setMaximumSize, setMinimumSize, setName, setPreferredSize, setSize, setSize, setVisible, show, show, size, toString, transferFocus, transferFocusBackward, transferFocusUpCycleCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/PerformanceDemo.html b/javadoc/org/jgrapht/demo/PerformanceDemo.html new file mode 100644 index 0000000..baa2739 --- /dev/null +++ b/javadoc/org/jgrapht/demo/PerformanceDemo.html @@ -0,0 +1,277 @@ + + + + + + +public final class PerformanceDemo +extends Object+
NOTE: To run this demo you may need to increase the JVM max mem size. In + Sun's JVM it is done using the "-Xmx" switch. Specify "-Xmx300M" to set it to + 300MB.
+ +WARNING: Don't run this demo as-is on machines with less than 512MB + memory. Your machine will start paging severely. You need to first modify it + to have fewer graph elements. This is easily done by changing the loop + counters below.
| Constructor and Description | +
|---|
PerformanceDemo() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/class-use/CompleteGraphDemo.html b/javadoc/org/jgrapht/demo/class-use/CompleteGraphDemo.html new file mode 100644 index 0000000..e14cbbd --- /dev/null +++ b/javadoc/org/jgrapht/demo/class-use/CompleteGraphDemo.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/class-use/HelloJGraphT.html b/javadoc/org/jgrapht/demo/class-use/HelloJGraphT.html new file mode 100644 index 0000000..31ee027 --- /dev/null +++ b/javadoc/org/jgrapht/demo/class-use/HelloJGraphT.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/class-use/JGraphAdapterDemo.html b/javadoc/org/jgrapht/demo/class-use/JGraphAdapterDemo.html new file mode 100644 index 0000000..4ad51e2 --- /dev/null +++ b/javadoc/org/jgrapht/demo/class-use/JGraphAdapterDemo.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/class-use/JGraphXAdapterDemo.html b/javadoc/org/jgrapht/demo/class-use/JGraphXAdapterDemo.html new file mode 100644 index 0000000..0b3cc7a --- /dev/null +++ b/javadoc/org/jgrapht/demo/class-use/JGraphXAdapterDemo.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/class-use/PerformanceDemo.html b/javadoc/org/jgrapht/demo/class-use/PerformanceDemo.html new file mode 100644 index 0000000..b85fd65 --- /dev/null +++ b/javadoc/org/jgrapht/demo/class-use/PerformanceDemo.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/package-frame.html b/javadoc/org/jgrapht/demo/package-frame.html new file mode 100644 index 0000000..67d5a02 --- /dev/null +++ b/javadoc/org/jgrapht/demo/package-frame.html @@ -0,0 +1,24 @@ + + + + + + +See: Description
+| Class | +Description | +
|---|---|
| CompleteGraphDemo | ++ |
| HelloJGraphT | +
+ A simple introduction to using JGraphT.
+ |
+
| JGraphAdapterDemo | +
+ A demo applet that shows how to use JGraph to visualize JGraphT graphs.
+ |
+
| JGraphXAdapterDemo | +
+ A demo applet that shows how to use JGraphX to visualize JGraphT graphs.
+ |
+
| PerformanceDemo | +
+ A simple demo to test memory and CPU consumption on a graph with 3 million
+ elements.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/package-tree.html b/javadoc/org/jgrapht/demo/package-tree.html new file mode 100644 index 0000000..bda472c --- /dev/null +++ b/javadoc/org/jgrapht/demo/package-tree.html @@ -0,0 +1,154 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/demo/package-use.html b/javadoc/org/jgrapht/demo/package-use.html new file mode 100644 index 0000000..0878bb3 --- /dev/null +++ b/javadoc/org/jgrapht/demo/package-use.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/ConnectedComponentTraversalEvent.html b/javadoc/org/jgrapht/event/ConnectedComponentTraversalEvent.html new file mode 100644 index 0000000..0dcedbd --- /dev/null +++ b/javadoc/org/jgrapht/event/ConnectedComponentTraversalEvent.html @@ -0,0 +1,354 @@ + + + + + + +public class ConnectedComponentTraversalEvent +extends EventObject+
| Modifier and Type | +Field and Description | +
|---|---|
static int |
+CONNECTED_COMPONENT_FINISHED
+Connected component traversal finished event.
+ |
+
static int |
+CONNECTED_COMPONENT_STARTED
+Connected component traversal started event.
+ |
+
source| Constructor and Description | +
|---|
ConnectedComponentTraversalEvent(Object eventSource,
+ int type)
+Creates a new ConnectedComponentTraversalEvent.
+ |
+
public static final int CONNECTED_COMPONENT_STARTED+
public static final int CONNECTED_COMPONENT_FINISHED+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/EdgeTraversalEvent.html b/javadoc/org/jgrapht/event/EdgeTraversalEvent.html new file mode 100644 index 0000000..881870b --- /dev/null +++ b/javadoc/org/jgrapht/event/EdgeTraversalEvent.html @@ -0,0 +1,338 @@ + + + + + + +public class EdgeTraversalEvent<V,E> +extends EventObject+
| Modifier and Type | +Field and Description | +
|---|---|
protected E |
+edge
+The traversed edge.
+ |
+
source| Constructor and Description | +
|---|
EdgeTraversalEvent(Object eventSource,
+ E edge)
+Creates a new EdgeTraversalEvent.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/GraphChangeEvent.html b/javadoc/org/jgrapht/event/GraphChangeEvent.html new file mode 100644 index 0000000..bc2644b --- /dev/null +++ b/javadoc/org/jgrapht/event/GraphChangeEvent.html @@ -0,0 +1,341 @@ + + + + + + +public class GraphChangeEvent +extends EventObject+
| Modifier and Type | +Field and Description | +
|---|---|
protected int |
+type
+The type of graph change this event indicates.
+ |
+
source| Constructor and Description | +
|---|
GraphChangeEvent(Object eventSource,
+ int type)
+Creates a new graph change event.
+ |
+
protected int type+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/GraphEdgeChangeEvent.html b/javadoc/org/jgrapht/event/GraphEdgeChangeEvent.html new file mode 100644 index 0000000..6bc5230 --- /dev/null +++ b/javadoc/org/jgrapht/event/GraphEdgeChangeEvent.html @@ -0,0 +1,529 @@ + + + + + + +public class GraphEdgeChangeEvent<V,E> +extends GraphChangeEvent+
GraphChangeEvent.getType() method.| Modifier and Type | +Field and Description | +
|---|---|
static int |
+BEFORE_EDGE_ADDED
+Before edge added event.
+ |
+
static int |
+BEFORE_EDGE_REMOVED
+Before edge removed event.
+ |
+
protected E |
+edge
+The edge that this event is related to.
+ |
+
static int |
+EDGE_ADDED
+Edge added event.
+ |
+
static int |
+EDGE_REMOVED
+Edge removed event.
+ |
+
protected V |
+edgeSource
+The source vertex of the edge that this event is related to.
+ |
+
protected V |
+edgeTarget
+The target vertex of the edge that this event is related to.
+ |
+
typesource| Constructor and Description | +
|---|
GraphEdgeChangeEvent(Object eventSource,
+ int type,
+ E edge)
+Deprecated.
+
+Use new constructor which takes vertex parameters.
+ |
+
GraphEdgeChangeEvent(Object eventSource,
+ int type,
+ E edge,
+ V edgeSource,
+ V edgeTarget)
+Constructor for GraphEdgeChangeEvent.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+getEdge()
+Returns the edge that this event is related to.
+ |
+
V |
+getEdgeSource()
+Returns the source vertex that this event is related to.
+ |
+
V |
+getEdgeTarget()
+Returns the target vertex that this event is related to.
+ |
+
getTypegetSource, toStringpublic static final int BEFORE_EDGE_ADDED+
public static final int BEFORE_EDGE_REMOVED+
public static final int EDGE_ADDED+
public static final int EDGE_REMOVED+
protected E edge+
protected V edgeSource+
protected V edgeTarget+
@Deprecated +public GraphEdgeChangeEvent(Object eventSource, + int type, + E edge)+
eventSource - the source of this event.type - the event type of this event.edge - the edge that this event is related to.public GraphEdgeChangeEvent(Object eventSource, + int type, + E edge, + V edgeSource, + V edgeTarget)+
eventSource - the source of this event.type - the event type of this event.edge - the edge that this event is related to.edgeSource - edge source vertexedgeTarget - edge target vertexpublic E getEdge()+
public V getEdgeSource()+
public V getEdgeTarget()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/GraphListener.html b/javadoc/org/jgrapht/event/GraphListener.html new file mode 100644 index 0000000..88db132 --- /dev/null +++ b/javadoc/org/jgrapht/event/GraphListener.html @@ -0,0 +1,254 @@ + + + + + + +public interface GraphListener<V,E> +extends VertexSetListener<V>+
If only notifications on vertex set changes are required it is more + efficient to use the VertexSetListener.
VertexSetListener| Modifier and Type | +Method and Description | +
|---|---|
void |
+edgeAdded(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been added to the graph.
+ |
+
void |
+edgeRemoved(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been removed from the graph.
+ |
+
vertexAdded, vertexRemovedvoid edgeAdded(GraphEdgeChangeEvent<V,E> e)+
e - the edge event.void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
e - the edge event.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/GraphVertexChangeEvent.html b/javadoc/org/jgrapht/event/GraphVertexChangeEvent.html new file mode 100644 index 0000000..32015ef --- /dev/null +++ b/javadoc/org/jgrapht/event/GraphVertexChangeEvent.html @@ -0,0 +1,434 @@ + + + + + + +public class GraphVertexChangeEvent<V> +extends GraphChangeEvent+
GraphChangeEvent.getType() method.| Modifier and Type | +Field and Description | +
|---|---|
static int |
+BEFORE_VERTEX_ADDED
+Before vertex added event.
+ |
+
static int |
+BEFORE_VERTEX_REMOVED
+Before vertex removed event.
+ |
+
protected V |
+vertex
+The vertex that this event is related to.
+ |
+
static int |
+VERTEX_ADDED
+Vertex added event.
+ |
+
static int |
+VERTEX_REMOVED
+Vertex removed event.
+ |
+
typesource| Constructor and Description | +
|---|
GraphVertexChangeEvent(Object eventSource,
+ int type,
+ V vertex)
+Creates a new GraphVertexChangeEvent object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
V |
+getVertex()
+Returns the vertex that this event is related to.
+ |
+
getTypegetSource, toStringpublic static final int BEFORE_VERTEX_ADDED+
public static final int BEFORE_VERTEX_REMOVED+
public static final int VERTEX_ADDED+
public static final int VERTEX_REMOVED+
protected V vertex+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/TraversalListener.html b/javadoc/org/jgrapht/event/TraversalListener.html new file mode 100644 index 0000000..85e7b67 --- /dev/null +++ b/javadoc/org/jgrapht/event/TraversalListener.html @@ -0,0 +1,303 @@ + + + + + + +public interface TraversalListener<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
void |
+connectedComponentFinished(ConnectedComponentTraversalEvent e)
+Called to inform listeners that the traversal of the current connected
+ component has finished.
+ |
+
void |
+connectedComponentStarted(ConnectedComponentTraversalEvent e)
+Called to inform listeners that a traversal of a new connected component
+ has started.
+ |
+
void |
+edgeTraversed(EdgeTraversalEvent<V,E> e)
+Called to inform the listener that the specified edge have been visited
+ during the graph traversal.
+ |
+
void |
+vertexFinished(VertexTraversalEvent<V> e)
+Called to inform the listener that the specified vertex have been
+ finished during the graph traversal.
+ |
+
void |
+vertexTraversed(VertexTraversalEvent<V> e)
+Called to inform the listener that the specified vertex have been visited
+ during the graph traversal.
+ |
+
void connectedComponentFinished(ConnectedComponentTraversalEvent e)+
e - the traversal event.void connectedComponentStarted(ConnectedComponentTraversalEvent e)+
e - the traversal event.void edgeTraversed(EdgeTraversalEvent<V,E> e)+
e - the edge traversal event.void vertexTraversed(VertexTraversalEvent<V> e)+
e - the vertex traversal event.void vertexFinished(VertexTraversalEvent<V> e)+
e - the vertex traversal event.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/TraversalListenerAdapter.html b/javadoc/org/jgrapht/event/TraversalListenerAdapter.html new file mode 100644 index 0000000..44b0525 --- /dev/null +++ b/javadoc/org/jgrapht/event/TraversalListenerAdapter.html @@ -0,0 +1,375 @@ + + + + + + +public class TraversalListenerAdapter<V,E> +extends Object +implements TraversalListener<V,E>+
TraversalListener interface
+ used for subclasses.| Constructor and Description | +
|---|
TraversalListenerAdapter() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+connectedComponentFinished(ConnectedComponentTraversalEvent e)
+Called to inform listeners that the traversal of the current connected
+ component has finished.
+ |
+
void |
+connectedComponentStarted(ConnectedComponentTraversalEvent e)
+Called to inform listeners that a traversal of a new connected component
+ has started.
+ |
+
void |
+edgeTraversed(EdgeTraversalEvent<V,E> e)
+Called to inform the listener that the specified edge have been visited
+ during the graph traversal.
+ |
+
void |
+vertexFinished(VertexTraversalEvent<V> e)
+Called to inform the listener that the specified vertex have been
+ finished during the graph traversal.
+ |
+
void |
+vertexTraversed(VertexTraversalEvent<V> e)
+Called to inform the listener that the specified vertex have been visited
+ during the graph traversal.
+ |
+
public TraversalListenerAdapter()+
public void connectedComponentFinished(ConnectedComponentTraversalEvent e)+
TraversalListenerconnectedComponentFinished in interface TraversalListener<V,E>e - the traversal event.TraversalListener.connectedComponentFinished(ConnectedComponentTraversalEvent)public void connectedComponentStarted(ConnectedComponentTraversalEvent e)+
TraversalListenerconnectedComponentStarted in interface TraversalListener<V,E>e - the traversal event.TraversalListener.connectedComponentStarted(ConnectedComponentTraversalEvent)public void edgeTraversed(EdgeTraversalEvent<V,E> e)+
TraversalListeneredgeTraversed in interface TraversalListener<V,E>e - the edge traversal event.TraversalListener.edgeTraversed(EdgeTraversalEvent)public void vertexTraversed(VertexTraversalEvent<V> e)+
TraversalListenervertexTraversed in interface TraversalListener<V,E>e - the vertex traversal event.TraversalListener.vertexTraversed(VertexTraversalEvent)public void vertexFinished(VertexTraversalEvent<V> e)+
TraversalListenervertexFinished in interface TraversalListener<V,E>e - the vertex traversal event.TraversalListener.vertexFinished(VertexTraversalEvent)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/VertexSetListener.html b/javadoc/org/jgrapht/event/VertexSetListener.html new file mode 100644 index 0000000..c5fa843 --- /dev/null +++ b/javadoc/org/jgrapht/event/VertexSetListener.html @@ -0,0 +1,251 @@ + + + + + + +public interface VertexSetListener<V> +extends EventListener+
+ GraphListener.GraphListener| Modifier and Type | +Method and Description | +
|---|---|
void |
+vertexAdded(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been added to the graph.
+ |
+
void |
+vertexRemoved(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been removed from the graph.
+ |
+
void vertexAdded(GraphVertexChangeEvent<V> e)+
e - the vertex event.void vertexRemoved(GraphVertexChangeEvent<V> e)+
e - the vertex event.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/VertexTraversalEvent.html b/javadoc/org/jgrapht/event/VertexTraversalEvent.html new file mode 100644 index 0000000..bcaa66b --- /dev/null +++ b/javadoc/org/jgrapht/event/VertexTraversalEvent.html @@ -0,0 +1,338 @@ + + + + + + +public class VertexTraversalEvent<V> +extends EventObject+
| Modifier and Type | +Field and Description | +
|---|---|
protected V |
+vertex
+The traversed vertex.
+ |
+
source| Constructor and Description | +
|---|
VertexTraversalEvent(Object eventSource,
+ V vertex)
+Creates a new VertexTraversalEvent.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/ConnectedComponentTraversalEvent.html b/javadoc/org/jgrapht/event/class-use/ConnectedComponentTraversalEvent.html new file mode 100644 index 0000000..1029739 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/ConnectedComponentTraversalEvent.html @@ -0,0 +1,212 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+TraversalListenerAdapter.connectedComponentFinished(ConnectedComponentTraversalEvent e) |
+
void |
+TraversalListener.connectedComponentFinished(ConnectedComponentTraversalEvent e)
+Called to inform listeners that the traversal of the current connected
+ component has finished.
+ |
+
void |
+TraversalListenerAdapter.connectedComponentStarted(ConnectedComponentTraversalEvent e) |
+
void |
+TraversalListener.connectedComponentStarted(ConnectedComponentTraversalEvent e)
+Called to inform listeners that a traversal of a new connected component
+ has started.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+AbstractGraphIterator.fireConnectedComponentFinished(ConnectedComponentTraversalEvent e)
+Informs all listeners that the traversal of the current connected
+ component finished.
+ |
+
protected void |
+AbstractGraphIterator.fireConnectedComponentStarted(ConnectedComponentTraversalEvent e)
+Informs all listeners that a traversal of a new connected component has
+ started.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/EdgeTraversalEvent.html b/javadoc/org/jgrapht/event/class-use/EdgeTraversalEvent.html new file mode 100644 index 0000000..88f5f25 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/EdgeTraversalEvent.html @@ -0,0 +1,193 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+TraversalListenerAdapter.edgeTraversed(EdgeTraversalEvent<V,E> e) |
+
void |
+TraversalListener.edgeTraversed(EdgeTraversalEvent<V,E> e)
+Called to inform the listener that the specified edge have been visited
+ during the graph traversal.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+AbstractGraphIterator.fireEdgeTraversed(EdgeTraversalEvent<V,E> e)
+Informs all listeners that a the specified edge was visited.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/GraphChangeEvent.html b/javadoc/org/jgrapht/event/class-use/GraphChangeEvent.html new file mode 100644 index 0000000..9262099 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/GraphChangeEvent.html @@ -0,0 +1,170 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphEdgeChangeEvent<V,E>
+An event which indicates that a graph edge has changed, or is about to
+ change.
+ |
+
class |
+GraphVertexChangeEvent<V>
+An event which indicates that a graph vertex has changed, or is about to
+ change.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/GraphEdgeChangeEvent.html b/javadoc/org/jgrapht/event/class-use/GraphEdgeChangeEvent.html new file mode 100644 index 0000000..88a8450 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/GraphEdgeChangeEvent.html @@ -0,0 +1,241 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+NeighborIndex.edgeAdded(GraphEdgeChangeEvent<V,E> e) |
+
void |
+DirectedNeighborIndex.edgeAdded(GraphEdgeChangeEvent<V,E> e) |
+
void |
+ConnectivityInspector.edgeAdded(GraphEdgeChangeEvent<V,E> e) |
+
void |
+NeighborIndex.edgeRemoved(GraphEdgeChangeEvent<V,E> e) |
+
void |
+DirectedNeighborIndex.edgeRemoved(GraphEdgeChangeEvent<V,E> e) |
+
void |
+ConnectivityInspector.edgeRemoved(GraphEdgeChangeEvent<V,E> e) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+GraphListener.edgeAdded(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been added to the graph.
+ |
+
void |
+GraphListener.edgeRemoved(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been removed from the graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+JGraphXAdapter.edgeAdded(GraphEdgeChangeEvent<V,E> e) |
+
void |
+JGraphXAdapter.edgeRemoved(GraphEdgeChangeEvent<V,E> e) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/GraphListener.html b/javadoc/org/jgrapht/event/class-use/GraphListener.html new file mode 100644 index 0000000..6bd8b25 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/GraphListener.html @@ -0,0 +1,261 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+ListenableGraph.addGraphListener(GraphListener<V,E> l)
+Adds the specified graph listener to this graph, if not already present.
+ |
+
void |
+ListenableGraph.removeGraphListener(GraphListener<V,E> l)
+Removes the specified graph listener from this graph, if present.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+ConnectivityInspector<V,E>
+Allows obtaining various connectivity aspects of a graph.
+ |
+
class |
+DirectedNeighborIndex<V,E>
+Maintains a cache of each vertex's neighbors.
+ |
+
class |
+NeighborIndex<V,E>
+Maintains a cache of each vertex's neighbors.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+JGraphXAdapter<V,E>
+Adapter to draw a JGraphT graph with the JGraphX drawing library.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+DefaultListenableGraph.addGraphListener(GraphListener<V,E> l) |
+
void |
+DefaultListenableGraph.removeGraphListener(GraphListener<V,E> l) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/GraphVertexChangeEvent.html b/javadoc/org/jgrapht/event/class-use/GraphVertexChangeEvent.html new file mode 100644 index 0000000..714db8a --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/GraphVertexChangeEvent.html @@ -0,0 +1,241 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+NeighborIndex.vertexAdded(GraphVertexChangeEvent<V> e) |
+
void |
+DirectedNeighborIndex.vertexAdded(GraphVertexChangeEvent<V> e) |
+
void |
+ConnectivityInspector.vertexAdded(GraphVertexChangeEvent<V> e) |
+
void |
+NeighborIndex.vertexRemoved(GraphVertexChangeEvent<V> e) |
+
void |
+DirectedNeighborIndex.vertexRemoved(GraphVertexChangeEvent<V> e) |
+
void |
+ConnectivityInspector.vertexRemoved(GraphVertexChangeEvent<V> e) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+VertexSetListener.vertexAdded(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been added to the graph.
+ |
+
void |
+VertexSetListener.vertexRemoved(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been removed from the graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+JGraphXAdapter.vertexAdded(GraphVertexChangeEvent<V> e) |
+
void |
+JGraphXAdapter.vertexRemoved(GraphVertexChangeEvent<V> e) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/TraversalListener.html b/javadoc/org/jgrapht/event/class-use/TraversalListener.html new file mode 100644 index 0000000..03714bb --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/TraversalListener.html @@ -0,0 +1,207 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+TraversalListenerAdapter<V,E>
+An empty do-nothing implementation of the
+TraversalListener interface
+ used for subclasses. |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+GraphIterator.addTraversalListener(TraversalListener<V,E> l)
+Adds the specified traversal listener to this iterator.
+ |
+
void |
+AbstractGraphIterator.addTraversalListener(TraversalListener<V,E> l)
+Adds the specified traversal listener to this iterator.
+ |
+
void |
+GraphIterator.removeTraversalListener(TraversalListener<V,E> l)
+Removes the specified traversal listener from this iterator.
+ |
+
void |
+AbstractGraphIterator.removeTraversalListener(TraversalListener<V,E> l)
+Removes the specified traversal listener from this iterator.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/TraversalListenerAdapter.html b/javadoc/org/jgrapht/event/class-use/TraversalListenerAdapter.html new file mode 100644 index 0000000..83462f6 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/TraversalListenerAdapter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/VertexSetListener.html b/javadoc/org/jgrapht/event/class-use/VertexSetListener.html new file mode 100644 index 0000000..c0f9b0a --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/VertexSetListener.html @@ -0,0 +1,289 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+ListenableGraph.addVertexSetListener(VertexSetListener<V> l)
+Adds the specified vertex set listener to this graph, if not already
+ present.
+ |
+
void |
+ListenableGraph.removeVertexSetListener(VertexSetListener<V> l)
+Removes the specified vertex set listener from this graph, if present.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+ConnectivityInspector<V,E>
+Allows obtaining various connectivity aspects of a graph.
+ |
+
class |
+DirectedNeighborIndex<V,E>
+Maintains a cache of each vertex's neighbors.
+ |
+
class |
+NeighborIndex<V,E>
+Maintains a cache of each vertex's neighbors.
+ |
+
| Modifier and Type | +Interface and Description | +
|---|---|
interface |
+GraphListener<V,E>
+A listener that is notified when the graph changes.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+JGraphXAdapter<V,E>
+Adapter to draw a JGraphT graph with the JGraphX drawing library.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+DefaultListenableGraph.addVertexSetListener(VertexSetListener<V> l) |
+
void |
+DefaultListenableGraph.removeVertexSetListener(VertexSetListener<V> l) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/class-use/VertexTraversalEvent.html b/javadoc/org/jgrapht/event/class-use/VertexTraversalEvent.html new file mode 100644 index 0000000..daf6801 --- /dev/null +++ b/javadoc/org/jgrapht/event/class-use/VertexTraversalEvent.html @@ -0,0 +1,210 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+TraversalListenerAdapter.vertexFinished(VertexTraversalEvent<V> e) |
+
void |
+TraversalListener.vertexFinished(VertexTraversalEvent<V> e)
+Called to inform the listener that the specified vertex have been
+ finished during the graph traversal.
+ |
+
void |
+TraversalListenerAdapter.vertexTraversed(VertexTraversalEvent<V> e) |
+
void |
+TraversalListener.vertexTraversed(VertexTraversalEvent<V> e)
+Called to inform the listener that the specified vertex have been visited
+ during the graph traversal.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+AbstractGraphIterator.fireVertexFinished(VertexTraversalEvent<V> e)
+Informs all listeners that a the specified vertex was finished.
+ |
+
protected void |
+AbstractGraphIterator.fireVertexTraversed(VertexTraversalEvent<V> e)
+Informs all listeners that a the specified vertex was visited.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/package-frame.html b/javadoc/org/jgrapht/event/package-frame.html new file mode 100644 index 0000000..6f02b98 --- /dev/null +++ b/javadoc/org/jgrapht/event/package-frame.html @@ -0,0 +1,32 @@ + + + + + + +See: Description
+| Interface | +Description | +
|---|---|
| GraphListener<V,E> | +
+ A listener that is notified when the graph changes.
+ |
+
| TraversalListener<V,E> | +
+ A listener on graph iterator or on a graph traverser.
+ |
+
| VertexSetListener<V> | +
+ A listener that is notified when the graph's vertex set changes.
+ |
+
| Class | +Description | +
|---|---|
| ConnectedComponentTraversalEvent | +
+ A traversal event with respect to a connected component.
+ |
+
| EdgeTraversalEvent<V,E> | +
+ A traversal event for a graph edge.
+ |
+
| GraphChangeEvent | +
+ An event which indicates that a graph has changed.
+ |
+
| GraphEdgeChangeEvent<V,E> | +
+ An event which indicates that a graph edge has changed, or is about to
+ change.
+ |
+
| GraphVertexChangeEvent<V> | +
+ An event which indicates that a graph vertex has changed, or is about to
+ change.
+ |
+
| TraversalListenerAdapter<V,E> | +
+ An empty do-nothing implementation of the
+TraversalListener interface
+ used for subclasses. |
+
| VertexTraversalEvent<V> | +
+ A traversal event for a graph vertex.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/package-tree.html b/javadoc/org/jgrapht/event/package-tree.html new file mode 100644 index 0000000..5dbfd69 --- /dev/null +++ b/javadoc/org/jgrapht/event/package-tree.html @@ -0,0 +1,156 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/event/package-use.html b/javadoc/org/jgrapht/event/package-use.html new file mode 100644 index 0000000..996333c --- /dev/null +++ b/javadoc/org/jgrapht/event/package-use.html @@ -0,0 +1,368 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Class and Description | +
|---|
| GraphListener
+ A listener that is notified when the graph changes.
+ |
+
| VertexSetListener
+ A listener that is notified when the graph's vertex set changes.
+ |
+
| Class and Description | +
|---|
| GraphEdgeChangeEvent
+ An event which indicates that a graph edge has changed, or is about to
+ change.
+ |
+
| GraphListener
+ A listener that is notified when the graph changes.
+ |
+
| GraphVertexChangeEvent
+ An event which indicates that a graph vertex has changed, or is about to
+ change.
+ |
+
| VertexSetListener
+ A listener that is notified when the graph's vertex set changes.
+ |
+
| Class and Description | +
|---|
| ConnectedComponentTraversalEvent
+ A traversal event with respect to a connected component.
+ |
+
| EdgeTraversalEvent
+ A traversal event for a graph edge.
+ |
+
| GraphChangeEvent
+ An event which indicates that a graph has changed.
+ |
+
| GraphEdgeChangeEvent
+ An event which indicates that a graph edge has changed, or is about to
+ change.
+ |
+
| GraphVertexChangeEvent
+ An event which indicates that a graph vertex has changed, or is about to
+ change.
+ |
+
| TraversalListener
+ A listener on graph iterator or on a graph traverser.
+ |
+
| VertexSetListener
+ A listener that is notified when the graph's vertex set changes.
+ |
+
| VertexTraversalEvent
+ A traversal event for a graph vertex.
+ |
+
| Class and Description | +
|---|
| GraphEdgeChangeEvent
+ An event which indicates that a graph edge has changed, or is about to
+ change.
+ |
+
| GraphListener
+ A listener that is notified when the graph changes.
+ |
+
| GraphVertexChangeEvent
+ An event which indicates that a graph vertex has changed, or is about to
+ change.
+ |
+
| VertexSetListener
+ A listener that is notified when the graph's vertex set changes.
+ |
+
| Class and Description | +
|---|
| GraphListener
+ A listener that is notified when the graph changes.
+ |
+
| VertexSetListener
+ A listener that is notified when the graph's vertex set changes.
+ |
+
| Class and Description | +
|---|
| ConnectedComponentTraversalEvent
+ A traversal event with respect to a connected component.
+ |
+
| EdgeTraversalEvent
+ A traversal event for a graph edge.
+ |
+
| TraversalListener
+ A listener on graph iterator or on a graph traverser.
+ |
+
| VertexTraversalEvent
+ A traversal event for a graph vertex.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/GraphReader.html b/javadoc/org/jgrapht/experimental/GraphReader.html new file mode 100644 index 0000000..6f326c4 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/GraphReader.html @@ -0,0 +1,310 @@ + + + + + + +public class GraphReader<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
GraphReader(Reader input)
+Construct a new GraphReader.
+ |
+
GraphReader(Reader input,
+ double defaultWeight)
+Construct a new GraphReader.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public GraphReader(Reader input) + throws IOException+
IOExceptionpublic GraphReader(Reader input, + double defaultWeight) + throws IOException+
IOExceptionpublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/GraphSquare.html b/javadoc/org/jgrapht/experimental/GraphSquare.html new file mode 100644 index 0000000..3a12de2 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/GraphSquare.html @@ -0,0 +1,625 @@ + + + + + + +public class GraphSquare<V,E> +extends AbstractBaseGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
GraphSquare(Graph<V,E> g,
+ boolean createLoops)
+Constructor for GraphSquare.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
boolean |
+removeAllEdges(Collection<? extends E> edges)
+Removes all the edges in this graph that are also contained in the
+ specified edge collection.
+ |
+
Set<E> |
+removeAllEdges(V sourceVertex,
+ V targetVertex)
+Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges.
+ |
+
boolean |
+removeAllVertices(Collection<? extends V> vertices)
+Removes all the vertices in this graph that are also contained in the
+ specified vertex collection.
+ |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdgepublic E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>addEdge in class AbstractBaseGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>addEdge in class AbstractBaseGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.addVertex in interface Graph<V,E>addVertex in class AbstractBaseGraph<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)public boolean removeAllEdges(Collection<? extends E> edges)+
GraphGraph.removeEdge(Object) method.removeAllEdges in interface Graph<V,E>removeAllEdges in class AbstractGraph<V,E>edges - edges to be removed from this graph.Graph.removeAllEdges(Collection)public Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
Graphnull if any of the specified vertices does not exist in the
+ graph. If both vertices exist but no edge is found, returns an empty set.
+ This method will either invoke the Graph.removeEdge(Object) method, or
+ the Graph.removeEdge(Object, Object) method.removeAllEdges in interface Graph<V,E>removeAllEdges in class AbstractGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if either vertex is not
+ part of graphGraph.removeAllEdges(Object, Object)public boolean removeAllVertices(Collection<? extends V> vertices)+
GraphGraph.removeVertex(Object) method.removeAllVertices in interface Graph<V,E>removeAllVertices in class AbstractGraph<V,E>vertices - vertices to be removed from this graph.Graph.removeAllVertices(Collection)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
removeEdge in interface Graph<V,E>removeEdge in class AbstractBaseGraph<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>removeEdge in class AbstractBaseGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>removeVertex in class AbstractBaseGraph<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/GraphTests.html b/javadoc/org/jgrapht/experimental/GraphTests.html new file mode 100644 index 0000000..836b4b8 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/GraphTests.html @@ -0,0 +1,276 @@ + + + + + + +public final class GraphTests<V,E> +extends Object+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> boolean |
+isBipartite(Graph<V,E> g) |
+
static <V,E> boolean |
+isComplete(Graph<V,E> g) |
+
static <V,E> boolean |
+isConnected(Graph<V,E> g) |
+
static <V,E> boolean |
+isEmpty(Graph<V,E> g) |
+
static <V,E> boolean |
+isTree(Graph<V,E> g) |
+
public static <V,E> boolean isEmpty(Graph<V,E> g)+
public static <V,E> boolean isComplete(Graph<V,E> g)+
public static <V,E> boolean isConnected(Graph<V,E> g)+
public static <V,E> boolean isTree(Graph<V,E> g)+
public static <V,E> boolean isBipartite(Graph<V,E> g)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/PartiteRandomGraphGenerator.html b/javadoc/org/jgrapht/experimental/PartiteRandomGraphGenerator.html new file mode 100644 index 0000000..9c7e30c --- /dev/null +++ b/javadoc/org/jgrapht/experimental/PartiteRandomGraphGenerator.html @@ -0,0 +1,314 @@ + + + + + + +public class PartiteRandomGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,Object[]>+
| Constructor and Description | +
|---|
PartiteRandomGraphGenerator(int[] numVertices,
+ int numEdges)
+Construct a new PartiteRandomGraphGenerator for a k-partite graph.
+ |
+
PartiteRandomGraphGenerator(int numVertices1,
+ int numVertices2,
+ int numEdges)
+Construct a new PartiteRandomGraphGenerator for a bipartite graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,Object[]> resultMap)
+TODO hb 30-nov-05: document me
+ |
+
public PartiteRandomGraphGenerator(int numVertices1, + int numVertices2, + int numEdges)+
numVertices1 - number of vertices in the first partitionnumVertices2 - number of vertices in the second partitionnumEdges - number of edges to be generatedIllegalArgumentExceptionpublic PartiteRandomGraphGenerator(int[] numVertices, + int numEdges)+
numVertices - number of vertices in the k partitionsnumEdges - number of edges to be generated between any two
+ partitionsIllegalArgumentExceptionpublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,Object[]> resultMap)+
generateGraph in interface GraphGenerator<V,E,Object[]>target - vertexFactory - resultMap - some array of verticesGraphGenerator.generateGraph(org.jgrapht.Graph<V, E>, org.jgrapht.VertexFactory<V>, java.util.Map<java.lang.String, T>)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/RandomGraphHelper.html b/javadoc/org/jgrapht/experimental/RandomGraphHelper.html new file mode 100644 index 0000000..f7868df --- /dev/null +++ b/javadoc/org/jgrapht/experimental/RandomGraphHelper.html @@ -0,0 +1,261 @@ + + + + + + +public final class RandomGraphHelper +extends Object+
| Modifier and Type | +Method and Description | +
|---|---|
static void |
+addEdges(Graph target,
+ List sourceVertices,
+ List destVertices,
+ int numEdges) |
+
static Object[] |
+addVertices(Graph target,
+ VertexFactory vertexFactory,
+ int numVertices)
+.
+ |
+
public static void addEdges(Graph target, + List sourceVertices, + List destVertices, + int numEdges)+ +
public static Object[] addVertices(Graph target, + VertexFactory vertexFactory, + int numVertices)+
target - vertexFactory - numVertices - Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/UniformRandomGraphGenerator.html b/javadoc/org/jgrapht/experimental/UniformRandomGraphGenerator.html new file mode 100644 index 0000000..30b9fde --- /dev/null +++ b/javadoc/org/jgrapht/experimental/UniformRandomGraphGenerator.html @@ -0,0 +1,301 @@ + + + + + + +public class UniformRandomGraphGenerator +extends Object +implements GraphGenerator+
| Constructor and Description | +
|---|
UniformRandomGraphGenerator(int numVertices,
+ int numEdges)
+Construct a new UniformRandomGraphGenerator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph target,
+ VertexFactory vertexFactory,
+ Map resultMap)
+Generate a graph structure.
+ |
+
public UniformRandomGraphGenerator(int numVertices, + int numEdges)+
numVertices - number of vertices to be generatednumEdges - number of edges to be generatedIllegalArgumentExceptionpublic void generateGraph(Graph target, + VertexFactory vertexFactory, + Map resultMap)+
GraphGeneratorgenerateGraph in interface GraphGeneratortarget - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)GraphGenerator.generateGraph(org.jgrapht.Graph<V, E>, org.jgrapht.VertexFactory<V>, java.util.Map<java.lang.String, T>)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/ApproximationAlgorithm.html b/javadoc/org/jgrapht/experimental/alg/ApproximationAlgorithm.html new file mode 100644 index 0000000..587cbe1 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/ApproximationAlgorithm.html @@ -0,0 +1,238 @@ + + + + + + +public interface ApproximationAlgorithm<ResultType,V>
+| Modifier and Type | +Method and Description | +
|---|---|
ResultType |
+getLowerBound(Map<V,Object> optionalData) |
+
ResultType |
+getUpperBound(Map<V,Object> optionalData) |
+
boolean |
+isExact() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/ExactAlgorithm.html b/javadoc/org/jgrapht/experimental/alg/ExactAlgorithm.html new file mode 100644 index 0000000..eb950fe --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/ExactAlgorithm.html @@ -0,0 +1,212 @@ + + + + + + +public interface ExactAlgorithm<ResultType,V>
+Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/IntArrayGraphAlgorithm.html b/javadoc/org/jgrapht/experimental/alg/IntArrayGraphAlgorithm.html new file mode 100644 index 0000000..c5516fe --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/IntArrayGraphAlgorithm.html @@ -0,0 +1,299 @@ + + + + + + +public abstract class IntArrayGraphAlgorithm<V,E> +extends Object+
| Modifier and Type | +Field and Description | +
|---|---|
protected int[][] |
+_neighbors |
+
protected Map<V,Integer> |
+_vertexToPos |
+
protected List<V> |
+_vertices |
+
| Constructor and Description | +
|---|
IntArrayGraphAlgorithm(Graph<V,E> g) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/class-use/ApproximationAlgorithm.html b/javadoc/org/jgrapht/experimental/alg/class-use/ApproximationAlgorithm.html new file mode 100644 index 0000000..1485ec9 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/class-use/ApproximationAlgorithm.html @@ -0,0 +1,157 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.alg.color | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GreedyColoring<V,E> |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/class-use/ExactAlgorithm.html b/javadoc/org/jgrapht/experimental/alg/class-use/ExactAlgorithm.html new file mode 100644 index 0000000..0f9d49a --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/class-use/ExactAlgorithm.html @@ -0,0 +1,157 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.alg.color | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+BrownBacktrackColoring<V,E> |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/class-use/IntArrayGraphAlgorithm.html b/javadoc/org/jgrapht/experimental/alg/class-use/IntArrayGraphAlgorithm.html new file mode 100644 index 0000000..1a7829d --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/class-use/IntArrayGraphAlgorithm.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.alg.color | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+BrownBacktrackColoring<V,E> |
+
class |
+GreedyColoring<V,E> |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/BrownBacktrackColoring.html b/javadoc/org/jgrapht/experimental/alg/color/BrownBacktrackColoring.html new file mode 100644 index 0000000..31c4b5c --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/BrownBacktrackColoring.html @@ -0,0 +1,290 @@ + + + + + + +public class BrownBacktrackColoring<V,E> +extends IntArrayGraphAlgorithm<V,E> +implements ExactAlgorithm<Integer,V>+
_neighbors, _vertexToPos, _vertices| Constructor and Description | +
|---|
BrownBacktrackColoring(Graph<V,E> g) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/GreedyColoring.html b/javadoc/org/jgrapht/experimental/alg/color/GreedyColoring.html new file mode 100644 index 0000000..54a1ef9 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/GreedyColoring.html @@ -0,0 +1,408 @@ + + + + + + +public class GreedyColoring<V,E> +extends IntArrayGraphAlgorithm<V,E> +implements ApproximationAlgorithm<Integer,V>+
| Modifier and Type | +Field and Description | +
|---|---|
static int |
+BEST_ORDER |
+
static int |
+LARGEST_SATURATION_FIRST_ORDER |
+
static int |
+NATURAL_ORDER |
+
static int |
+SMALLEST_DEGREE_LAST_ORDER |
+
_neighbors, _vertexToPos, _vertices| Constructor and Description | +
|---|
GreedyColoring(Graph<V,E> g) |
+
GreedyColoring(Graph<V,E> g,
+ int method) |
+
public static final int BEST_ORDER+
public static final int NATURAL_ORDER+
public static final int SMALLEST_DEGREE_LAST_ORDER+
public static final int LARGEST_SATURATION_FIRST_ORDER+
public Integer getLowerBound(Map<V,Object> optionalData)+
getLowerBound in interface ApproximationAlgorithm<Integer,V>public Integer getUpperBound(Map<V,Object> optionalData)+
getUpperBound in interface ApproximationAlgorithm<Integer,V>public boolean isExact()+
isExact in interface ApproximationAlgorithm<Integer,V>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/class-use/BrownBacktrackColoring.html b/javadoc/org/jgrapht/experimental/alg/color/class-use/BrownBacktrackColoring.html new file mode 100644 index 0000000..5578e21 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/class-use/BrownBacktrackColoring.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/class-use/GreedyColoring.html b/javadoc/org/jgrapht/experimental/alg/color/class-use/GreedyColoring.html new file mode 100644 index 0000000..f7a4eb1 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/class-use/GreedyColoring.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/package-frame.html b/javadoc/org/jgrapht/experimental/alg/color/package-frame.html new file mode 100644 index 0000000..67a81f4 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/package-frame.html @@ -0,0 +1,21 @@ + + + + + + +| Class | +Description | +
|---|---|
| BrownBacktrackColoring<V,E> | ++ |
| GreedyColoring<V,E> | ++ |
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/package-tree.html b/javadoc/org/jgrapht/experimental/alg/color/package-tree.html new file mode 100644 index 0000000..251daaa --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/package-tree.html @@ -0,0 +1,135 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/color/package-use.html b/javadoc/org/jgrapht/experimental/alg/color/package-use.html new file mode 100644 index 0000000..f1ab621 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/color/package-use.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/package-frame.html b/javadoc/org/jgrapht/experimental/alg/package-frame.html new file mode 100644 index 0000000..d27040c --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/package-frame.html @@ -0,0 +1,25 @@ + + + + + + +| Interface | +Description | +
|---|---|
| ApproximationAlgorithm<ResultType,V> | ++ |
| ExactAlgorithm<ResultType,V> | ++ |
| Class | +Description | +
|---|---|
| IntArrayGraphAlgorithm<V,E> | ++ |
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/package-tree.html b/javadoc/org/jgrapht/experimental/alg/package-tree.html new file mode 100644 index 0000000..24ac9db --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/package-tree.html @@ -0,0 +1,135 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/alg/package-use.html b/javadoc/org/jgrapht/experimental/alg/package-use.html new file mode 100644 index 0000000..f4aa888 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/alg/package-use.html @@ -0,0 +1,156 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.alg.color | ++ |
| Class and Description | +
|---|
| ApproximationAlgorithm | +
| ExactAlgorithm | +
| IntArrayGraphAlgorithm | +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/class-use/GraphReader.html b/javadoc/org/jgrapht/experimental/class-use/GraphReader.html new file mode 100644 index 0000000..908d9c7 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/class-use/GraphReader.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/class-use/GraphSquare.html b/javadoc/org/jgrapht/experimental/class-use/GraphSquare.html new file mode 100644 index 0000000..fb7b785 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/class-use/GraphSquare.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/class-use/GraphTests.html b/javadoc/org/jgrapht/experimental/class-use/GraphTests.html new file mode 100644 index 0000000..78c2988 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/class-use/GraphTests.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/class-use/PartiteRandomGraphGenerator.html b/javadoc/org/jgrapht/experimental/class-use/PartiteRandomGraphGenerator.html new file mode 100644 index 0000000..62b119c --- /dev/null +++ b/javadoc/org/jgrapht/experimental/class-use/PartiteRandomGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/class-use/RandomGraphHelper.html b/javadoc/org/jgrapht/experimental/class-use/RandomGraphHelper.html new file mode 100644 index 0000000..671494c --- /dev/null +++ b/javadoc/org/jgrapht/experimental/class-use/RandomGraphHelper.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/class-use/UniformRandomGraphGenerator.html b/javadoc/org/jgrapht/experimental/class-use/UniformRandomGraphGenerator.html new file mode 100644 index 0000000..d330acf --- /dev/null +++ b/javadoc/org/jgrapht/experimental/class-use/UniformRandomGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.CycleFoundException.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.CycleFoundException.html new file mode 100644 index 0000000..c73727c --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.CycleFoundException.html @@ -0,0 +1,259 @@ + + + + + + +public static class DirectedAcyclicGraph.CycleFoundException +extends Exception+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.CycleFoundException() |
+
addSuppressed, fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, getSuppressed, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toStringCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.Region.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.Region.html new file mode 100644 index 0000000..6299e01 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.Region.html @@ -0,0 +1,336 @@ + + + + + + +public static class DirectedAcyclicGraph.Region +extends Object +implements Serializable+
| Modifier and Type | +Field and Description | +
|---|---|
int |
+finish |
+
int |
+start |
+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.Region(int start,
+ int finish) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoOrderMapping.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoOrderMapping.html new file mode 100644 index 0000000..05513e5 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoOrderMapping.html @@ -0,0 +1,308 @@ + + + + + + +public static interface DirectedAcyclicGraph.TopoOrderMapping<V> +extends Serializable+
| Modifier and Type | +Method and Description | +
|---|---|
Integer |
+getTopologicalIndex(V vertex)
+get the topological index of the given vertex.
+ |
+
V |
+getVertex(Integer index)
+get the vertex at the given topological index.
+ |
+
void |
+putVertex(Integer index,
+ V vertex)
+add a vertex at the given topological index.
+ |
+
void |
+removeAllVertices()
+remove all vertices from the topological ordering
+ |
+
Integer |
+removeVertex(V vertex)
+remove the given vertex from the topological ordering
+ |
+
void putVertex(Integer index, + V vertex)+
index - vertex - V getVertex(Integer index)+
index - Integer getTopologicalIndex(V vertex)+
vertex - Integer removeVertex(V vertex)+
vertex - void removeAllVertices()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoOrderMappingFactory.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoOrderMappingFactory.html new file mode 100644 index 0000000..3a7fe24 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoOrderMappingFactory.html @@ -0,0 +1,216 @@ + + + + + + +public static interface DirectedAcyclicGraph.TopoOrderMappingFactory<V>
+| Modifier and Type | +Method and Description | +
|---|---|
DirectedAcyclicGraph.TopoOrderMapping<V> |
+getTopoOrderMapping() |
+
DirectedAcyclicGraph.TopoOrderMapping<V> getTopoOrderMapping()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoVertexMap.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoVertexMap.html new file mode 100644 index 0000000..a5ee1f3 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.TopoVertexMap.html @@ -0,0 +1,391 @@ + + + + + + +public class DirectedAcyclicGraph.TopoVertexMap +extends Object +implements DirectedAcyclicGraph.TopoOrderMapping<V>, DirectedAcyclicGraph.TopoOrderMappingFactory<V>+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.TopoVertexMap() |
+
| Modifier and Type | +Method and Description | +
|---|---|
Integer |
+getTopologicalIndex(V vertex)
+get the topological index of the given vertex.
+ |
+
DirectedAcyclicGraph.TopoOrderMapping<V> |
+getTopoOrderMapping() |
+
V |
+getVertex(Integer index)
+get the vertex at the given topological index.
+ |
+
void |
+putVertex(Integer index,
+ V vertex)
+add a vertex at the given topological index.
+ |
+
void |
+removeAllVertices()
+remove all vertices from the topological ordering
+ |
+
Integer |
+removeVertex(V vertex)
+remove the given vertex from the topological ordering
+ |
+
public DirectedAcyclicGraph.TopoVertexMap()+
public void putVertex(Integer index, + V vertex)+
DirectedAcyclicGraph.TopoOrderMappingputVertex in interface DirectedAcyclicGraph.TopoOrderMapping<V>public V getVertex(Integer index)+
DirectedAcyclicGraph.TopoOrderMappinggetVertex in interface DirectedAcyclicGraph.TopoOrderMapping<V>public Integer getTopologicalIndex(V vertex)+
DirectedAcyclicGraph.TopoOrderMappinggetTopologicalIndex in interface DirectedAcyclicGraph.TopoOrderMapping<V>public Integer removeVertex(V vertex)+
DirectedAcyclicGraph.TopoOrderMappingremoveVertex in interface DirectedAcyclicGraph.TopoOrderMapping<V>public void removeAllVertices()+
DirectedAcyclicGraph.TopoOrderMappingremoveAllVertices in interface DirectedAcyclicGraph.TopoOrderMapping<V>public DirectedAcyclicGraph.TopoOrderMapping<V> getTopoOrderMapping()+
getTopoOrderMapping in interface DirectedAcyclicGraph.TopoOrderMappingFactory<V>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.Visited.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.Visited.html new file mode 100644 index 0000000..3f7f8b4 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.Visited.html @@ -0,0 +1,264 @@ + + + + + + +public static interface DirectedAcyclicGraph.Visited
+| Modifier and Type | +Method and Description | +
|---|---|
void |
+clearVisited(int index)
+Clear the visited state of the given topological index
+ |
+
boolean |
+getVisited(int index)
+has the given topological index been visited?
+ |
+
void |
+setVisited(int index)
+mark the given topological index as visited
+ |
+
void setVisited(int index)+
index - the topological indexboolean getVisited(int index)+
index - the topological indexvoid clearVisited(int index) + throws UnsupportedOperationException+
index - UnsupportedOperationException - if the implementation doesn't
+ support (or doesn't need) clearance. For example, if the factory
+ vends a new instance every time, it is a waste of cycles to clear the
+ state after the search of the Affected Region is done, so an
+ UnsupportedOperationException *should* be thrown.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedArrayImpl.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedArrayImpl.html new file mode 100644 index 0000000..e49df37 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedArrayImpl.html @@ -0,0 +1,361 @@ + + + + + + +public static class DirectedAcyclicGraph.VisitedArrayImpl +extends Object +implements DirectedAcyclicGraph.Visited, DirectedAcyclicGraph.VisitedFactory+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.VisitedArrayImpl()
+Constructs empty factory instance
+ |
+
DirectedAcyclicGraph.VisitedArrayImpl(DirectedAcyclicGraph.Region region) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+clearVisited(int index)
+Clear the visited state of the given topological index
+ |
+
DirectedAcyclicGraph.Visited |
+getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
boolean |
+getVisited(int index)
+has the given topological index been visited?
+ |
+
void |
+setVisited(int index)
+mark the given topological index as visited
+ |
+
public DirectedAcyclicGraph.VisitedArrayImpl()+
public DirectedAcyclicGraph.VisitedArrayImpl(DirectedAcyclicGraph.Region region)+
public DirectedAcyclicGraph.Visited getInstance(DirectedAcyclicGraph.Region affectedRegion)+
getInstance in interface DirectedAcyclicGraph.VisitedFactorypublic void setVisited(int index)+
DirectedAcyclicGraph.VisitedsetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic boolean getVisited(int index)+
DirectedAcyclicGraph.VisitedgetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic void clearVisited(int index) + throws UnsupportedOperationException+
DirectedAcyclicGraph.VisitedclearVisited in interface DirectedAcyclicGraph.VisitedUnsupportedOperationException - if the implementation doesn't
+ support (or doesn't need) clearance. For example, if the factory
+ vends a new instance every time, it is a waste of cycles to clear the
+ state after the search of the Affected Region is done, so an
+ UnsupportedOperationException *should* be thrown.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedArrayListImpl.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedArrayListImpl.html new file mode 100644 index 0000000..256140e --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedArrayListImpl.html @@ -0,0 +1,348 @@ + + + + + + +public static class DirectedAcyclicGraph.VisitedArrayListImpl +extends Object +implements DirectedAcyclicGraph.Visited, DirectedAcyclicGraph.VisitedFactory+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.VisitedArrayListImpl() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+clearVisited(int index)
+Clear the visited state of the given topological index
+ |
+
DirectedAcyclicGraph.Visited |
+getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
boolean |
+getVisited(int index)
+has the given topological index been visited?
+ |
+
void |
+setVisited(int index)
+mark the given topological index as visited
+ |
+
public DirectedAcyclicGraph.VisitedArrayListImpl()+
public DirectedAcyclicGraph.Visited getInstance(DirectedAcyclicGraph.Region affectedRegion)+
getInstance in interface DirectedAcyclicGraph.VisitedFactorypublic void setVisited(int index)+
DirectedAcyclicGraph.VisitedsetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic boolean getVisited(int index)+
DirectedAcyclicGraph.VisitedgetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic void clearVisited(int index) + throws UnsupportedOperationException+
DirectedAcyclicGraph.VisitedclearVisited in interface DirectedAcyclicGraph.VisitedUnsupportedOperationException - if the implementation doesn't
+ support (or doesn't need) clearance. For example, if the factory
+ vends a new instance every time, it is a waste of cycles to clear the
+ state after the search of the Affected Region is done, so an
+ UnsupportedOperationException *should* be thrown.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedBitSetImpl.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedBitSetImpl.html new file mode 100644 index 0000000..36cef9a --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedBitSetImpl.html @@ -0,0 +1,345 @@ + + + + + + +public static class DirectedAcyclicGraph.VisitedBitSetImpl +extends Object +implements DirectedAcyclicGraph.Visited, DirectedAcyclicGraph.VisitedFactory+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.VisitedBitSetImpl() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+clearVisited(int index)
+Clear the visited state of the given topological index
+ |
+
DirectedAcyclicGraph.Visited |
+getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
boolean |
+getVisited(int index)
+has the given topological index been visited?
+ |
+
void |
+setVisited(int index)
+mark the given topological index as visited
+ |
+
public DirectedAcyclicGraph.VisitedBitSetImpl()+
public DirectedAcyclicGraph.Visited getInstance(DirectedAcyclicGraph.Region affectedRegion)+
getInstance in interface DirectedAcyclicGraph.VisitedFactorypublic void setVisited(int index)+
DirectedAcyclicGraph.VisitedsetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic boolean getVisited(int index)+
DirectedAcyclicGraph.VisitedgetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic void clearVisited(int index) + throws UnsupportedOperationException+
DirectedAcyclicGraph.VisitedclearVisited in interface DirectedAcyclicGraph.VisitedUnsupportedOperationException - if the implementation doesn't
+ support (or doesn't need) clearance. For example, if the factory
+ vends a new instance every time, it is a waste of cycles to clear the
+ state after the search of the Affected Region is done, so an
+ UnsupportedOperationException *should* be thrown.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedFactory.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedFactory.html new file mode 100644 index 0000000..fb9649a --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedFactory.html @@ -0,0 +1,224 @@ + + + + + + +public static interface DirectedAcyclicGraph.VisitedFactory +extends Serializable+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedAcyclicGraph.Visited |
+getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited getInstance(DirectedAcyclicGraph.Region affectedRegion)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedHashSetImpl.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedHashSetImpl.html new file mode 100644 index 0000000..078406b --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.VisitedHashSetImpl.html @@ -0,0 +1,347 @@ + + + + + + +public static class DirectedAcyclicGraph.VisitedHashSetImpl +extends Object +implements DirectedAcyclicGraph.Visited, DirectedAcyclicGraph.VisitedFactory+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.VisitedHashSetImpl() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+clearVisited(int index)
+Clear the visited state of the given topological index
+ |
+
DirectedAcyclicGraph.Visited |
+getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
boolean |
+getVisited(int index)
+has the given topological index been visited?
+ |
+
void |
+setVisited(int index)
+mark the given topological index as visited
+ |
+
public DirectedAcyclicGraph.VisitedHashSetImpl()+
public DirectedAcyclicGraph.Visited getInstance(DirectedAcyclicGraph.Region affectedRegion)+
getInstance in interface DirectedAcyclicGraph.VisitedFactorypublic void setVisited(int index)+
DirectedAcyclicGraph.VisitedsetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic boolean getVisited(int index)+
DirectedAcyclicGraph.VisitedgetVisited in interface DirectedAcyclicGraph.Visitedindex - the topological indexpublic void clearVisited(int index) + throws UnsupportedOperationException+
DirectedAcyclicGraph.VisitedclearVisited in interface DirectedAcyclicGraph.VisitedUnsupportedOperationException - if the implementation doesn't
+ support (or doesn't need) clearance. For example, if the factory
+ vends a new instance every time, it is a waste of cycles to clear the
+ state after the search of the Affected Region is done, so an
+ UnsupportedOperationException *should* be thrown.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.html b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.html new file mode 100644 index 0000000..72d50f1 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/DirectedAcyclicGraph.html @@ -0,0 +1,716 @@ + + + + + + +public class DirectedAcyclicGraph<V,E> +extends SimpleDirectedGraph<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.
+ +This is done using a dynamic topological sort which is based on the + algorithm PK described in "D. Pearce & P. Kelly, 2007: A Dynamic + Topological Sort Algorithm for Directed Acyclic Graphs", (see Paper or ACM link for details). +
+ +The implementation differs from the algorithm specified in the above paper + in some ways, perhaps most notably in that the topological ordering is stored + by default using two HashMaps, which will have some effects on runtime, but + also allows for vertex addition and removal, and other operations which are + helpful for manipulating or combining DAGs. This storage mechanism is + pluggable for subclassers.
+ +This class makes no claims to thread safety, and concurrent usage from + multiple threads will produce undefined results.
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+DirectedAcyclicGraph.CycleFoundException
+Exception used in dfsF when a cycle is found
+ |
+
static class |
+DirectedAcyclicGraph.Region
+Region is an *inclusive* range of indices.
+ |
+
static interface |
+DirectedAcyclicGraph.TopoOrderMapping<V>
+For performance tuning, an interface for storing the topological ordering
+ |
+
static interface |
+DirectedAcyclicGraph.TopoOrderMappingFactory<V> |
+
class |
+DirectedAcyclicGraph.TopoVertexMap
+For performance and flexibility uses an ArrayList for topological index
+ to vertex mapping, and a HashMap for vertex to topological index mapping.
+ |
+
static interface |
+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
+ of the interface).
+ |
+
static class |
+DirectedAcyclicGraph.VisitedArrayImpl
+This implementation, somewhat to my surprise, is slower than the
+ ArrayList version, probably due to its reallocation of the underlying
+ array for every topology reorder that is required.
+ |
+
static class |
+DirectedAcyclicGraph.VisitedArrayListImpl
+This implementation seems to offer the best performance in most cases.
+ |
+
static class |
+DirectedAcyclicGraph.VisitedBitSetImpl
+This implementation is close to the performance of VisitedArrayListImpl,
+ with 1/8 the memory usage.
+ |
+
static interface |
+DirectedAcyclicGraph.VisitedFactory
+interface for a factory that vends Visited implementations
+ |
+
static class |
+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).
+ |
+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
DirectedAcyclicGraph(Class<? extends E> arg0) |
+
DirectedAcyclicGraph(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addDagEdge(V fromVertex,
+ V toVertex)
+Adds the given edge and updates the internal topological order for
+ consistency IFF
+
+
+ there is not already an edge (fromVertex, toVertex) in the graph
+ the edge does not induce a cycle in the graph
+
+ |
+
boolean |
+addDagEdge(V fromVertex,
+ V toVertex,
+ E e)
+Adds the given edge and updates the internal topological order for
+ consistency IFF
+
+
+ the given edge is not already a member of the graph
+ there is not already an edge (fromVertex, toVertex) in the graph
+ the edge does not induce a cycle in the graph
+
+ |
+
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+identical to
+addDagEdge(Object, Object), except an unchecked
+ IllegalArgumentException is thrown if a cycle would have been
+ induced by this edge |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E edge)
+identical to
+addDagEdge(Object, Object, Object), except an
+ unchecked IllegalArgumentException is thrown if a cycle would
+ have been induced by this edge |
+
boolean |
+addVertex(V v)
+adds the vertex if it wasn't already in the graph, and puts it at the top
+ of the internal topological vertex ordering
+ |
+
boolean |
+addVertex(V v,
+ boolean addToTop)
+adds the vertex if it wasn't already in the graph, and puts it either at
+ the top or the bottom of the topological ordering, depending on the value
+ of addToTop.
+ |
+
Iterator<V> |
+iterator()
+iterator will traverse the vertices in topological order, meaning that
+ for a directed graph G = (V,E), if there exists a path from vertex va to
+ vertex vb then va is guaranteed to come before vertex vb in the iteration
+ order.
+ |
+
boolean |
+removeAllVertices(Collection<? extends V> arg0)
+Removes all the vertices in this graph that are also contained in the
+ specified vertex collection.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
builder, builderclone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfcontainsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeEdge, removeEdge, vertexSetpublic DirectedAcyclicGraph(EdgeFactory<V,E> ef)+
public Iterator<V> iterator()+
public boolean addVertex(V v)+
addVertex in interface Graph<V,E>addVertex in class AbstractBaseGraph<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)public boolean addVertex(V v, + boolean addToTop)+
v - addToTop - public E addDagEdge(V fromVertex, + V toVertex) + throws DirectedAcyclicGraph.CycleFoundException+
Adds the given edge and updates the internal topological order for + consistency IFF + +
IllegalArgumentException - If either fromVertex or toVertex is not
+ a member of the graphDirectedAcyclicGraph.CycleFoundException - if the edge would induce a cycle in the graphGraph.addEdge(Object, Object, Object)public E addEdge(V sourceVertex, + V targetVertex)+
addDagEdge(Object, Object), except an unchecked
+ IllegalArgumentException is thrown if a cycle would have been
+ induced by this edgeaddEdge in interface Graph<V,E>addEdge in class AbstractBaseGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addDagEdge(V fromVertex, + V toVertex, + E e) + throws DirectedAcyclicGraph.CycleFoundException+
Adds the given edge and updates the internal topological order for + consistency IFF + +
DirectedAcyclicGraph.CycleFoundException - if adding an edge (fromVertex, toVertex) to
+ the graph would induce a cycle.Graph.addEdge(Object, Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E edge)+
addDagEdge(Object, Object, Object), except an
+ unchecked IllegalArgumentException is thrown if a cycle would
+ have been induced by this edgeaddEdge in interface Graph<V,E>addEdge in class AbstractBaseGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.edge - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>removeVertex in class AbstractBaseGraph<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)public boolean removeAllVertices(Collection<? extends V> arg0)+
GraphGraph.removeVertex(Object) method.removeAllVertices in interface Graph<V,E>removeAllVertices in class AbstractGraph<V,E>arg0 - vertices to be removed from this graph.Graph.removeAllVertices(Collection)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.CycleFoundException.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.CycleFoundException.html new file mode 100644 index 0000000..2a346b3 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.CycleFoundException.html @@ -0,0 +1,181 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Modifier and Type | +Method and Description | +
|---|---|
E |
+DirectedAcyclicGraph.addDagEdge(V fromVertex,
+ V toVertex)
+Adds the given edge and updates the internal topological order for
+ consistency IFF
+
+
+ there is not already an edge (fromVertex, toVertex) in the graph
+ the edge does not induce a cycle in the graph
+
+ |
+
boolean |
+DirectedAcyclicGraph.addDagEdge(V fromVertex,
+ V toVertex,
+ E e)
+Adds the given edge and updates the internal topological order for
+ consistency IFF
+
+
+ the given edge is not already a member of the graph
+ there is not already an edge (fromVertex, toVertex) in the graph
+ the edge does not induce a cycle in the graph
+
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.Region.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.Region.html new file mode 100644 index 0000000..60e8d05 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.Region.html @@ -0,0 +1,184 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Modifier and Type | +Method and Description | +
|---|---|
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedFactory.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedBitSetImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedArrayListImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedHashSetImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedArrayImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
| Constructor and Description | +
|---|
DirectedAcyclicGraph.VisitedArrayImpl(DirectedAcyclicGraph.Region region) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoOrderMapping.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoOrderMapping.html new file mode 100644 index 0000000..e597305 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoOrderMapping.html @@ -0,0 +1,177 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedAcyclicGraph.TopoVertexMap
+For performance and flexibility uses an ArrayList for topological index
+ to vertex mapping, and a HashMap for vertex to topological index mapping.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedAcyclicGraph.TopoOrderMapping<V> |
+DirectedAcyclicGraph.TopoOrderMappingFactory.getTopoOrderMapping() |
+
DirectedAcyclicGraph.TopoOrderMapping<V> |
+DirectedAcyclicGraph.TopoVertexMap.getTopoOrderMapping() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoOrderMappingFactory.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoOrderMappingFactory.html new file mode 100644 index 0000000..27f9be3 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoOrderMappingFactory.html @@ -0,0 +1,160 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedAcyclicGraph.TopoVertexMap
+For performance and flexibility uses an ArrayList for topological index
+ to vertex mapping, and a HashMap for vertex to topological index mapping.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoVertexMap.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoVertexMap.html new file mode 100644 index 0000000..c1bb34f --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.TopoVertexMap.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.Visited.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.Visited.html new file mode 100644 index 0000000..ed76403 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.Visited.html @@ -0,0 +1,210 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+DirectedAcyclicGraph.VisitedArrayImpl
+This implementation, somewhat to my surprise, is slower than the
+ ArrayList version, probably due to its reallocation of the underlying
+ array for every topology reorder that is required.
+ |
+
static class |
+DirectedAcyclicGraph.VisitedArrayListImpl
+This implementation seems to offer the best performance in most cases.
+ |
+
static class |
+DirectedAcyclicGraph.VisitedBitSetImpl
+This implementation is close to the performance of VisitedArrayListImpl,
+ with 1/8 the memory usage.
+ |
+
static class |
+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).
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedFactory.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedBitSetImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedArrayListImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedHashSetImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
DirectedAcyclicGraph.Visited |
+DirectedAcyclicGraph.VisitedArrayImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedArrayImpl.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedArrayImpl.html new file mode 100644 index 0000000..4a346f7 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedArrayImpl.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedArrayListImpl.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedArrayListImpl.html new file mode 100644 index 0000000..680f00d --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedArrayListImpl.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedBitSetImpl.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedBitSetImpl.html new file mode 100644 index 0000000..2a1e505 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedBitSetImpl.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedFactory.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedFactory.html new file mode 100644 index 0000000..1a8e619 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedFactory.html @@ -0,0 +1,181 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+DirectedAcyclicGraph.VisitedArrayImpl
+This implementation, somewhat to my surprise, is slower than the
+ ArrayList version, probably due to its reallocation of the underlying
+ array for every topology reorder that is required.
+ |
+
static class |
+DirectedAcyclicGraph.VisitedArrayListImpl
+This implementation seems to offer the best performance in most cases.
+ |
+
static class |
+DirectedAcyclicGraph.VisitedBitSetImpl
+This implementation is close to the performance of VisitedArrayListImpl,
+ with 1/8 the memory usage.
+ |
+
static class |
+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).
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedHashSetImpl.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedHashSetImpl.html new file mode 100644 index 0000000..30c00b3 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.VisitedHashSetImpl.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.html b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.html new file mode 100644 index 0000000..68eba4e --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/class-use/DirectedAcyclicGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/package-frame.html b/javadoc/org/jgrapht/experimental/dag/package-frame.html new file mode 100644 index 0000000..2c1ce0e --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/package-frame.html @@ -0,0 +1,36 @@ + + + + + + +| Interface | +Description | +
|---|---|
| DirectedAcyclicGraph.TopoOrderMapping<V> | +
+ For performance tuning, an interface for storing the topological ordering
+ |
+
| DirectedAcyclicGraph.TopoOrderMappingFactory<V> | ++ |
| 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
+ of the interface).
+ |
+
| DirectedAcyclicGraph.VisitedFactory | +
+ interface for a factory that vends Visited implementations
+ |
+
| Class | +Description | +
|---|---|
| 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.
+ |
+
| DirectedAcyclicGraph.Region | +
+ Region is an *inclusive* range of indices.
+ |
+
| DirectedAcyclicGraph.VisitedArrayImpl | +
+ This implementation, somewhat to my surprise, is slower than the
+ ArrayList version, probably due to its reallocation of the underlying
+ array for every topology reorder that is required.
+ |
+
| DirectedAcyclicGraph.VisitedArrayListImpl | +
+ This implementation seems to offer the best performance in most cases.
+ |
+
| DirectedAcyclicGraph.VisitedBitSetImpl | +
+ This implementation is close to the performance of VisitedArrayListImpl,
+ with 1/8 the memory usage.
+ |
+
| 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).
+ |
+
| Exception | +Description | +
|---|---|
| DirectedAcyclicGraph.CycleFoundException | +
+ Exception used in dfsF when a cycle is found
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/package-tree.html b/javadoc/org/jgrapht/experimental/dag/package-tree.html new file mode 100644 index 0000000..5596ec6 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/package-tree.html @@ -0,0 +1,168 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/dag/package-use.html b/javadoc/org/jgrapht/experimental/dag/package-use.html new file mode 100644 index 0000000..e2eef9a --- /dev/null +++ b/javadoc/org/jgrapht/experimental/dag/package-use.html @@ -0,0 +1,177 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.experimental.dag | ++ |
| Class and Description | +
|---|
| DirectedAcyclicGraph.CycleFoundException
+ Exception used in dfsF when a cycle is found
+ |
+
| DirectedAcyclicGraph.Region
+ Region is an *inclusive* range of indices.
+ |
+
| DirectedAcyclicGraph.TopoOrderMapping
+ For performance tuning, an interface for storing the topological ordering
+ |
+
| DirectedAcyclicGraph.TopoOrderMappingFactory | +
| 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
+ of the interface).
+ |
+
| DirectedAcyclicGraph.VisitedFactory
+ interface for a factory that vends Visited implementations
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/package-frame.html b/javadoc/org/jgrapht/experimental/package-frame.html new file mode 100644 index 0000000..1c51754 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/package-frame.html @@ -0,0 +1,25 @@ + + + + + + +See: Description
+| Class | +Description | +
|---|---|
| GraphReader<V,E> | ++ |
| GraphSquare<V,E> | +
+ DOCUMENT ME!
+ |
+
| GraphTests<V,E> | ++ |
| PartiteRandomGraphGenerator<V,E> | +
+ PartiteRandomGraphGenerator generates a partite uniform random
+ graph of any size.
+ |
+
| RandomGraphHelper | +
+ UniformRandomGraphGenerator generates a uniform random graph
+ of any size.
+ |
+
| UniformRandomGraphGenerator | +
+ UniformRandomGraphGenerator generates a uniform random graph
+ of any size.
+ |
+
A package that contains experimental work or work-in-progress that +is not yet ready to be included in a release. It may contain classes +that are: incomplete, not yet documented, have not yet reached a +satisfying form, etc.
+ +The only requirement for classes included here is to compile.
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/package-tree.html b/javadoc/org/jgrapht/experimental/package-tree.html new file mode 100644 index 0000000..6b0e7ba --- /dev/null +++ b/javadoc/org/jgrapht/experimental/package-tree.html @@ -0,0 +1,143 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/experimental/package-use.html b/javadoc/org/jgrapht/experimental/package-use.html new file mode 100644 index 0000000..77b0264 --- /dev/null +++ b/javadoc/org/jgrapht/experimental/package-use.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/ComponentAttributeProvider.html b/javadoc/org/jgrapht/ext/ComponentAttributeProvider.html new file mode 100644 index 0000000..ab07397 --- /dev/null +++ b/javadoc/org/jgrapht/ext/ComponentAttributeProvider.html @@ -0,0 +1,222 @@ + + + + + + +public interface ComponentAttributeProvider<T>
+Map<String,String> getComponentAttributes(T component)+
component - vertex or edge for which attributes are to be obtainedCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/DOTExporter.html b/javadoc/org/jgrapht/ext/DOTExporter.html new file mode 100644 index 0000000..b7b8f01 --- /dev/null +++ b/javadoc/org/jgrapht/ext/DOTExporter.html @@ -0,0 +1,333 @@ + + + + + + +public class DOTExporter<V,E> +extends Object+
For a description of the format see + http://en.wikipedia.org/wiki/DOT_language.
| Constructor and Description | +
|---|
DOTExporter()
+Constructs a new DOTExporter object with an integer name provider for the
+ vertex IDs and null providers for the vertex and edge labels.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new DOTExporter object with the given ID and label
+ providers.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider,
+ ComponentAttributeProvider<V> vertexAttributeProvider,
+ ComponentAttributeProvider<E> edgeAttributeProvider)
+Constructs a new DOTExporter object with the given ID, label, and
+ attribute providers.
+ |
+
public DOTExporter()+
public DOTExporter(VertexNameProvider<V> vertexIDProvider, + VertexNameProvider<V> vertexLabelProvider, + EdgeNameProvider<E> edgeLabelProvider)+
vertexIDProvider - for generating vertex IDs. Must not be null.vertexLabelProvider - for generating vertex labels. If null, vertex
+ labels will not be written to the file.edgeLabelProvider - for generating edge labels. If null, edge labels
+ will not be written to the file.public DOTExporter(VertexNameProvider<V> vertexIDProvider, + VertexNameProvider<V> vertexLabelProvider, + EdgeNameProvider<E> edgeLabelProvider, + ComponentAttributeProvider<V> vertexAttributeProvider, + ComponentAttributeProvider<E> edgeAttributeProvider)+
vertexIDProvider - for generating vertex IDs. Must not be null.vertexLabelProvider - for generating vertex labels. If null, vertex
+ labels will not be written to the file (unless an attribute provider is
+ supplied which also supplies labels).edgeLabelProvider - for generating edge labels. If null, edge labels
+ will not be written to the file.vertexAttributeProvider - for generating vertex attributes. If null,
+ vertex attributes will not be written to the file.edgeAttributeProvider - for generating edge attributes. If null,
+ edge attributes will not be written to the file.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/DOTImporter.html b/javadoc/org/jgrapht/ext/DOTImporter.html new file mode 100644 index 0000000..979b7dc --- /dev/null +++ b/javadoc/org/jgrapht/ext/DOTImporter.html @@ -0,0 +1,348 @@ + + + + + + +public class DOTImporter<V,E> +extends Object+
For a description of the format see + http://en.wikipedia.org/wiki/DOT_language and + http://www.graphviz.org/doc/info/lang.html
+ + state machine description (In dot format naturally): + +
+
+ digraph G {
+ 1 [label="start" description="Entry point"];
+ 2 [label="header" description="Processing The header"];
+ 3 [label="next" description="work out what the type of the next node is"];
+ 4 [label="edge" description="process an edge entry"];
+ 5 [label="edge_quotes" description="process a section of an edge in quotes"];
+ 6 [label="node" description="process a node entry"];
+ 7 [label="node_quotes" description="process a section of a node in quotes"];
+ 8 [label="line_comment" description="process and ignore a line comment"];
+ 9 [label="block_comment" description="process and ignore a block comment"];
+ 10 [label="done" description="exit point"];
+ 1 -> 2;
+ 2 -> 3;
+ 3 -> 4;
+ 4 -> 3;
+ 4 -> 5;
+ 5 -> 4;
+ 3 -> 6;
+ 6 -> 3;
+ 6 -> 7;
+ 7 -> 6;
+ 3 -> 10;
+ 2 -> 8;
+ 8 -> 2;
+ 2 -> 9;
+ 9 -> 2;
+ 3 -> 8;
+ 8 -> 3;
+ 3 -> 9;
+ 9 -> 3;
+ 4 -> 8;
+ 8 -> 4;
+ 4 -> 9;
+ 9 -> 4;
+ 6 -> 8;
+ 8 -> 6;
+ 6 -> 9;
+ 9 -> 6;
+ }
+
+ | Constructor and Description | +
|---|
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider)
+Constructs a new DOTImporter with the given providers
+ |
+
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider,
+ VertexUpdater<V> updater)
+Constructs a new DOTImporter with the given providers
+ |
+
public DOTImporter(VertexProvider<V> vertexProvider, + EdgeProvider<V,E> edgeProvider)+
vertexProvider - Provider to create a vertexedgeProvider - Provider to create an edgepublic DOTImporter(VertexProvider<V> vertexProvider, + EdgeProvider<V,E> edgeProvider, + VertexUpdater<V> updater)+
vertexProvider - Provider to create a vertexedgeProvider - Provider to create an edgeupdater - Method used to update an existing Vertexpublic void read(String input, + AbstractBaseGraph<V,E> graph) + throws ImportException+
input - the content of a dot file.graph - the graph to update.ImportException - if there is a problem parsing the file.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/EdgeNameProvider.html b/javadoc/org/jgrapht/ext/EdgeNameProvider.html new file mode 100644 index 0000000..7ec14b8 --- /dev/null +++ b/javadoc/org/jgrapht/ext/EdgeNameProvider.html @@ -0,0 +1,221 @@ + + + + + + +public interface EdgeNameProvider<E>
+| Modifier and Type | +Method and Description | +
|---|---|
String |
+getEdgeName(E edge)
+Returns a unique name for an edge.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/EdgeProvider.html b/javadoc/org/jgrapht/ext/EdgeProvider.html new file mode 100644 index 0000000..53b1670 --- /dev/null +++ b/javadoc/org/jgrapht/ext/EdgeProvider.html @@ -0,0 +1,223 @@ + + + + + + +V - the type of vertex being linked.E - the type of edge being created.public interface EdgeProvider<V,E>
+Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/GmlExporter.html b/javadoc/org/jgrapht/ext/GmlExporter.html new file mode 100644 index 0000000..fc0b62f --- /dev/null +++ b/javadoc/org/jgrapht/ext/GmlExporter.html @@ -0,0 +1,454 @@ + + + + + + +public class GmlExporter<V,E> +extends Object+
For a description of the format see + http://www.infosun.fmi.uni-passau.de/Graphlet/GML/.
+ +The objects associated with vertices and edges are exported as labels
+ using their toString() implementation. See the setPrintLabels(Integer) method. The default behavior is to export no label
+ information.
| Modifier and Type | +Field and Description | +
|---|---|
static Integer |
+PRINT_EDGE_LABELS
+Option to export only the edge labels.
+ |
+
static Integer |
+PRINT_EDGE_VERTEX_LABELS
+Option to export both edge and vertex labels.
+ |
+
static Integer |
+PRINT_NO_LABELS
+Option to export no vertex or edge labels.
+ |
+
static Integer |
+PRINT_VERTEX_LABELS
+Option to export only the vertex labels.
+ |
+
| Constructor and Description | +
|---|
GmlExporter()
+Creates a new GmlExporter object with integer name providers for the
+ vertex and edge IDs and null providers for the vertex and edge labels.
+ |
+
GmlExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GmlExporter object with the given ID and label
+ providers.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+export(Writer output,
+ DirectedGraph<V,E> g)
+Exports a directed graph into a plain text file in GML format.
+ |
+
void |
+export(Writer output,
+ UndirectedGraph<V,E> g)
+Exports an undirected graph into a plain text file in GML format.
+ |
+
Integer |
+getPrintLabels()
+Get whether to export the vertex and edge labels.
+ |
+
void |
+setPrintLabels(Integer i)
+Set whether to export the vertex and edge labels.
+ |
+
public static final Integer PRINT_NO_LABELS+
public static final Integer PRINT_EDGE_LABELS+
public static final Integer PRINT_EDGE_VERTEX_LABELS+
public static final Integer PRINT_VERTEX_LABELS+
public GmlExporter()+
public GmlExporter(VertexNameProvider<V> vertexIDProvider, + VertexNameProvider<V> vertexLabelProvider, + EdgeNameProvider<E> edgeIDProvider, + EdgeNameProvider<E> edgeLabelProvider)+
vertexIDProvider - for generating vertex IDs. Must not be null.vertexLabelProvider - for generating vertex labels. If null, vertex
+ labels will be generated using the toString() method of the vertex
+ object.edgeIDProvider - for generating vertex IDs. Must not be null.edgeLabelProvider - for generating edge labels. If null, edge labels
+ will be generated using the toString() method of the edge object.public void export(Writer output, + UndirectedGraph<V,E> g)+
output - the writer to which the graph to be exportedg - the undirected graph to be exportedpublic void export(Writer output, + DirectedGraph<V,E> g)+
output - the writer to which the graph to be exportedg - the directed graph to be exportedpublic void setPrintLabels(Integer i)+
i - What labels to export. Valid options are PRINT_NO_LABELS, PRINT_EDGE_LABELS, PRINT_EDGE_VERTEX_LABELS, and PRINT_VERTEX_LABELS.IllegalArgumentException - if a non-supported value is usedPRINT_NO_LABELS,
+PRINT_EDGE_LABELS,
+PRINT_EDGE_VERTEX_LABELS,
+PRINT_VERTEX_LABELSpublic Integer getPrintLabels()+
PRINT_NO_LABELS, PRINT_EDGE_LABELS,
+ PRINT_EDGE_VERTEX_LABELS, or PRINT_VERTEX_LABELS.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/GraphMLExporter.html b/javadoc/org/jgrapht/ext/GraphMLExporter.html new file mode 100644 index 0000000..a3d5c03 --- /dev/null +++ b/javadoc/org/jgrapht/ext/GraphMLExporter.html @@ -0,0 +1,309 @@ + + + + + + +public class GraphMLExporter<V,E> +extends Object+
For a description of the format see + http://en.wikipedia.org/wiki/GraphML.
| Constructor and Description | +
|---|
GraphMLExporter()
+Constructs a new GraphMLExporter object with integer name providers for
+ the vertex and edge IDs and null providers for the vertex and edge
+ labels.
+ |
+
GraphMLExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GraphMLExporter object with the given ID and label
+ providers.
+ |
+
public GraphMLExporter()+
public GraphMLExporter(VertexNameProvider<V> vertexIDProvider, + VertexNameProvider<V> vertexLabelProvider, + EdgeNameProvider<E> edgeIDProvider, + EdgeNameProvider<E> edgeLabelProvider)+
vertexIDProvider - for generating vertex IDs. Must not be null.vertexLabelProvider - for generating vertex labels. If null, vertex
+ labels will not be written to the file.edgeIDProvider - for generating vertex IDs. Must not be null.edgeLabelProvider - for generating edge labels. If null, edge labels
+ will not be written to the file.public void export(Writer writer, + Graph<V,E> g) + throws SAXException, + TransformerConfigurationException+
writer - the writer to which the graph to be exportedg - the graph to be exportedSAXExceptionTransformerConfigurationExceptionCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/ImportException.html b/javadoc/org/jgrapht/ext/ImportException.html new file mode 100644 index 0000000..e75aaf4 --- /dev/null +++ b/javadoc/org/jgrapht/ext/ImportException.html @@ -0,0 +1,267 @@ + + + + + + +public class ImportException +extends Exception+
| Constructor and Description | +
|---|
ImportException(String message) |
+
ImportException(String message,
+ Throwable cause) |
+
addSuppressed, fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, getSuppressed, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toStringCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/IntegerEdgeNameProvider.html b/javadoc/org/jgrapht/ext/IntegerEdgeNameProvider.html new file mode 100644 index 0000000..c877d54 --- /dev/null +++ b/javadoc/org/jgrapht/ext/IntegerEdgeNameProvider.html @@ -0,0 +1,295 @@ + + + + + + +public class IntegerEdgeNameProvider<E> +extends Object +implements EdgeNameProvider<E>+
| Constructor and Description | +
|---|
IntegerEdgeNameProvider() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+clear()
+Clears all cached identifiers, and resets the unique identifier counter.
+ |
+
String |
+getEdgeName(E edge)
+Returns the String representation of an edge.
+ |
+
public IntegerEdgeNameProvider()+
public void clear()+
public String getEdgeName(E edge)+
getEdgeName in interface EdgeNameProvider<E>edge - the edge to be namedCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/IntegerNameProvider.html b/javadoc/org/jgrapht/ext/IntegerNameProvider.html new file mode 100644 index 0000000..a3cce43 --- /dev/null +++ b/javadoc/org/jgrapht/ext/IntegerNameProvider.html @@ -0,0 +1,297 @@ + + + + + + +public class IntegerNameProvider<V> +extends Object +implements VertexNameProvider<V>+
| Constructor and Description | +
|---|
IntegerNameProvider() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+clear()
+Clears all cached identifiers, and resets the unique identifier counter.
+ |
+
String |
+getVertexName(V vertex)
+Returns the String representation of the unique integer representing a
+ vertex.
+ |
+
public void clear()+
public String getVertexName(V vertex)+
getVertexName in interface VertexNameProvider<V>vertex - the vertex to be namedGraphListener.edgeAdded(GraphEdgeChangeEvent)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/JGraphModelAdapter.CellFactory.html b/javadoc/org/jgrapht/ext/JGraphModelAdapter.CellFactory.html new file mode 100644 index 0000000..8aec3b9 --- /dev/null +++ b/javadoc/org/jgrapht/ext/JGraphModelAdapter.CellFactory.html @@ -0,0 +1,248 @@ + + + + + + +public static interface JGraphModelAdapter.CellFactory<VV,EE>
+| Modifier and Type | +Method and Description | +
|---|---|
org.jgraph.graph.DefaultEdge |
+createEdgeCell(EE jGraphTEdge)
+Creates an edge cell that contains its respective JGraphT edge.
+ |
+
org.jgraph.graph.DefaultGraphCell |
+createVertexCell(VV jGraphTVertex)
+Creates a vertex cell that contains its respective JGraphT vertex.
+ |
+
org.jgraph.graph.DefaultEdge createEdgeCell(EE jGraphTEdge)+
jGraphTEdge - a JGraphT edge to be contained.org.jgraph.graph.DefaultGraphCell createVertexCell(VV jGraphTVertex)+
jGraphTVertex - a JGraphT vertex to be contained.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/JGraphModelAdapter.DefaultCellFactory.html b/javadoc/org/jgrapht/ext/JGraphModelAdapter.DefaultCellFactory.html new file mode 100644 index 0000000..8166745 --- /dev/null +++ b/javadoc/org/jgrapht/ext/JGraphModelAdapter.DefaultCellFactory.html @@ -0,0 +1,308 @@ + + + + + + +public static class JGraphModelAdapter.DefaultCellFactory<VV,EE> +extends Object +implements JGraphModelAdapter.CellFactory<VV,EE>, Serializable+
| Constructor and Description | +
|---|
JGraphModelAdapter.DefaultCellFactory() |
+
| Modifier and Type | +Method and Description | +
|---|---|
org.jgraph.graph.DefaultEdge |
+createEdgeCell(EE jGraphTEdge)
+Creates an edge cell that contains its respective JGraphT edge.
+ |
+
org.jgraph.graph.DefaultGraphCell |
+createVertexCell(VV jGraphTVertex)
+Creates a vertex cell that contains its respective JGraphT vertex.
+ |
+
public JGraphModelAdapter.DefaultCellFactory()+
public org.jgraph.graph.DefaultEdge createEdgeCell(EE jGraphTEdge)+
JGraphModelAdapter.CellFactorycreateEdgeCell in interface JGraphModelAdapter.CellFactory<VV,EE>jGraphTEdge - a JGraphT edge to be contained.JGraphModelAdapter.CellFactory.createEdgeCell(Object)public org.jgraph.graph.DefaultGraphCell createVertexCell(VV jGraphTVertex)+
JGraphModelAdapter.CellFactorycreateVertexCell in interface JGraphModelAdapter.CellFactory<VV,EE>jGraphTVertex - a JGraphT vertex to be contained.JGraphModelAdapter.CellFactory.createVertexCell(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/JGraphModelAdapter.html b/javadoc/org/jgrapht/ext/JGraphModelAdapter.html new file mode 100644 index 0000000..0f095b2 --- /dev/null +++ b/javadoc/org/jgrapht/ext/JGraphModelAdapter.html @@ -0,0 +1,613 @@ + + + + + + +public class JGraphModelAdapter<V,E>
+extends org.jgraph.graph.DefaultGraphModel
+Modifications made to the underlying JGraphT graph are reflected to this
+ JGraph model if and only if the underlying JGraphT graph is a ListenableGraph. If the underlying JGraphT graph is not
+ ListenableGraph, then this JGraph model represent a snapshot if the graph at
+ the time of its creation.
Changes made to this JGraph model are also reflected back to the + underlying JGraphT graph. To avoid confusion, variables are prefixed + according to the JGraph/JGraphT object(s) they are referring to.
+ +KNOWN BUGS: There is a small issue to be aware of. JGraph allows + 'dangling edges' incident with just one vertex; JGraphT doesn't. Such a + configuration can arise when adding an edge or removing a vertex. The code + handles this by removing the newly-added dangling edge or removing all edges + incident with the vertex before actually removing the vertex, respectively. + This works very well, only it doesn't play all that nicely with the + undo-manager in the JGraph: for the second situation where you remove a + vertex incident with some edges, if you undo the removal, the vertex is + 'unremoved' but the edges aren't.
| Modifier and Type | +Class and Description | +
|---|---|
static interface |
+JGraphModelAdapter.CellFactory<VV,EE>
+Creates the JGraph cells that reflect the respective JGraphT elements.
+ |
+
static class |
+JGraphModelAdapter.DefaultCellFactory<VV,EE>
+A simple default cell factory.
+ |
+
org.jgraph.graph.DefaultGraphModel.EmptyIterator, org.jgraph.graph.DefaultGraphModel.GraphModelEdit, org.jgraph.graph.DefaultGraphModel.GraphModelLayerEditasksAllowsChildren, attributes, emptyIterator, listenerList, removeEmptyGroups, roots, transAddedCells, transEditAttrs, transEditCS, transEditPM, transRemovedCells, updateLevelcompoundEdit, listeners, realSource| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> org.jgraph.graph.AttributeMap |
+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.
+ |
+
static org.jgraph.graph.AttributeMap |
+createDefaultVertexAttributes()
+Creates and returns a map of attributes to be used as defaults for vertex
+ attributes.
+ |
+
JGraphModelAdapter.CellFactory<V,E> |
+getCellFactory()
+Returns the cell factory used to create the JGraph cells.
+ |
+
org.jgraph.graph.AttributeMap |
+getDefaultEdgeAttributes()
+Returns the default edge attributes used for creating new JGraph edges.
+ |
+
org.jgraph.graph.AttributeMap |
+getDefaultVertexAttributes()
+Returns the default vertex attributes used for creating new JGraph
+ vertices.
+ |
+
org.jgraph.graph.DefaultEdge |
+getEdgeCell(E jGraphTEdge)
+Returns the JGraph edge cell that corresponds to the specified JGraphT
+ edge.
+ |
+
org.jgraph.graph.DefaultGraphCell |
+getVertexCell(Object jGraphTVertex)
+Returns the JGraph vertex cell that corresponds to the specified JGraphT
+ vertex.
+ |
+
org.jgraph.graph.DefaultPort |
+getVertexPort(Object jGraphTVertex)
+Returns the JGraph port cell that corresponds to the specified JGraphT
+ vertex.
+ |
+
void |
+setDefaultEdgeAttributes(org.jgraph.graph.AttributeMap defaultEdgeAttributes)
+Sets the default edge attributes used for creating new JGraph edges.
+ |
+
void |
+setDefaultVertexAttributes(org.jgraph.graph.AttributeMap defaultVertexAttributes)
+Sets the default vertex attributes used for creating new JGraph vertices.
+ |
+
acceptsSource, acceptsTarget, addGraphModelListener, beginUpdate, cellsChanged, cloneCell, cloneCell, cloneCell, cloneCells, cloneUserObject, connect, contains, containsEdgeBetween, createEdit, createLayerEdit, createRemoveEdit, edges, edit, edit, endUpdate, execute, fireGraphChanged, getAll, getAttributes, getAttributes, getChild, getChildCount, getConnectionSet, getDescendants, getEdges, getEdges, getEdgesBetween, getGraphModelListeners, getIncomingEdges, getIndexOfChild, getIndexOfRoot, getOpposite, getOutgoingEdges, getParent, getRootAt, getRootCount, getRoots, getRoots, getRoots, getRootsAsCollection, getSource, getSourceVertex, getTarget, getTargetVertex, getTopmostCells, getUpdateLevel, getUserObject, getValue, handleAttributes, handleConnection, handleConnectionSet, handleInsert, handleParentMap, handleRemove, hasAncestorIn, insert, isEdge, isGroup, isLeaf, isPort, isRemoveEmptyGroups, isVertex, order, remove, removeGraphModelListener, setParent, setRemoveEmptyGroups, setSourcePort, setTargetPort, toBack, toFront, updateTransaction, valueForCellChanged_postEdit, addUndoableEditListener, createCompoundEdit, getUndoableEditListeners, postEdit, removeUndoableEditListener, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitaddUndoableEditListener, removeUndoableEditListenerpublic JGraphModelAdapter(Graph<V,E> jGraphTGraph)+
jGraphTGraph - the JGraphT graph for which JGraph model adapter to
+ be created. null is NOT permitted.public JGraphModelAdapter(Graph<V,E> jGraphTGraph, + org.jgraph.graph.AttributeMap defaultVertexAttributes, + org.jgraph.graph.AttributeMap defaultEdgeAttributes)+
jGraphTGraph - the JGraphT graph for which JGraph model adapter to
+ be created. null is NOT permitted.defaultVertexAttributes - a default map of JGraph attributes to
+ format vertices. null is NOT permitted.defaultEdgeAttributes - a default map of JGraph attributes to format
+ edges. null is NOT permitted.public JGraphModelAdapter(Graph<V,E> jGraphTGraph, + org.jgraph.graph.AttributeMap defaultVertexAttributes, + org.jgraph.graph.AttributeMap defaultEdgeAttributes, + JGraphModelAdapter.CellFactory<V,E> cellFactory)+
jGraphTGraph - the JGraphT graph for which JGraph model adapter to
+ be created. null is NOT permitted.defaultVertexAttributes - a default map of JGraph attributes to
+ format vertices. null is NOT permitted.defaultEdgeAttributes - a default map of JGraph attributes to format
+ edges. null is NOT permitted.cellFactory - a JGraphModelAdapter.CellFactory to be used to create the JGraph
+ cells. null is NOT permitted.IllegalArgumentExceptionpublic static <V,E> org.jgraph.graph.AttributeMap createDefaultEdgeAttributes(Graph<V,E> jGraphTGraph)+
jGraphTGraph - the graph for which default edge attributes to be
+ created.public static org.jgraph.graph.AttributeMap createDefaultVertexAttributes()+
public JGraphModelAdapter.CellFactory<V,E> getCellFactory()+
public void setDefaultEdgeAttributes(org.jgraph.graph.AttributeMap defaultEdgeAttributes)+
defaultEdgeAttributes - the default edge attributes to set.public org.jgraph.graph.AttributeMap getDefaultEdgeAttributes()+
public void setDefaultVertexAttributes(org.jgraph.graph.AttributeMap defaultVertexAttributes)+
defaultVertexAttributes - the default vertex attributes to set.public org.jgraph.graph.AttributeMap getDefaultVertexAttributes()+
public org.jgraph.graph.DefaultEdge getEdgeCell(E jGraphTEdge)+
null.jGraphTEdge - a JGraphT edge of the JGraphT graph.null if no corresponding cell found.public org.jgraph.graph.DefaultGraphCell getVertexCell(Object jGraphTVertex)+
null.jGraphTVertex - a JGraphT vertex of the JGraphT graph.null if no corresponding cell found.public org.jgraph.graph.DefaultPort getVertexPort(Object jGraphTVertex)+
null.jGraphTVertex - a JGraphT vertex of the JGraphT graph.null if no corresponding cell found.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/JGraphXAdapter.html b/javadoc/org/jgrapht/ext/JGraphXAdapter.html new file mode 100644 index 0000000..b18a024 --- /dev/null +++ b/javadoc/org/jgrapht/ext/JGraphXAdapter.html @@ -0,0 +1,516 @@ + + + + + + +V - VertexE - Edgepublic class JGraphXAdapter<V,E> +extends com.mxgraph.view.mxGraph +implements GraphListener<V,E>+
Adapter to draw a JGraphT graph with the JGraphX drawing library.
+ +This adapter will not convert JGraphX to JGraphT - this should be handled + in another class entirely.
+ +Known Bugs: If this class is used with String-Edges, please note that + there is a bug with the method JgraphT.addEdge(vertex1, vertex2); The edge + will be created with an empty String "" as value and saved (in JGraphT as + well as in this class), which results in the edge not saving correctly. So, + if you're using Strings as Edgeclass please use the method addEdge(vertex1, + vertex2, "Edgename"); with a unique edgename.
com.mxgraph.view.mxGraph.mxICellVisitorcom.mxgraph.util.mxEventSource.mxIEventListenerallowDanglingEdges, allowLoops, allowNegativeCoordinates, alternateEdgeStyle, autoOrigin, autoSizeCells, border, cellsBendable, cellsCloneable, cellsDeletable, cellsDisconnectable, cellsEditable, cellsLocked, cellsMovable, cellsResizable, cellsSelectable, changesRepaintThreshold, changeSupport, cloneInvalidEdges, collapseToPreferredSize, connectableEdges, constrainChildren, defaultLoopStyle, defaultOverlap, defaultParent, disconnectOnMove, dropEnabled, edgeLabelsMovable, enabled, extendParents, extendParentsOnAdd, fullRepaintHandler, graphModelChangeHandler, gridEnabled, gridSize, htmlLabels, imageBundles, keepEdgesInBackground, keepEdgesInForeground, labelsClipped, labelsVisible, maximumGraphBounds, minimumGraphSize, model, multigraph, multiplicities, origin, resetEdgesOnConnect, resetEdgesOnMove, resetEdgesOnResize, resetViewOnRootChange, selectionModel, splitEnabled, stylesheet, swimlaneNesting, updateOriginHandler, VERSION, vertexLabelsMovable, vieweventListeners, eventsEnabled, eventSource| Constructor and Description | +
|---|
JGraphXAdapter(Graph<V,E> graph)
+Constructs and draws a new mxGraph from a jGraphT graph.
+ |
+
JGraphXAdapter(ListenableGraph<V,E> graph)
+Constructs and draws a new ListenableGraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+edgeAdded(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been added to the graph.
+ |
+
void |
+edgeRemoved(GraphEdgeChangeEvent<V,E> e)
+Notifies that an edge has been removed from the graph.
+ |
+
HashMap<com.mxgraph.model.mxICell,E> |
+getCellToEdgeMap()
+Returns Hashmap which maps the visualization mxICells onto their edges.
+ |
+
HashMap<com.mxgraph.model.mxICell,V> |
+getCellToVertexMap()
+Returns Hashmap which maps the visualization mxICells onto their
+ vertices.
+ |
+
HashMap<E,com.mxgraph.model.mxICell> |
+getEdgeToCellMap()
+Returns Hashmap which maps the edges onto their visualization mxICells.
+ |
+
HashMap<V,com.mxgraph.model.mxICell> |
+getVertexToCellMap()
+Returns Hashmap which maps the vertices onto their visualization
+ mxICells.
+ |
+
void |
+vertexAdded(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been added to the graph.
+ |
+
void |
+vertexRemoved(GraphVertexChangeEvent<V> e)
+Notifies that a vertex has been removed from the graph.
+ |
+
addAllEdges, addCell, addCell, addCell, addCells, addCells, addCells, addCells, addEdge, addImageBundle, addPropertyChangeListener, addPropertyChangeListener, addSelectionCell, addSelectionCells, alignCells, alignCells, alignCells, cellConnected, cellDrawn, cellLabelChanged, cellsAdded, cellsAdded, cellsFolded, cellsFolded, cellSizeUpdated, cellsMoved, cellsOrdered, cellsRemoved, cellsResized, cellsToggled, clearSelection, cloneCells, cloneCells, connectCell, connectCell, constrainChild, convertValueToString, createEdge, createGraphView, createGroupCell, createSelectionModel, createStylesheet, createVertex, createVertex, disconnectGraph, drawCell, drawGraph, drawState, enterGroup, enterGroup, exitGroup, extendParent, findTreeRoots, findTreeRoots, findTreeRoots, flipEdge, foldCells, foldCells, foldCells, foldCells, getAllConnectionConstraints, getAllEdges, getAlternateEdgeStyle, getBorder, getBoundingBox, getBoundingBox, getBoundingBox, getBoundingBoxFromGeometry, getBoundsForCells, getBoundsForGroup, getCellBounds, getCellBounds, getCellBounds, getCellBounds, getCellContainmentArea, getCellGeometry, getCellsBeyond, getCellsForGroup, getCellStyle, getCellValidationError, getChangesRepaintThreshold, getChildCells, getChildCells, getChildEdges, getChildOffsetForCell, getChildVertices, getCloneableCells, getConnectionConstraint, getConnectionPoint, getConnections, getConnections, getConnections, getCurrentRoot, getDefaultLoopStyle, getDefaultOverlap, getDefaultParent, getDeletableCells, getDropTarget, getEdges, getEdges, getEdges, getEdges, getEdgesBetween, getEdgesBetween, getEdgeValidationError, getFoldableCells, getGraphBounds, getGridSize, getImage, getImageBundles, getImageBundles, getImageFromBundles, getIncomingEdges, getIncomingEdges, getLabel, getLinkForCell, getMaximumGraphBounds, getMinimumGraphSize, getModel, getMovableCells, getMultiplicities, getOpposites, getOpposites, getOrigin, getOutgoingEdges, getOutgoingEdges, getOverlap, getPaintBounds, getPreferredSizeForCell, getRemovedCellsForChanges, getSelectionCell, getSelectionCells, getSelectionCellsForChanges, getSelectionCount, getSelectionModel, getStartSize, getStylesheet, getTargetForCell, getTerminalForPort, getToolTipForCell, getTranslateForRoot, getView, graphModelChanged, groupCells, groupCells, groupCells, groupCells, home, insertEdge, insertEdge, insertVertex, insertVertex, insertVertex, isAllowDanglingEdges, isAllowLoops, isAllowNegativeCoordinates, isAllowOverlapParent, isAutoOrigin, isAutoSizeCell, isAutoSizeCells, isCellBendable, isCellCloneable, isCellCollapsed, isCellConnectable, isCellDeletable, isCellDisconnectable, isCellEditable, isCellFoldable, isCellLocked, isCellMovable, isCellResizable, isCellsBendable, isCellsCloneable, isCellsDeletable, isCellsDisconnectable, isCellsEditable, isCellSelectable, isCellSelected, isCellsLocked, isCellsMovable, isCellsResizable, isCellsSelectable, isCellVisible, isCloneInvalidEdges, isCollapseToPreferredSize, isConnectableEdges, isConstrainChild, isConstrainChildren, isDisconnectOnMove, isDropEnabled, isEdgeLabelsMovable, isEdgeValid, isEnabled, isExtendParent, isExtendParents, isExtendParentsOnAdd, isGridEnabled, isHtmlLabel, isHtmlLabels, isKeepEdgesInBackground, isKeepEdgesInForeground, isLabelClipped, isLabelMovable, isLabelsClipped, isLabelsVisible, isLoop, isMultigraph, isOrthogonal, isPort, isResetEdgesOnConnect, isResetEdgesOnMove, isResetEdgesOnResize, isResetViewOnRootChange, isSelectionEmpty, isSplitEnabled, isSplitTarget, isSwimlane, isSwimlaneNesting, isTerminalPointMovable, isValidAncestor, isValidConnection, isValidDropTarget, isValidRoot, isValidSource, isValidTarget, isVertexLabelsMovable, main, moveCells, moveCells, moveCells, orderCells, orderCells, postProcessCellStyle, processChange, processChanges, refresh, removeCells, removeCells, removeCells, removeCellsFromParent, removeCellsFromParent, removeImageBundle, removePropertyChangeListener, removePropertyChangeListener, removeSelectionCell, removeSelectionCells, removeStateForCell, repaint, repaint, resetEdge, resetEdges, resizeCell, resizeCells, selectAll, selectAll, selectCell, selectCells, selectCells, selectChildCell, selectEdges, selectEdges, selectNextCell, selectParentCell, selectPreviousCell, selectVertices, selectVertices, setAllowDanglingEdges, setAllowLoops, setAllowNegativeCoordinates, setAlternateEdgeStyle, setAutoOrigin, setAutoSizeCells, setBorder, setCellsBendable, setCellsCloneable, setCellsDeletable, setCellsDisconnectable, setCellsEditable, setCellsLocked, setCellsMovable, setCellsResizable, setCellsSelectable, setCellStyle, setCellStyle, setCellStyleFlags, setCellStyleFlags, setCellStyles, setCellStyles, setChangesRepaintThreshold, setCloneInvalidEdges, setCollapseToPreferredSize, setConnectableEdges, setConnectionConstraint, setConstrainChildren, setDefaultLoopStyle, setDefaultOverlap, setDefaultParent, setDisconnectOnMove, setDropEnabled, setEdgeLabelsMovable, setEnabled, setExtendParents, setExtendParentsOnAdd, setGridEnabled, setGridSize, setHtmlLabels, setKeepEdgesInBackground, setKeepEdgesInForeground, setLabelsClipped, setLabelsVisible, setMaximumGraphBounds, setMinimumGraphSize, setModel, setMultigraph, setMultiplicities, setOrigin, setResetEdgesOnConnect, setResetEdgesOnMove, setResetEdgesOnResize, setResetViewOnRootChange, setSelectionCell, setSelectionCells, setSelectionCells, setSplitEnabled, setStylesheet, setSwimlaneNesting, setVertexLabelsMovable, setView, snap, splitEdge, splitEdge, splitEdge, swapBounds, toggleCells, toggleCells, toggleCells, toggleCellStyle, toggleCellStyleFlags, toggleCellStyleFlags, toggleCellStyles, toggleCellStyles, translateCell, traverse, traverse, ungroupCells, ungroupCells, updateAlternateBounds, updateCellSize, updateCellSize, updateGroupBounds, updateGroupBounds, updateGroupBounds, updateGroupBounds, updateOrigin, validateCell, validateEdgeaddListener, fireEvent, fireEvent, getEventSource, isEventsEnabled, removeListener, removeListener, setEventsEnabled, setEventSourcepublic JGraphXAdapter(ListenableGraph<V,E> graph)+
graph - casted to graphpublic JGraphXAdapter(Graph<V,E> graph)+
graph - is a graphpublic HashMap<V,com.mxgraph.model.mxICell> getVertexToCellMap()+
vertexToCellMappublic HashMap<E,com.mxgraph.model.mxICell> getEdgeToCellMap()+
edgeToCellMappublic HashMap<com.mxgraph.model.mxICell,E> getCellToEdgeMap()+
cellToEdgeMappublic HashMap<com.mxgraph.model.mxICell,V> getCellToVertexMap()+
cellToVertexMappublic void vertexAdded(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexAdded in interface VertexSetListener<V>e - the vertex event.public void vertexRemoved(GraphVertexChangeEvent<V> e)+
VertexSetListenervertexRemoved in interface VertexSetListener<V>e - the vertex event.public void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeAdded in interface GraphListener<V,E>e - the edge event.public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
GraphListeneredgeRemoved in interface GraphListener<V,E>e - the edge event.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/MatrixExporter.html b/javadoc/org/jgrapht/ext/MatrixExporter.html new file mode 100644 index 0000000..df55296 --- /dev/null +++ b/javadoc/org/jgrapht/ext/MatrixExporter.html @@ -0,0 +1,351 @@ + + + + + + +| Constructor and Description | +
|---|
MatrixExporter()
+Creates a new MatrixExporter object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+exportAdjacencyMatrix(Writer output,
+ DirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's adjacency matrix.
+ |
+
void |
+exportAdjacencyMatrix(Writer output,
+ UndirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's adjacency matrix.
+ |
+
void |
+exportLaplacianMatrix(Writer output,
+ UndirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's Laplacian matrix.
+ |
+
void |
+exportNormalizedLaplacianMatrix(Writer output,
+ UndirectedGraph<V,E> g)
+Exports the specified graph into a plain text file format containing a
+ sparse representation of the graph's normalized Laplacian matrix.
+ |
+
public MatrixExporter()+
public void exportAdjacencyMatrix(Writer output, + UndirectedGraph<V,E> g)+
output - the writer to which the graph to be exported.g - the graph to be exported.public void exportAdjacencyMatrix(Writer output, + DirectedGraph<V,E> g)+
output - the writer to which the graph to be exported.g - the graph to be exported.public void exportLaplacianMatrix(Writer output, + UndirectedGraph<V,E> g)+
output - the writer to which the graph is to be exported.g - the graph to be exported.public void exportNormalizedLaplacianMatrix(Writer output, + UndirectedGraph<V,E> g)+
output - the writer to which the graph is to be exported.g - the graph to be exported.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/StringEdgeNameProvider.html b/javadoc/org/jgrapht/ext/StringEdgeNameProvider.html new file mode 100644 index 0000000..6245fdf --- /dev/null +++ b/javadoc/org/jgrapht/ext/StringEdgeNameProvider.html @@ -0,0 +1,278 @@ + + + + + + +public class StringEdgeNameProvider<E> +extends Object +implements EdgeNameProvider<E>+
Object.toString() on them. This assumes
+ that the edge's Object.toString() method returns a unique String
+ representation for each edge.| Constructor and Description | +
|---|
StringEdgeNameProvider() |
+
| Modifier and Type | +Method and Description | +
|---|---|
String |
+getEdgeName(E edge)
+Returns the String representation an edge.
+ |
+
public StringEdgeNameProvider()+
public String getEdgeName(E edge)+
getEdgeName in interface EdgeNameProvider<E>edge - the edge to be namedCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/StringNameProvider.html b/javadoc/org/jgrapht/ext/StringNameProvider.html new file mode 100644 index 0000000..bcd49d0 --- /dev/null +++ b/javadoc/org/jgrapht/ext/StringNameProvider.html @@ -0,0 +1,280 @@ + + + + + + +public class StringNameProvider<V> +extends Object +implements VertexNameProvider<V>+
Object.toString() on them. This assumes
+ that the vertex's Object.toString() method returns a unique String
+ representation for each vertex.| Constructor and Description | +
|---|
StringNameProvider() |
+
| Modifier and Type | +Method and Description | +
|---|---|
String |
+getVertexName(V vertex)
+Returns the String representation of the unique integer representing a
+ vertex.
+ |
+
public String getVertexName(V vertex)+
getVertexName in interface VertexNameProvider<V>vertex - the vertex to be namedGraphListener.edgeAdded(GraphEdgeChangeEvent)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/VertexNameProvider.html b/javadoc/org/jgrapht/ext/VertexNameProvider.html new file mode 100644 index 0000000..e38e8c8 --- /dev/null +++ b/javadoc/org/jgrapht/ext/VertexNameProvider.html @@ -0,0 +1,222 @@ + + + + + + +public interface VertexNameProvider<V>
+| Modifier and Type | +Method and Description | +
|---|---|
String |
+getVertexName(V vertex)
+Returns a unique name for a vertex.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/VertexProvider.html b/javadoc/org/jgrapht/ext/VertexProvider.html new file mode 100644 index 0000000..8473cbe --- /dev/null +++ b/javadoc/org/jgrapht/ext/VertexProvider.html @@ -0,0 +1,217 @@ + + + + + + +V - Vertex typepublic interface VertexProvider<V>
+Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/VertexUpdater.html b/javadoc/org/jgrapht/ext/VertexUpdater.html new file mode 100644 index 0000000..c37360f --- /dev/null +++ b/javadoc/org/jgrapht/ext/VertexUpdater.html @@ -0,0 +1,219 @@ + + + + + + +V - public interface VertexUpdater<V>
+Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/VisioExporter.html b/javadoc/org/jgrapht/ext/VisioExporter.html new file mode 100644 index 0000000..dfac5f0 --- /dev/null +++ b/javadoc/org/jgrapht/ext/VisioExporter.html @@ -0,0 +1,297 @@ + + + + + + +public class VisioExporter<V,E> +extends Object+
Tip: By default, the exported graph doesn't show link directions.
+ To show link directions:
+
+
| Constructor and Description | +
|---|
VisioExporter()
+Creates a new VisioExporter object.
+ |
+
VisioExporter(VertexNameProvider<V> vertexNameProvider)
+Creates a new VisioExporter object with the specified naming policy.
+ |
+
public VisioExporter(VertexNameProvider<V> vertexNameProvider)+
vertexNameProvider - the vertex name provider to be used for naming
+ the Visio shapes.public VisioExporter()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/ComponentAttributeProvider.html b/javadoc/org/jgrapht/ext/class-use/ComponentAttributeProvider.html new file mode 100644 index 0000000..576fe47 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/ComponentAttributeProvider.html @@ -0,0 +1,175 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Constructor and Description | +
|---|
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider,
+ ComponentAttributeProvider<V> vertexAttributeProvider,
+ ComponentAttributeProvider<E> edgeAttributeProvider)
+Constructs a new DOTExporter object with the given ID, label, and
+ attribute providers.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider,
+ ComponentAttributeProvider<V> vertexAttributeProvider,
+ ComponentAttributeProvider<E> edgeAttributeProvider)
+Constructs a new DOTExporter object with the given ID, label, and
+ attribute providers.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/DOTExporter.html b/javadoc/org/jgrapht/ext/class-use/DOTExporter.html new file mode 100644 index 0000000..10930cf --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/DOTExporter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/DOTImporter.html b/javadoc/org/jgrapht/ext/class-use/DOTImporter.html new file mode 100644 index 0000000..8b0a8c6 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/DOTImporter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/EdgeNameProvider.html b/javadoc/org/jgrapht/ext/class-use/EdgeNameProvider.html new file mode 100644 index 0000000..ea5091d --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/EdgeNameProvider.html @@ -0,0 +1,230 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+IntegerEdgeNameProvider<E>
+Assigns a unique integer to represent each edge.
+ |
+
class |
+StringEdgeNameProvider<E>
+Generates edge names by invoking
+Object.toString() on them. |
+
| Constructor and Description | +
|---|
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new DOTExporter object with the given ID and label
+ providers.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider,
+ ComponentAttributeProvider<V> vertexAttributeProvider,
+ ComponentAttributeProvider<E> edgeAttributeProvider)
+Constructs a new DOTExporter object with the given ID, label, and
+ attribute providers.
+ |
+
GmlExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GmlExporter object with the given ID and label
+ providers.
+ |
+
GmlExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GmlExporter object with the given ID and label
+ providers.
+ |
+
GraphMLExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GraphMLExporter object with the given ID and label
+ providers.
+ |
+
GraphMLExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GraphMLExporter object with the given ID and label
+ providers.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/EdgeProvider.html b/javadoc/org/jgrapht/ext/class-use/EdgeProvider.html new file mode 100644 index 0000000..ebbd34a --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/EdgeProvider.html @@ -0,0 +1,168 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Constructor and Description | +
|---|
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider)
+Constructs a new DOTImporter with the given providers
+ |
+
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider,
+ VertexUpdater<V> updater)
+Constructs a new DOTImporter with the given providers
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/GmlExporter.html b/javadoc/org/jgrapht/ext/class-use/GmlExporter.html new file mode 100644 index 0000000..6dd6729 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/GmlExporter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/GraphMLExporter.html b/javadoc/org/jgrapht/ext/class-use/GraphMLExporter.html new file mode 100644 index 0000000..5a7ce45 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/GraphMLExporter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/ImportException.html b/javadoc/org/jgrapht/ext/class-use/ImportException.html new file mode 100644 index 0000000..13f03bd --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/ImportException.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+DOTImporter.read(String input,
+ AbstractBaseGraph<V,E> graph)
+Read a dot formatted string and populate the provided graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/IntegerEdgeNameProvider.html b/javadoc/org/jgrapht/ext/class-use/IntegerEdgeNameProvider.html new file mode 100644 index 0000000..43c40af --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/IntegerEdgeNameProvider.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/IntegerNameProvider.html b/javadoc/org/jgrapht/ext/class-use/IntegerNameProvider.html new file mode 100644 index 0000000..24efa39 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/IntegerNameProvider.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.CellFactory.html b/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.CellFactory.html new file mode 100644 index 0000000..174794a --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.CellFactory.html @@ -0,0 +1,193 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
static class |
+JGraphModelAdapter.DefaultCellFactory<VV,EE>
+A simple default cell factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
JGraphModelAdapter.CellFactory<V,E> |
+JGraphModelAdapter.getCellFactory()
+Returns the cell factory used to create the JGraph cells.
+ |
+
| Constructor and Description | +
|---|
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.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.DefaultCellFactory.html b/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.DefaultCellFactory.html new file mode 100644 index 0000000..cec1b71 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.DefaultCellFactory.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.html b/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.html new file mode 100644 index 0000000..55f10ac --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/JGraphModelAdapter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/JGraphXAdapter.html b/javadoc/org/jgrapht/ext/class-use/JGraphXAdapter.html new file mode 100644 index 0000000..3631f08 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/JGraphXAdapter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/MatrixExporter.html b/javadoc/org/jgrapht/ext/class-use/MatrixExporter.html new file mode 100644 index 0000000..3df3277 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/MatrixExporter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/StringEdgeNameProvider.html b/javadoc/org/jgrapht/ext/class-use/StringEdgeNameProvider.html new file mode 100644 index 0000000..d318a2a --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/StringEdgeNameProvider.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/StringNameProvider.html b/javadoc/org/jgrapht/ext/class-use/StringNameProvider.html new file mode 100644 index 0000000..5f1e190 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/StringNameProvider.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/VertexNameProvider.html b/javadoc/org/jgrapht/ext/class-use/VertexNameProvider.html new file mode 100644 index 0000000..2e1f45e --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/VertexNameProvider.html @@ -0,0 +1,253 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+IntegerNameProvider<V>
+Assigns a unique integer to represent each vertex.
+ |
+
class |
+StringNameProvider<V>
+Generates vertex names by invoking
+Object.toString() on them. |
+
| Constructor and Description | +
|---|
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new DOTExporter object with the given ID and label
+ providers.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new DOTExporter object with the given ID and label
+ providers.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider,
+ ComponentAttributeProvider<V> vertexAttributeProvider,
+ ComponentAttributeProvider<E> edgeAttributeProvider)
+Constructs a new DOTExporter object with the given ID, label, and
+ attribute providers.
+ |
+
DOTExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeLabelProvider,
+ ComponentAttributeProvider<V> vertexAttributeProvider,
+ ComponentAttributeProvider<E> edgeAttributeProvider)
+Constructs a new DOTExporter object with the given ID, label, and
+ attribute providers.
+ |
+
GmlExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GmlExporter object with the given ID and label
+ providers.
+ |
+
GmlExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GmlExporter object with the given ID and label
+ providers.
+ |
+
GraphMLExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GraphMLExporter object with the given ID and label
+ providers.
+ |
+
GraphMLExporter(VertexNameProvider<V> vertexIDProvider,
+ VertexNameProvider<V> vertexLabelProvider,
+ EdgeNameProvider<E> edgeIDProvider,
+ EdgeNameProvider<E> edgeLabelProvider)
+Constructs a new GraphMLExporter object with the given ID and label
+ providers.
+ |
+
VisioExporter(VertexNameProvider<V> vertexNameProvider)
+Creates a new VisioExporter object with the specified naming policy.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/VertexProvider.html b/javadoc/org/jgrapht/ext/class-use/VertexProvider.html new file mode 100644 index 0000000..ae0d879 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/VertexProvider.html @@ -0,0 +1,168 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Constructor and Description | +
|---|
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider)
+Constructs a new DOTImporter with the given providers
+ |
+
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider,
+ VertexUpdater<V> updater)
+Constructs a new DOTImporter with the given providers
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/VertexUpdater.html b/javadoc/org/jgrapht/ext/class-use/VertexUpdater.html new file mode 100644 index 0000000..09ba554 --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/VertexUpdater.html @@ -0,0 +1,162 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Constructor and Description | +
|---|
DOTImporter(VertexProvider<V> vertexProvider,
+ EdgeProvider<V,E> edgeProvider,
+ VertexUpdater<V> updater)
+Constructs a new DOTImporter with the given providers
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/class-use/VisioExporter.html b/javadoc/org/jgrapht/ext/class-use/VisioExporter.html new file mode 100644 index 0000000..11bf70d --- /dev/null +++ b/javadoc/org/jgrapht/ext/class-use/VisioExporter.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/package-frame.html b/javadoc/org/jgrapht/ext/package-frame.html new file mode 100644 index 0000000..9aed0c2 --- /dev/null +++ b/javadoc/org/jgrapht/ext/package-frame.html @@ -0,0 +1,46 @@ + + + + + + +See: Description
+| Interface | +Description | +
|---|---|
| ComponentAttributeProvider<T> | +
+ Provides display attributes for vertices and/or edges in a graph.
+ |
+
| EdgeNameProvider<E> | +
+ Assigns a display name for each of the graph edes.
+ |
+
| EdgeProvider<V,E> | +
+ Defines a provider of edges of type E
+ |
+
| JGraphModelAdapter.CellFactory<VV,EE> | +
+ Creates the JGraph cells that reflect the respective JGraphT elements.
+ |
+
| VertexNameProvider<V> | +
+ Assigns a display name for each of the graph vertices.
+ |
+
| VertexProvider<V> | +
+ Creates a Vertex of type V
+ |
+
| VertexUpdater<V> | +
+ Type to handle updates to a vertex when an import gets more information about
+ a vertex after it has been created.
+ |
+
| Class | +Description | +
|---|---|
| DOTExporter<V,E> | +
+ Exports a graph into a DOT file.
+ |
+
| DOTImporter<V,E> | +
+ Imports a graph from a DOT file.
+ |
+
| GmlExporter<V,E> | +
+ Exports a graph into a GML file (Graph Modelling Language).
+ |
+
| GraphMLExporter<V,E> | +
+ Exports a graph into a GraphML file.
+ |
+
| IntegerEdgeNameProvider<E> | +
+ Assigns a unique integer to represent each edge.
+ |
+
| IntegerNameProvider<V> | +
+ Assigns a unique integer to represent each vertex.
+ |
+
| JGraphModelAdapter<V,E> | +
+ An adapter that reflects a JGraphT graph as a JGraph graph.
+ |
+
| JGraphModelAdapter.DefaultCellFactory<VV,EE> | +
+ A simple default cell factory.
+ |
+
| JGraphXAdapter<V,E> | +
+ Adapter to draw a JGraphT graph with the JGraphX drawing library.
+ |
+
| MatrixExporter<V,E> | ++ + | +
| StringEdgeNameProvider<E> | +
+ Generates edge names by invoking
+Object.toString() on them. |
+
| StringNameProvider<V> | +
+ Generates vertex names by invoking
+Object.toString() on them. |
+
| VisioExporter<V,E> | +
+ Exports a graph to a csv format that can be imported into MS Visio.
+ |
+
| Exception | +Description | +
|---|---|
| ImportException | +
+ Used to show problems with importing a graph.
+ |
+
+Extensions and integration means to other products. +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/package-tree.html b/javadoc/org/jgrapht/ext/package-tree.html new file mode 100644 index 0000000..a2a38bb --- /dev/null +++ b/javadoc/org/jgrapht/ext/package-tree.html @@ -0,0 +1,177 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/ext/package-use.html b/javadoc/org/jgrapht/ext/package-use.html new file mode 100644 index 0000000..073471c --- /dev/null +++ b/javadoc/org/jgrapht/ext/package-use.html @@ -0,0 +1,191 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| Class and Description | +
|---|
| ComponentAttributeProvider
+ Provides display attributes for vertices and/or edges in a graph.
+ |
+
| EdgeNameProvider
+ Assigns a display name for each of the graph edes.
+ |
+
| EdgeProvider
+ Defines a provider of edges of type E
+ |
+
| ImportException
+ Used to show problems with importing a graph.
+ |
+
| JGraphModelAdapter.CellFactory
+ Creates the JGraph cells that reflect the respective JGraphT elements.
+ |
+
| VertexNameProvider
+ Assigns a display name for each of the graph vertices.
+ |
+
| VertexProvider
+ Creates a Vertex of type V
+ |
+
| VertexUpdater
+ Type to handle updates to a vertex when an import gets more information about
+ a vertex after it has been created.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html b/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html new file mode 100644 index 0000000..c8f17a3 --- /dev/null +++ b/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html @@ -0,0 +1,292 @@ + + + + + + +public class CompleteBipartiteGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
CompleteBipartiteGraphGenerator(int partitionOne,
+ int partitionTwo)
+Creates a new CompleteBipartiteGraphGenerator object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Construct a complete bipartite graph
+ |
+
public CompleteBipartiteGraphGenerator(int partitionOne, + int partitionTwo)+
partitionOne - This is the number of vertices in the first partitionpartitionTwo - This is the number of vertices in the second paritionpublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/CompleteGraphGenerator.html b/javadoc/org/jgrapht/generate/CompleteGraphGenerator.html new file mode 100644 index 0000000..e3dbfde --- /dev/null +++ b/javadoc/org/jgrapht/generate/CompleteGraphGenerator.html @@ -0,0 +1,303 @@ + + + + + + +public class CompleteGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
CompleteGraphGenerator(int size)
+Construct a new CompleteGraphGenerator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public CompleteGraphGenerator(int size)+
size - number of vertices to be generatedIllegalArgumentException - if the specified size is negative.public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/EmptyGraphGenerator.html b/javadoc/org/jgrapht/generate/EmptyGraphGenerator.html new file mode 100644 index 0000000..b6c19bf --- /dev/null +++ b/javadoc/org/jgrapht/generate/EmptyGraphGenerator.html @@ -0,0 +1,296 @@ + + + + + + +public class EmptyGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
EmptyGraphGenerator(int size)
+Construct a new EmptyGraphGenerator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public EmptyGraphGenerator(int size)+
size - number of vertices to be generatedIllegalArgumentException - if the specified size is negative.public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/GraphGenerator.html b/javadoc/org/jgrapht/generate/GraphGenerator.html new file mode 100644 index 0000000..b8229a9 --- /dev/null +++ b/javadoc/org/jgrapht/generate/GraphGenerator.html @@ -0,0 +1,235 @@ + + + + + + +public interface GraphGenerator<V,E,T>
+| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,T> resultMap)
+Generate a graph structure.
+ |
+
void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,T> resultMap)+
target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/GridGraphGenerator.html b/javadoc/org/jgrapht/generate/GridGraphGenerator.html new file mode 100644 index 0000000..5313184 --- /dev/null +++ b/javadoc/org/jgrapht/generate/GridGraphGenerator.html @@ -0,0 +1,341 @@ + + + + + + +public class GridGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Modifier and Type | +Field and Description | +
|---|---|
static String |
+CORNER_VERTEX
+Role for the vertices at the corners.
+ |
+
| Constructor and Description | +
|---|
GridGraphGenerator(int rows,
+ int cols)
+Creates a new GridGraphGenerator object with rows x cols dimension.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public static final String CORNER_VERTEX+
public GridGraphGenerator(int rows, + int cols)+
rows - the number of rowscols - the number of columnspublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/HyperCubeGraphGenerator.html b/javadoc/org/jgrapht/generate/HyperCubeGraphGenerator.html new file mode 100644 index 0000000..e4c9da7 --- /dev/null +++ b/javadoc/org/jgrapht/generate/HyperCubeGraphGenerator.html @@ -0,0 +1,290 @@ + + + + + + +public class HyperCubeGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
HyperCubeGraphGenerator(int dim)
+Creates a new HyperCubeGraphGenerator object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+This will generate the hypercube graph
+ |
+
public HyperCubeGraphGenerator(int dim)+
dim - This is the dimension of the hypercube.public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/LinearGraphGenerator.html b/javadoc/org/jgrapht/generate/LinearGraphGenerator.html new file mode 100644 index 0000000..3f58e3a --- /dev/null +++ b/javadoc/org/jgrapht/generate/LinearGraphGenerator.html @@ -0,0 +1,353 @@ + + + + + + +public class LinearGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Modifier and Type | +Field and Description | +
|---|---|
static String |
+END_VERTEX
+Role for the last vertex generated.
+ |
+
static String |
+START_VERTEX
+Role for the first vertex generated.
+ |
+
| Constructor and Description | +
|---|
LinearGraphGenerator(int size)
+Construct a new LinearGraphGenerator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public static final String START_VERTEX+
public static final String END_VERTEX+
public LinearGraphGenerator(int size)+
size - number of vertices to be generatedIllegalArgumentException - if the specified size is negative.public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/RandomGraphGenerator.DefaultEdgeTopologyFactory.html b/javadoc/org/jgrapht/generate/RandomGraphGenerator.DefaultEdgeTopologyFactory.html new file mode 100644 index 0000000..dbbff95 --- /dev/null +++ b/javadoc/org/jgrapht/generate/RandomGraphGenerator.DefaultEdgeTopologyFactory.html @@ -0,0 +1,399 @@ + + + + + + +public class RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE> +extends Object +implements RandomGraphGenerator.EdgeTopologyFactory<VV,EE>+
| Constructor and Description | +
|---|
RandomGraphGenerator.DefaultEdgeTopologyFactory() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+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.
+ |
+
int |
+getMaxEdgesForVertexNum(Graph<VV,EE> targetGraph)
+Return max edges for that graph.
+ |
+
boolean |
+isNumberOfEdgesValid(Graph<VV,EE> targetGraph,
+ int numberOfEdges)
+checks if the numOfEdges is smaller than the Max edges according to
+ the following table:
+ |
+
public RandomGraphGenerator.DefaultEdgeTopologyFactory()+
public void createEdges(Graph<VV,EE> targetGraph, + Map<Integer,VV> orderToVertexMap, + int numberOfEdges, + Random randomizer)+
RandomGraphGenerator.EdgeTopologyFactorycreateEdges in interface RandomGraphGenerator.EdgeTopologyFactory<VV,EE>targetGraph - - guranteed to start with zero edges.orderToVertexMap - - key=Integer of vertex order . between zero
+ to numOfVertexes (exclusive). value = vertex from the graph. unique.numberOfEdges - - to create in the graphpublic boolean isNumberOfEdgesValid(Graph<VV,EE> targetGraph, + int numberOfEdges)+
+
| Graph Type | +Directed / UnDirected | +multiple edges | +loops | +Max Edges | +
|---|---|---|---|---|
| SimpleGraph | +UnDirected | +- | +- | +N(N-1)/2 | +
| Multigraph | +UnDirected | ++ | +- | +Infinite | +
| Pseudograph | +UnDirected | ++ | ++ | +Infinite | +
| SimpleDirectedGraph | +Directed | +- | +- | +N (N-1) | +
| DefaultDirectedGraph | +Directed | +- | ++ | +N*(N-1)+ N = N^2 | +
| DirectedMultigraph | +Directed | ++ | ++ | +Infinite | +
isNumberOfEdgesValid in interface RandomGraphGenerator.EdgeTopologyFactory<VV,EE>targetGraph - guranteed to start with zero edges.RandomGraphGenerator.EdgeTopologyFactory.isNumberOfEdgesValid(Graph,
+ int)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/RandomGraphGenerator.EdgeTopologyFactory.html b/javadoc/org/jgrapht/generate/RandomGraphGenerator.EdgeTopologyFactory.html new file mode 100644 index 0000000..381fd75 --- /dev/null +++ b/javadoc/org/jgrapht/generate/RandomGraphGenerator.EdgeTopologyFactory.html @@ -0,0 +1,261 @@ + + + + + + +public static interface RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
+| Modifier and Type | +Method and Description | +
|---|---|
void |
+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.
+ |
+
boolean |
+isNumberOfEdgesValid(Graph<VV,EE> targetGraph,
+ int numberOfEdges)
+Checks if the graph can contain the givven numberOfEdges according to
+ the graph type restrictions.
+ |
+
void createEdges(Graph<VV,EE> targetGraph, + Map<Integer,VV> orderToVertexMap, + int numberOfEdges, + Random randomizer)+
targetGraph - - guranteed to start with zero edges.orderToVertexMap - - key=Integer of vertex order . between zero
+ to numOfVertexes (exclusive). value = vertex from the graph. unique.numberOfEdges - - to create in the graphrandomizer - boolean isNumberOfEdgesValid(Graph<VV,EE> targetGraph, + int numberOfEdges)+
targetGraph - guranteed to start with zero edges.numberOfEdges - Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/RandomGraphGenerator.html b/javadoc/org/jgrapht/generate/RandomGraphGenerator.html new file mode 100644 index 0000000..c2f3393 --- /dev/null +++ b/javadoc/org/jgrapht/generate/RandomGraphGenerator.html @@ -0,0 +1,416 @@ + + + + + + +public class RandomGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
However, two instances which use the same constructor parameters will + produce two different random graphs (note: as with any random generator, + there is always a small possibility that two instances will create the same + results).
| Modifier and Type | +Class and Description | +
|---|---|
class |
+RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE>
+Default implementation of the EdgeTopologyFactory interface.
+ |
+
static interface |
+RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
+This class is used to generate the edge topology for a graph.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected int |
+numOfEdges |
+
protected int |
+numOfVertexes |
+
protected Random |
+randomizer |
+
| Constructor and Description | +
|---|
RandomGraphGenerator(int aNumOfVertexes,
+ int aNumOfEdges) |
+
RandomGraphGenerator(int aNumOfVertexes,
+ int aNumOfEdges,
+ long seed) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+(non-Javadoc)
+ |
+
long |
+getRandomSeed() |
+
protected int numOfVertexes+
protected int numOfEdges+
protected Random randomizer+
public RandomGraphGenerator(int aNumOfVertexes, + int aNumOfEdges)+
public RandomGraphGenerator(int aNumOfVertexes, + int aNumOfEdges, + long seed)+
public long getRandomSeed()+
public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)IllegalArgumentException - if the aNumOfEdges passed in the
+ constructor, cannot be created on a graph of the concrete type with
+ aNumOfVertexes.
+ org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory#isNumberOfEdgesValid(org.jgrapht.Graph,
+ int)GraphGenerator.generateGraph(Graph, VertexFactory, Map)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/RingGraphGenerator.html b/javadoc/org/jgrapht/generate/RingGraphGenerator.html new file mode 100644 index 0000000..fcf5578 --- /dev/null +++ b/javadoc/org/jgrapht/generate/RingGraphGenerator.html @@ -0,0 +1,298 @@ + + + + + + +public class RingGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
RingGraphGenerator(int size)
+Construct a new RingGraphGenerator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public RingGraphGenerator(int size)+
size - number of vertices to be generatedIllegalArgumentException - if the specified size is negative.public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/ScaleFreeGraphGenerator.html b/javadoc/org/jgrapht/generate/ScaleFreeGraphGenerator.html new file mode 100644 index 0000000..19e07aa --- /dev/null +++ b/javadoc/org/jgrapht/generate/ScaleFreeGraphGenerator.html @@ -0,0 +1,311 @@ + + + + + + +public class ScaleFreeGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Constructor and Description | +
|---|
ScaleFreeGraphGenerator(int size)
+Constructs a new ScaleFreeGraphGenerator.
+ |
+
ScaleFreeGraphGenerator(int size,
+ long seed)
+Constructs a new ScaleFreeGraphGenerator using fixed
+ seed for the random generator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generates scale-free network with size passed to the
+ constructor.
+ |
+
public ScaleFreeGraphGenerator(int size)+
size - number of vertices to be generatedpublic ScaleFreeGraphGenerator(int size, + long seed)+
size - number of vertices to be generatedseed - initial seed for the random generatorpublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - unused parameterCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/SimpleWeightedBipartiteGraphMatrixGenerator.html b/javadoc/org/jgrapht/generate/SimpleWeightedBipartiteGraphMatrixGenerator.html new file mode 100644 index 0000000..9894a4a --- /dev/null +++ b/javadoc/org/jgrapht/generate/SimpleWeightedBipartiteGraphMatrixGenerator.html @@ -0,0 +1,323 @@ + + + + + + +public class SimpleWeightedBipartiteGraphMatrixGenerator<V,E> +extends WeightedGraphGeneratorAdapter<V,E,V>+
weights| Constructor and Description | +
|---|
SimpleWeightedBipartiteGraphMatrixGenerator() |
+
| Modifier and Type | +Method and Description | +
|---|---|
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
+first(List<? extends V> first) |
+
void |
+generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap) |
+
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
+second(List<? extends V> second) |
+
generateGraph, weightspublic SimpleWeightedBipartiteGraphMatrixGenerator()+
public SimpleWeightedBipartiteGraphMatrixGenerator<V,E> first(List<? extends V> first)+
public SimpleWeightedBipartiteGraphMatrixGenerator<V,E> second(List<? extends V> second)+
public void generateGraph(WeightedGraph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in class WeightedGraphGeneratorAdapter<V,E,V>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/SimpleWeightedGraphMatrixGenerator.html b/javadoc/org/jgrapht/generate/SimpleWeightedGraphMatrixGenerator.html new file mode 100644 index 0000000..369840d --- /dev/null +++ b/javadoc/org/jgrapht/generate/SimpleWeightedGraphMatrixGenerator.html @@ -0,0 +1,353 @@ + + + + + + +public class SimpleWeightedGraphMatrixGenerator<V,E> +extends WeightedGraphGeneratorAdapter<V,E,V>+
| Modifier and Type | +Field and Description | +
|---|---|
protected List<V> |
+vertices |
+
weights| Constructor and Description | +
|---|
SimpleWeightedGraphMatrixGenerator() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap) |
+
static int[] |
+range(int from,
+ int to) |
+
SimpleWeightedGraphMatrixGenerator<V,E> |
+vertices(List<V> vertices) |
+
generateGraph, weightspublic SimpleWeightedGraphMatrixGenerator()+
public static int[] range(int from, + int to)+
public SimpleWeightedGraphMatrixGenerator<V,E> vertices(List<V> vertices)+
public void generateGraph(WeightedGraph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in class WeightedGraphGeneratorAdapter<V,E,V>Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/StarGraphGenerator.html b/javadoc/org/jgrapht/generate/StarGraphGenerator.html new file mode 100644 index 0000000..7b7f332 --- /dev/null +++ b/javadoc/org/jgrapht/generate/StarGraphGenerator.html @@ -0,0 +1,325 @@ + + + + + + +public class StarGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Modifier and Type | +Field and Description | +
|---|---|
static String |
+CENTER_VERTEX |
+
| Constructor and Description | +
|---|
StarGraphGenerator(int order)
+Creates a new StarGraphGenerator object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generates a star graph with the designated order from the constructor
+ |
+
public static final String CENTER_VERTEX+
public StarGraphGenerator(int order)+
order - number of total vertices including the center vertexpublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/WeightedGraphGenerator.html b/javadoc/org/jgrapht/generate/WeightedGraphGenerator.html new file mode 100644 index 0000000..2de604d --- /dev/null +++ b/javadoc/org/jgrapht/generate/WeightedGraphGenerator.html @@ -0,0 +1,358 @@ + + + + + + +public abstract class WeightedGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Modifier and Type | +Field and Description | +
|---|---|
protected Class<? extends E> |
+edgeClass |
+
protected EdgeFactory<V,E> |
+edgeFactory |
+
protected double[][] |
+weights |
+
| Constructor and Description | +
|---|
WeightedGraphGenerator() |
+
| Modifier and Type | +Method and Description | +
|---|---|
WeightedGraphGenerator<V,E> |
+edgeClass(Class<? extends E> edgeClass) |
+
WeightedGraphGenerator<V,E> |
+edgeFactory(EdgeFactory<V,E> edgeFactory) |
+
WeightedGraphGenerator<V,E> |
+weights(double[][] weights) |
+
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgenerateGraphprotected EdgeFactory<V,E> edgeFactory+
protected double[][] weights+
public WeightedGraphGenerator()+
public WeightedGraphGenerator<V,E> edgeFactory(EdgeFactory<V,E> edgeFactory)+
public WeightedGraphGenerator<V,E> edgeClass(Class<? extends E> edgeClass)+
public WeightedGraphGenerator<V,E> weights(double[][] weights)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/WeightedGraphGeneratorAdapter.html b/javadoc/org/jgrapht/generate/WeightedGraphGeneratorAdapter.html new file mode 100644 index 0000000..4966b0b --- /dev/null +++ b/javadoc/org/jgrapht/generate/WeightedGraphGeneratorAdapter.html @@ -0,0 +1,361 @@ + + + + + + +public abstract class WeightedGraphGeneratorAdapter<V,E,T> +extends Object +implements GraphGenerator<V,E,T>+
| Modifier and Type | +Field and Description | +
|---|---|
protected double[][] |
+weights |
+
| Constructor and Description | +
|---|
WeightedGraphGeneratorAdapter() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,T> resultMap)
+Generate a graph structure.
+ |
+
abstract void |
+generateGraph(WeightedGraph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,T> resultMap) |
+
WeightedGraphGeneratorAdapter<V,E,T> |
+weights(double[][] weights) |
+
public WeightedGraphGeneratorAdapter()+
public abstract void generateGraph(WeightedGraph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,T> resultMap)+
public WeightedGraphGeneratorAdapter<V,E,T> weights(double[][] weights)+
public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,T> resultMap)+
GraphGeneratorgenerateGraph in interface GraphGenerator<V,E,T>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/WheelGraphGenerator.html b/javadoc/org/jgrapht/generate/WheelGraphGenerator.html new file mode 100644 index 0000000..54e8fb8 --- /dev/null +++ b/javadoc/org/jgrapht/generate/WheelGraphGenerator.html @@ -0,0 +1,360 @@ + + + + + + +public class WheelGraphGenerator<V,E> +extends Object +implements GraphGenerator<V,E,V>+
| Modifier and Type | +Field and Description | +
|---|---|
static String |
+HUB_VERTEX
+Role for the hub vertex.
+ |
+
| Constructor and Description | +
|---|
WheelGraphGenerator(int size)
+Creates a new WheelGraphGenerator object.
+ |
+
WheelGraphGenerator(int size,
+ boolean inwardSpokes)
+Construct a new WheelGraphGenerator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ Map<String,V> resultMap)
+Generate a graph structure.
+ |
+
public static final String HUB_VERTEX+
public WheelGraphGenerator(int size)+
size - number of vertices to be generated.public WheelGraphGenerator(int size, + boolean inwardSpokes)+
size - number of vertices to be generated.inwardSpokes - if true and graph is directed, spokes
+ are oriented from rim to hub; else from hub to rim.IllegalArgumentExceptionpublic void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + Map<String,V> resultMap)+
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
+ non-empty on entry, the result will be a disconnected graph since
+ generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - if non-null, receives implementation-specific mappings
+ from String roles to graph elements (or collections of graph elements)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/CompleteBipartiteGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/CompleteBipartiteGraphGenerator.html new file mode 100644 index 0000000..7e1dd0a --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/CompleteBipartiteGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/CompleteGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/CompleteGraphGenerator.html new file mode 100644 index 0000000..def499a --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/CompleteGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/EmptyGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/EmptyGraphGenerator.html new file mode 100644 index 0000000..c554ada --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/EmptyGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/GraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/GraphGenerator.html new file mode 100644 index 0000000..65cc86f --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/GraphGenerator.html @@ -0,0 +1,292 @@ + + + + + + +| Package | +Description | +
|---|---|
| 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.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphReader<V,E> |
+
class |
+PartiteRandomGraphGenerator<V,E>
+PartiteRandomGraphGenerator generates a partite uniform random
+ graph of any size.
+ |
+
class |
+UniformRandomGraphGenerator
+UniformRandomGraphGenerator generates a uniform random graph
+ of any size.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+CompleteBipartiteGraphGenerator<V,E>
+Generates a complete
+ bipartite graph of any size.
+ |
+
class |
+CompleteGraphGenerator<V,E>
+Generates a complete graph of any size.
+ |
+
class |
+EmptyGraphGenerator<V,E>
+Generates an empty
+ graph of any size.
+ |
+
class |
+GridGraphGenerator<V,E>
+Generates a bidirectional grid graph of any
+ size.
+ |
+
class |
+HyperCubeGraphGenerator<V,E>
+Generates a hyper
+ cube graph of any size.
+ |
+
class |
+LinearGraphGenerator<V,E>
+Generates a linear graph of any size.
+ |
+
class |
+RandomGraphGenerator<V,E>
+This Generator creates a random-topology graph of a specified number of
+ vertexes and edges.
+ |
+
class |
+RingGraphGenerator<V,E>
+Generates a ring graph of any size.
+ |
+
class |
+ScaleFreeGraphGenerator<V,E>
+Generates directed or undirected scale-free network
+ of any size.
+ |
+
class |
+SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
+
class |
+SimpleWeightedGraphMatrixGenerator<V,E> |
+
class |
+StarGraphGenerator<V,E>
+Generates a star
+ graph of any size.
+ |
+
class |
+WeightedGraphGenerator<V,E> |
+
class |
+WeightedGraphGeneratorAdapter<V,E,T>
+WeightedGraphGenerator defines an interface for generating graph structures
+ having edges weighted with real values.
+ |
+
class |
+WheelGraphGenerator<V,E>
+Generates a wheel
+ graph of any size.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/GridGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/GridGraphGenerator.html new file mode 100644 index 0000000..a43abd5 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/GridGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/HyperCubeGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/HyperCubeGraphGenerator.html new file mode 100644 index 0000000..1c8bd98 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/HyperCubeGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/LinearGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/LinearGraphGenerator.html new file mode 100644 index 0000000..8f31a0f --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/LinearGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.DefaultEdgeTopologyFactory.html b/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.DefaultEdgeTopologyFactory.html new file mode 100644 index 0000000..01328ee --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.DefaultEdgeTopologyFactory.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.EdgeTopologyFactory.html b/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.EdgeTopologyFactory.html new file mode 100644 index 0000000..1e31218 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.EdgeTopologyFactory.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE>
+Default implementation of the EdgeTopologyFactory interface.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.html new file mode 100644 index 0000000..2940ddd --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/RandomGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/RingGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/RingGraphGenerator.html new file mode 100644 index 0000000..172af4f --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/RingGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/ScaleFreeGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/ScaleFreeGraphGenerator.html new file mode 100644 index 0000000..4b59957 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/ScaleFreeGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/SimpleWeightedBipartiteGraphMatrixGenerator.html b/javadoc/org/jgrapht/generate/class-use/SimpleWeightedBipartiteGraphMatrixGenerator.html new file mode 100644 index 0000000..319057b --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/SimpleWeightedBipartiteGraphMatrixGenerator.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
+SimpleWeightedBipartiteGraphMatrixGenerator.first(List<? extends V> first) |
+
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
+SimpleWeightedBipartiteGraphMatrixGenerator.second(List<? extends V> second) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/SimpleWeightedGraphMatrixGenerator.html b/javadoc/org/jgrapht/generate/class-use/SimpleWeightedGraphMatrixGenerator.html new file mode 100644 index 0000000..9611efc --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/SimpleWeightedGraphMatrixGenerator.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
SimpleWeightedGraphMatrixGenerator<V,E> |
+SimpleWeightedGraphMatrixGenerator.vertices(List<V> vertices) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/StarGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/StarGraphGenerator.html new file mode 100644 index 0000000..d62bb45 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/StarGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/WeightedGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/WeightedGraphGenerator.html new file mode 100644 index 0000000..39e823d --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/WeightedGraphGenerator.html @@ -0,0 +1,167 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
WeightedGraphGenerator<V,E> |
+WeightedGraphGenerator.edgeClass(Class<? extends E> edgeClass) |
+
WeightedGraphGenerator<V,E> |
+WeightedGraphGenerator.edgeFactory(EdgeFactory<V,E> edgeFactory) |
+
WeightedGraphGenerator<V,E> |
+WeightedGraphGenerator.weights(double[][] weights) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/WeightedGraphGeneratorAdapter.html b/javadoc/org/jgrapht/generate/class-use/WeightedGraphGeneratorAdapter.html new file mode 100644 index 0000000..6d6e9f9 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/WeightedGraphGeneratorAdapter.html @@ -0,0 +1,176 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
+
class |
+SimpleWeightedGraphMatrixGenerator<V,E> |
+
| Modifier and Type | +Method and Description | +
|---|---|
WeightedGraphGeneratorAdapter<V,E,T> |
+WeightedGraphGeneratorAdapter.weights(double[][] weights) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/class-use/WheelGraphGenerator.html b/javadoc/org/jgrapht/generate/class-use/WheelGraphGenerator.html new file mode 100644 index 0000000..c86a0a9 --- /dev/null +++ b/javadoc/org/jgrapht/generate/class-use/WheelGraphGenerator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/package-frame.html b/javadoc/org/jgrapht/generate/package-frame.html new file mode 100644 index 0000000..ddca67d --- /dev/null +++ b/javadoc/org/jgrapht/generate/package-frame.html @@ -0,0 +1,39 @@ + + + + + + +| Interface | +Description | +
|---|---|
| GraphGenerator<V,E,T> | +
+ GraphGenerator defines an interface for generating new graph structures.
+ |
+
| RandomGraphGenerator.EdgeTopologyFactory<VV,EE> | +
+ This class is used to generate the edge topology for a graph.
+ |
+
| Class | +Description | +
|---|---|
| CompleteBipartiteGraphGenerator<V,E> | +
+ Generates a complete
+ bipartite graph of any size.
+ |
+
| CompleteGraphGenerator<V,E> | +
+ Generates a complete graph of any size.
+ |
+
| EmptyGraphGenerator<V,E> | +
+ Generates an empty
+ graph of any size.
+ |
+
| GridGraphGenerator<V,E> | +
+ Generates a bidirectional grid graph of any
+ size.
+ |
+
| HyperCubeGraphGenerator<V,E> | +
+ Generates a hyper
+ cube graph of any size.
+ |
+
| LinearGraphGenerator<V,E> | +
+ Generates a linear graph of any size.
+ |
+
| RandomGraphGenerator<V,E> | +
+ This Generator creates a random-topology graph of a specified number of
+ vertexes and edges.
+ |
+
| RingGraphGenerator<V,E> | +
+ Generates a ring graph of any size.
+ |
+
| ScaleFreeGraphGenerator<V,E> | +
+ Generates directed or undirected scale-free network
+ of any size.
+ |
+
| SimpleWeightedBipartiteGraphMatrixGenerator<V,E> | ++ |
| SimpleWeightedGraphMatrixGenerator<V,E> | ++ |
| StarGraphGenerator<V,E> | +
+ Generates a star
+ graph of any size.
+ |
+
| WeightedGraphGenerator<V,E> | ++ |
| WeightedGraphGeneratorAdapter<V,E,T> | +
+ WeightedGraphGenerator defines an interface for generating graph structures
+ having edges weighted with real values.
+ |
+
| WheelGraphGenerator<V,E> | +
+ Generates a wheel
+ graph of any size.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/package-tree.html b/javadoc/org/jgrapht/generate/package-tree.html new file mode 100644 index 0000000..41621e3 --- /dev/null +++ b/javadoc/org/jgrapht/generate/package-tree.html @@ -0,0 +1,153 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/generate/package-use.html b/javadoc/org/jgrapht/generate/package-use.html new file mode 100644 index 0000000..8c3cca5 --- /dev/null +++ b/javadoc/org/jgrapht/generate/package-use.html @@ -0,0 +1,198 @@ + + + + + + +| Package | +Description | +
|---|---|
| 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.generate | +
+ Generators for graphs of various topologies.
+ |
+
| Class and Description | +
|---|
| GraphGenerator
+ GraphGenerator defines an interface for generating new graph structures.
+ |
+
| Class and Description | +
|---|
| GraphGenerator
+ GraphGenerator defines an interface for generating new graph structures.
+ |
+
| RandomGraphGenerator.EdgeTopologyFactory
+ This class is used to generate the edge topology for a graph.
+ |
+
| SimpleWeightedBipartiteGraphMatrixGenerator | +
| SimpleWeightedGraphMatrixGenerator | +
| WeightedGraphGenerator | +
| WeightedGraphGeneratorAdapter
+ WeightedGraphGenerator defines an interface for generating graph structures
+ having edges weighted with real values.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AbstractBaseGraph.DirectedEdgeContainer.html b/javadoc/org/jgrapht/graph/AbstractBaseGraph.DirectedEdgeContainer.html new file mode 100644 index 0000000..5bea78e --- /dev/null +++ b/javadoc/org/jgrapht/graph/AbstractBaseGraph.DirectedEdgeContainer.html @@ -0,0 +1,338 @@ + + + + + + +protected static class AbstractBaseGraph.DirectedEdgeContainer<VV,EE> +extends Object +implements Serializable+
In this edge container we use array lists to minimize memory toll. + However, for high-degree vertices we replace the entire edge container + with a direct access subclass (to be implemented).
| Modifier and Type | +Method and Description | +
|---|---|
void |
+addIncomingEdge(EE e)
+.
+ |
+
void |
+addOutgoingEdge(EE e)
+.
+ |
+
Set<EE> |
+getUnmodifiableIncomingEdges()
+A lazy build of unmodifiable incoming edge set.
+ |
+
Set<EE> |
+getUnmodifiableOutgoingEdges()
+A lazy build of unmodifiable outgoing edge set.
+ |
+
void |
+removeIncomingEdge(EE e)
+.
+ |
+
void |
+removeOutgoingEdge(EE e)
+.
+ |
+
public Set<EE> getUnmodifiableIncomingEdges()+
public Set<EE> getUnmodifiableOutgoingEdges()+
public void addIncomingEdge(EE e)+
e - public void addOutgoingEdge(EE e)+
e - public void removeIncomingEdge(EE e)+
e - public void removeOutgoingEdge(EE e)+
e - Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AbstractBaseGraph.DirectedSpecifics.html b/javadoc/org/jgrapht/graph/AbstractBaseGraph.DirectedSpecifics.html new file mode 100644 index 0000000..58973cf --- /dev/null +++ b/javadoc/org/jgrapht/graph/AbstractBaseGraph.DirectedSpecifics.html @@ -0,0 +1,530 @@ + + + + + + +protected class AbstractBaseGraph.DirectedSpecifics +extends Object +implements Serializable+
| Modifier and Type | +Field and Description | +
|---|---|
protected Map<V,AbstractBaseGraph.DirectedEdgeContainer<V,E>> |
+vertexMapDirected |
+
| Constructor and Description | +
|---|
AbstractBaseGraph.DirectedSpecifics() |
+
AbstractBaseGraph.DirectedSpecifics(Map<V,AbstractBaseGraph.DirectedEdgeContainer<V,E>> vertexMap) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+addEdgeToTouchingVertices(E e)
+Adds the specified edge to the edge containers of its source and
+ target vertices.
+ |
+
void |
+addVertex(V v) |
+
int |
+degreeOf(V vertex)
+.
+ |
+
Set<E> |
+edgesOf(V vertex)
+.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+.
+ |
+
Set<V> |
+getVertexSet() |
+
Set<E> |
+incomingEdgesOf(V vertex)
+.
+ |
+
int |
+inDegreeOf(V vertex)
+.
+ |
+
int |
+outDegreeOf(V vertex)
+.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+.
+ |
+
void |
+removeEdgeFromTouchingVertices(E e)
+Removes the specified edge from the edge containers of its source and
+ target vertices.
+ |
+
protected Map<V,AbstractBaseGraph.DirectedEdgeContainer<V,E>> vertexMapDirected+
public AbstractBaseGraph.DirectedSpecifics()+
public AbstractBaseGraph.DirectedSpecifics(Map<V,AbstractBaseGraph.DirectedEdgeContainer<V,E>> vertexMap)+
public void addVertex(V v)+
public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graph.getAllEdges(Object, Object)public E getEdge(V sourceVertex, + V targetVertex)+
Graph.getEdge(Object, Object)public void addEdgeToTouchingVertices(E e)+
public int degreeOf(V vertex)+
UndirectedGraph.degreeOf(Object)public Set<E> edgesOf(V vertex)+
Graph.edgesOf(Object)public int inDegreeOf(V vertex)+
DirectedGraph.inDegreeOf(Object)public Set<E> incomingEdgesOf(V vertex)+
DirectedGraph.incomingEdgesOf(Object)public int outDegreeOf(V vertex)+
DirectedGraph.outDegreeOf(Object)public Set<E> outgoingEdgesOf(V vertex)+
DirectedGraph.outgoingEdgesOf(Object)public void removeEdgeFromTouchingVertices(E e)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AbstractBaseGraph.UndirectedSpecifics.html b/javadoc/org/jgrapht/graph/AbstractBaseGraph.UndirectedSpecifics.html new file mode 100644 index 0000000..4799b91 --- /dev/null +++ b/javadoc/org/jgrapht/graph/AbstractBaseGraph.UndirectedSpecifics.html @@ -0,0 +1,494 @@ + + + + + + +protected class AbstractBaseGraph.UndirectedSpecifics +extends Object +implements Serializable+
| Constructor and Description | +
|---|
AbstractBaseGraph.UndirectedSpecifics() |
+
AbstractBaseGraph.UndirectedSpecifics(Map<V,org.jgrapht.graph.AbstractBaseGraph.UndirectedEdgeContainer<V,E>> vertexMap) |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+addEdgeToTouchingVertices(E e)
+Adds the specified edge to the edge containers of its source and
+ target vertices.
+ |
+
void |
+addVertex(V v) |
+
int |
+degreeOf(V vertex)
+.
+ |
+
Set<E> |
+edgesOf(V vertex)
+.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+.
+ |
+
Set<V> |
+getVertexSet() |
+
Set<E> |
+incomingEdgesOf(V vertex)
+.
+ |
+
int |
+inDegreeOf(V vertex)
+.
+ |
+
int |
+outDegreeOf(V vertex)
+.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+.
+ |
+
void |
+removeEdgeFromTouchingVertices(E e)
+Removes the specified edge from the edge containers of its source and
+ target vertices.
+ |
+
public AbstractBaseGraph.UndirectedSpecifics()+
public void addVertex(V v)+
public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graph.getAllEdges(Object, Object)public E getEdge(V sourceVertex, + V targetVertex)+
Graph.getEdge(Object, Object)public void addEdgeToTouchingVertices(E e)+
public int degreeOf(V vertex)+
public Set<E> edgesOf(V vertex)+
Graph.edgesOf(Object)public int inDegreeOf(V vertex)+
DirectedGraph.inDegreeOf(Object)public Set<E> incomingEdgesOf(V vertex)+
DirectedGraph.incomingEdgesOf(Object)public int outDegreeOf(V vertex)+
DirectedGraph.outDegreeOf(Object)public Set<E> outgoingEdgesOf(V vertex)+
DirectedGraph.outgoingEdgesOf(Object)public void removeEdgeFromTouchingVertices(E e)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AbstractBaseGraph.html b/javadoc/org/jgrapht/graph/AbstractBaseGraph.html new file mode 100644 index 0000000..de2fad5 --- /dev/null +++ b/javadoc/org/jgrapht/graph/AbstractBaseGraph.html @@ -0,0 +1,1059 @@ + + + + + + +public abstract class AbstractBaseGraph<V,E> +extends AbstractGraph<V,E> +implements Graph<V,E>, Cloneable, Serializable+
Graph interface.
+ Its subclasses add various restrictions to get more specific graphs. The
+ decision whether it is directed or undirected is decided at construction time
+ and cannot be later modified (see constructor for details).
+
+ This graph implementation guarantees deterministic vertex and edge set
+ ordering (via LinkedHashMap and LinkedHashSet).
| Modifier and Type | +Class and Description | +
|---|---|
protected static class |
+AbstractBaseGraph.DirectedEdgeContainer<VV,EE>
+A container for vertex edges.
+ |
+
protected class |
+AbstractBaseGraph.DirectedSpecifics
+.
+ |
+
protected class |
+AbstractBaseGraph.UndirectedSpecifics
+.
+ |
+
| Modifier | +Constructor and Description | +
|---|---|
protected |
+AbstractBaseGraph(EdgeFactory<V,E> ef,
+ boolean allowMultipleEdges,
+ boolean allowLoops)
+Construct a new graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
Object |
+clone()
+Returns a shallow copy of this graph instance.
+ |
+
boolean |
+containsEdge(E e)
+Returns true if this graph contains the specified edge.
+ |
+
boolean |
+containsVertex(V v)
+Returns true if this graph contains the specified vertex.
+ |
+
protected AbstractBaseGraph.DirectedSpecifics |
+createDirectedSpecifics() |
+
protected AbstractBaseGraph.UndirectedSpecifics |
+createUndirectedSpecifics() |
+
int |
+degreeOf(V vertex) |
+
Set<E> |
+edgeSet()
+Returns a set of the edges contained in this graph.
+ |
+
Set<E> |
+edgesOf(V vertex)
+Returns a set of all edges touching the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
EdgeFactory<V,E> |
+getEdgeFactory()
+Returns the edge factory using which this graph creates new edges.
+ |
+
V |
+getEdgeSource(E e)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E e)
+Returns the target vertex of an edge.
+ |
+
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
Set<E> |
+incomingEdgesOf(V vertex) |
+
int |
+inDegreeOf(V vertex) |
+
boolean |
+isAllowingLoops()
+Returns
+true if and only if self-loops are allowed in this
+ graph. |
+
boolean |
+isAllowingMultipleEdges()
+Returns
+true if and only if multiple edges are allowed in
+ this graph. |
+
int |
+outDegreeOf(V vertex) |
+
Set<E> |
+outgoingEdgesOf(V vertex) |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
void |
+setEdgeSetFactory(EdgeSetFactory<V,E> edgeSetFactory)
+Set the
+EdgeSetFactory to use for this graph. |
+
void |
+setEdgeWeight(E e,
+ double weight) |
+
Set<V> |
+vertexSet()
+Returns a set of the vertices contained in this graph.
+ |
+
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdge, removeAllEdges, removeAllEdges, removeAllVerticesprotected AbstractBaseGraph(EdgeFactory<V,E> ef, + boolean allowMultipleEdges, + boolean allowLoops)+
ef - the edge factory of the new graph.allowMultipleEdges - whether to allow multiple edges or not.allowLoops - whether to allow edges that are self-loops or not.NullPointerException - if the specified edge factory is
+ null.public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getAllEdges(Object, Object)public boolean isAllowingLoops()+
true if and only if self-loops are allowed in this
+ graph. A self loop is an edge that its source and target vertices are the
+ same.true if and only if graph loops are allowed.public boolean isAllowingMultipleEdges()+
true if and only if multiple edges are allowed in
+ this graph. The meaning of multiple edges is that there can be many edges
+ going from vertex v1 to vertex v2.true if and only if multiple edges are allowed.public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
getEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getEdge(Object, Object)public EdgeFactory<V,E> getEdgeFactory()+
GraphgetEdgeFactory in interface Graph<V,E>Graph.getEdgeFactory()public void setEdgeSetFactory(EdgeSetFactory<V,E> edgeSetFactory)+
EdgeSetFactory to use for this graph. Initially, a graph
+ is created with a default implementation which always supplies an ArrayList with capacity 1.edgeSetFactory - factory to use for subsequently created edge sets
+ (this call has no effect on existing edge sets)public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.addVertex in interface Graph<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)public V getEdgeSource(E e)+
GraphgetEdgeSource in interface Graph<V,E>e - edge of interestGraph.getEdgeSource(Object)public V getEdgeTarget(E e)+
GraphgetEdgeTarget in interface Graph<V,E>e - edge of interestGraph.getEdgeTarget(Object)public Object clone()+
clone in class ObjectRuntimeExceptionObject.clone()public boolean containsEdge(E e)+
Graphe2 such that e.equals(e2). If the
+ specified edge is null returns false.containsEdge in interface Graph<V,E>e - edge whose presence in this graph is to be tested.Graph.containsEdge(Object)public boolean containsVertex(V v)+
Graphu such that u.equals(v). If the
+ specified vertex is null returns false.containsVertex in interface Graph<V,E>v - vertex whose presence in this graph is to be tested.Graph.containsVertex(Object)public int degreeOf(V vertex)+
UndirectedGraph.degreeOf(Object)public Set<E> edgeSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
edgeSet in interface Graph<V,E>Graph.edgeSet()public Set<E> edgesOf(V vertex)+
GraphedgesOf in interface Graph<V,E>vertex - the vertex for which a set of touching edges is to be
+ returned.Graph.edgesOf(Object)public int inDegreeOf(V vertex)+
DirectedGraph.inDegreeOf(Object)public int outDegreeOf(V vertex)+
DirectedGraph.outDegreeOf(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
removeEdge in interface Graph<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)public Set<V> vertexSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
vertexSet in interface Graph<V,E>Graph.vertexSet()public double getEdgeWeight(E e)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.getEdgeWeight in interface Graph<V,E>e - edge of interestGraph.getEdgeWeight(Object)public void setEdgeWeight(E e, + double weight)+ +
protected AbstractBaseGraph.UndirectedSpecifics createUndirectedSpecifics()+
protected AbstractBaseGraph.DirectedSpecifics createDirectedSpecifics()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AbstractGraph.html b/javadoc/org/jgrapht/graph/AbstractGraph.html new file mode 100644 index 0000000..6dc9efc --- /dev/null +++ b/javadoc/org/jgrapht/graph/AbstractGraph.html @@ -0,0 +1,533 @@ + + + + + + +public abstract class AbstractGraph<V,E> +extends Object +implements Graph<V,E>+
Graph,
+DirectedGraph,
+UndirectedGraph| Modifier | +Constructor and Description | +
|---|---|
protected |
+AbstractGraph()
+Construct a new empty graph object.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected boolean |
+assertVertexExist(V v)
+Ensures that the specified vertex exists in this graph, or else throws
+ exception.
+ |
+
boolean |
+containsEdge(V sourceVertex,
+ V targetVertex)
+Returns true if and only if this graph contains an edge going
+ from the source vertex to the target vertex.
+ |
+
boolean |
+equals(Object obj)
+Indicates whether some other object is "equal to" this graph.
+ |
+
int |
+hashCode()
+Returns a hash code value for this graph.
+ |
+
boolean |
+removeAllEdges(Collection<? extends E> edges)
+Removes all the edges in this graph that are also contained in the
+ specified edge collection.
+ |
+
protected boolean |
+removeAllEdges(E[] edges)
+Removes all the edges in this graph that are also contained in the
+ specified edge array.
+ |
+
Set<E> |
+removeAllEdges(V sourceVertex,
+ V targetVertex)
+Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges.
+ |
+
boolean |
+removeAllVertices(Collection<? extends V> vertices)
+Removes all the vertices in this graph that are also contained in the
+ specified vertex collection.
+ |
+
String |
+toString()
+Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph.
+ |
+
protected String |
+toStringFromSets(Collection<? extends V> vertexSet,
+ Collection<? extends E> edgeSet,
+ boolean directed)
+Helper for subclass implementations of toString( ).
+ |
+
clone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, vertexSetprotected AbstractGraph()+
public boolean containsEdge(V sourceVertex, + V targetVertex)+
Graph
+ null, returns false.containsEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.containsEdge(Object, Object)public boolean removeAllEdges(Collection<? extends E> edges)+
GraphGraph.removeEdge(Object) method.removeAllEdges in interface Graph<V,E>edges - edges to be removed from this graph.Graph.removeAllEdges(Collection)public Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
Graphnull if any of the specified vertices does not exist in the
+ graph. If both vertices exist but no edge is found, returns an empty set.
+ This method will either invoke the Graph.removeEdge(Object) method, or
+ the Graph.removeEdge(Object, Object) method.removeAllEdges in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if either vertex is not
+ part of graphGraph.removeAllEdges(Object, Object)public boolean removeAllVertices(Collection<? extends V> vertices)+
GraphGraph.removeVertex(Object) method.removeAllVertices in interface Graph<V,E>vertices - vertices to be removed from this graph.Graph.removeAllVertices(Collection)public String toString()+
protected boolean assertVertexExist(V v)+
v - vertextrue if this assertion holds.NullPointerException - if specified vertex is null.IllegalArgumentException - if specified vertex does not exist in
+ this graph.protected boolean removeAllEdges(E[] edges)+
Graph.removeEdge(Object) method.edges - edges to be removed from this graph.Graph.removeEdge(Object),
+Graph.containsEdge(Object)protected String toStringFromSets(Collection<? extends V> vertexSet, + Collection<? extends E> edgeSet, + boolean directed)+
vertexSet - the vertex set V to be printededgeSet - the edge set E to be printeddirected - true to use parens for each edge (representing directed);
+ false to use curly braces (representing undirected)public int hashCode()+
hashCode in class ObjectObject.hashCode()public boolean equals(Object obj)+
true if the given object is also a graph, the two graphs are
+ instances of the same graph class, have identical vertices and edges sets
+ with the same weights.equals in class Objectobj - object to be compared for equality with this graphtrue if the specified object is equal to this graphObject.equals(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AsUndirectedGraph.html b/javadoc/org/jgrapht/graph/AsUndirectedGraph.html new file mode 100644 index 0000000..0cd6567 --- /dev/null +++ b/javadoc/org/jgrapht/graph/AsUndirectedGraph.html @@ -0,0 +1,601 @@ + + + + + + +public class AsUndirectedGraph<V,E> +extends GraphDelegator<V,E> +implements Serializable, UndirectedGraph<V,E>+
UnsupportedOperationException,
+ but vertex addition/removal and edge removal are all supported (and
+ immediately reflected in the backing graph).
+
+ Note that edges returned by this graph's accessors are really just the + edges of the underlying directed graph. Since there is no interface + distinction between directed and undirected edges, this detail should be + irrelevant to algorithms.
+ +This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods. This graph will be serializable if the backing + graph is serializable.
| Constructor and Description | +
|---|
AsUndirectedGraph(DirectedGraph<V,E> g)
+Constructor for AsUndirectedGraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
int |
+degreeOf(V vertex)
+Returns the degree of the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
Set<E> |
+incomingEdgesOf(V vertex) |
+
int |
+inDegreeOf(V vertex) |
+
int |
+outDegreeOf(V vertex) |
+
Set<E> |
+outgoingEdgesOf(V vertex) |
+
String |
+toString()
+Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph.
+ |
+
addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic AsUndirectedGraph(DirectedGraph<V,E> g)+
g - the backing directed graph over which an undirected view is to
+ be created.public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>getAllEdges in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getAllEdges(Object, Object)public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
getEdge in interface Graph<V,E>getEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getEdge(Object, Object)public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public int degreeOf(V vertex)+
UndirectedGraphdegreeOf in interface UndirectedGraph<V,E>degreeOf in class GraphDelegator<V,E>vertex - vertex whose degree is to be calculated.UndirectedGraph.degreeOf(Object)public int inDegreeOf(V vertex)+
inDegreeOf in class GraphDelegator<V,E>DirectedGraph.inDegreeOf(Object)public Set<E> incomingEdgesOf(V vertex)+
incomingEdgesOf in class GraphDelegator<V,E>DirectedGraph.incomingEdgesOf(Object)public int outDegreeOf(V vertex)+
outDegreeOf in class GraphDelegator<V,E>DirectedGraph.outDegreeOf(Object)public Set<E> outgoingEdgesOf(V vertex)+
outgoingEdgesOf in class GraphDelegator<V,E>DirectedGraph.outgoingEdgesOf(Object)public String toString()+
AbstractGraphtoString in class GraphDelegator<V,E>AbstractGraph.toString()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AsUnweightedDirectedGraph.html b/javadoc/org/jgrapht/graph/AsUnweightedDirectedGraph.html new file mode 100644 index 0000000..098a40b --- /dev/null +++ b/javadoc/org/jgrapht/graph/AsUnweightedDirectedGraph.html @@ -0,0 +1,309 @@ + + + + + + +public class AsUnweightedDirectedGraph<V,E> +extends AsUnweightedGraph<V,E> +implements DirectedGraph<V,E>+
Note that edges returned by this graph's accessors are really just the + edges of the underlying directed graph.
+ +This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods. This graph will be serializable if the backing + graph is serializable.
| Constructor and Description | +
|---|
AsUnweightedDirectedGraph(DirectedGraph<V,E> g)
+Constructor for AsUnweightedGraph.
+ |
+
getEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic AsUnweightedDirectedGraph(DirectedGraph<V,E> g)+
g - the backing graph over which an unweighted view is to be
+ created.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AsUnweightedGraph.html b/javadoc/org/jgrapht/graph/AsUnweightedGraph.html new file mode 100644 index 0000000..bb8925a --- /dev/null +++ b/javadoc/org/jgrapht/graph/AsUnweightedGraph.html @@ -0,0 +1,337 @@ + + + + + + +public class AsUnweightedGraph<V,E> +extends GraphDelegator<V,E> +implements Serializable+
Note that edges returned by this graph's accessors are really just the + edges of the underlying directed graph.
+ +This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods. This graph will be serializable if the backing + graph is serializable.
| Constructor and Description | +
|---|
AsUnweightedGraph(Graph<V,E> g)
+Constructor for AsUnweightedGraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdge, removeAllEdges, removeAllEdges, removeAllVerticespublic double getEdgeWeight(E e)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.getEdgeWeight in interface Graph<V,E>getEdgeWeight in class GraphDelegator<V,E>e - edge of interestGraph.getEdgeWeight(E)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AsWeightedDirectedGraph.html b/javadoc/org/jgrapht/graph/AsWeightedDirectedGraph.html new file mode 100644 index 0000000..1f6c53a --- /dev/null +++ b/javadoc/org/jgrapht/graph/AsWeightedDirectedGraph.html @@ -0,0 +1,341 @@ + + + + + + +public class AsWeightedDirectedGraph<V,E> +extends AsWeightedGraph<V,E> +implements DirectedGraph<V,E>+
A weighted view of the backing graph specified in the constructor. This + allows you to apply algorithms designed for weighted graphs to an unweighted + graph by providing an explicit edge weight mapping. The implementation also + allows for "masking" weights for a subset of the edges in an existing + weighted graph.
+ +Query operations on this graph "read through" to the backing graph. Vertex + addition/removal and edge addition/removal are all supported (and immediately + reflected in the backing graph). Setting an edge weight will pass the + operation to the backing graph as well if the backing graph implements the + WeightedGraph interface. Setting an edge weight will modify the weight map in + order to maintain a consistent graph.
+ +Note that edges returned by this graph's accessors are really just the + edges of the underlying directed graph.
+ +This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods. This graph will be serializable if the backing + graph is serializable.
weightMapDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
AsWeightedDirectedGraph(DirectedGraph<V,E> g,
+ Map<E,Double> weightMap)
+Constructor for AsWeightedGraph.
+ |
+
getEdgeWeight, setEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic AsWeightedDirectedGraph(DirectedGraph<V,E> g, + Map<E,Double> weightMap)+
g - the backing graph over which a weighted view is to be created.weightMap - A mapping of edges to weights. If an edge is not present
+ in the weight map, the edge weight for the underlying graph is returned.
+ Note that a live reference to this map is retained, so if the caller
+ changes the map after construction, the changes will affect theCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/AsWeightedGraph.html b/javadoc/org/jgrapht/graph/AsWeightedGraph.html new file mode 100644 index 0000000..45161ae --- /dev/null +++ b/javadoc/org/jgrapht/graph/AsWeightedGraph.html @@ -0,0 +1,418 @@ + + + + + + +public class AsWeightedGraph<V,E> +extends GraphDelegator<V,E> +implements Serializable, WeightedGraph<V,E>+
A weighted view of the backing graph specified in the constructor. This + graph allows modules to apply algorithms designed for weighted graphs to an + unweighted graph by providing an explicit edge weight mapping. The + implementation also allows for "masking" weights for a subset of the edges in + an existing weighted graph.
+ +Query operations on this graph "read through" to the backing graph. Vertex + addition/removal and edge addition/removal are all supported (and immediately + reflected in the backing graph). Setting an edge weight will pass the + operation to the backing graph as well if the backing graph implements the + WeightedGraph interface. Setting an edge weight will modify the weight map in + order to maintain a consistent graph.
+ +Note that edges returned by this graph's accessors are really just the + edges of the underlying directed graph.
+ +This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods. This graph will be serializable if the backing + graph is serializable.
| Modifier and Type | +Field and Description | +
|---|---|
protected Map<E,Double> |
+weightMap |
+
DEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
AsWeightedGraph(Graph<V,E> g,
+ Map<E,Double> weightMap)
+Constructor for AsWeightedGraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
void |
+setEdgeWeight(E e,
+ double weight)
+Assigns a weight to an edge.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic AsWeightedGraph(Graph<V,E> g, + Map<E,Double> weightMap)+
g - the backing graph over which a weighted view is to be created.weightMap - A mapping of edges to weights. If an edge is not present
+ in the weight map, the edge weight for the underlying graph is returned.
+ Note that a live reference to this map is retained, so if the caller
+ changes the map after construction, the changes will affect the
+ AsWeightedGraph instance as well.public void setEdgeWeight(E e, + double weight)+
WeightedGraphsetEdgeWeight in interface WeightedGraph<V,E>setEdgeWeight in class GraphDelegator<V,E>e - edge on which to set weightweight - new weight for edgeWeightedGraph.setEdgeWeight(E, double)public double getEdgeWeight(E e)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.getEdgeWeight in interface Graph<V,E>getEdgeWeight in class GraphDelegator<V,E>e - edge of interestGraph.getEdgeWeight(E)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ClassBasedEdgeFactory.html b/javadoc/org/jgrapht/graph/ClassBasedEdgeFactory.html new file mode 100644 index 0000000..8d71d11 --- /dev/null +++ b/javadoc/org/jgrapht/graph/ClassBasedEdgeFactory.html @@ -0,0 +1,285 @@ + + + + + + +public class ClassBasedEdgeFactory<V,E> +extends Object +implements EdgeFactory<V,E>, Serializable+
EdgeFactory for producing edges by using a class as a factory.| Constructor and Description | +
|---|
ClassBasedEdgeFactory(Class<? extends E> edgeClass) |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+createEdge(V source,
+ V target)
+Creates a new edge whose endpoints are the specified source and target
+ vertices.
+ |
+
public E createEdge(V source, + V target)+
EdgeFactorycreateEdge in interface EdgeFactory<V,E>source - the source vertex.target - the target vertex.EdgeFactory.createEdge(Object, Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ClassBasedVertexFactory.html b/javadoc/org/jgrapht/graph/ClassBasedVertexFactory.html new file mode 100644 index 0000000..00b500f --- /dev/null +++ b/javadoc/org/jgrapht/graph/ClassBasedVertexFactory.html @@ -0,0 +1,276 @@ + + + + + + +public class ClassBasedVertexFactory<V> +extends Object +implements VertexFactory<V>+
VertexFactory for producing vertices by using a class as a factory.| Constructor and Description | +
|---|
ClassBasedVertexFactory(Class<? extends V> vertexClass) |
+
public V createVertex()+
VertexFactorycreateVertex in interface VertexFactory<V>VertexFactory.createVertex()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DefaultDirectedGraph.html b/javadoc/org/jgrapht/graph/DefaultDirectedGraph.html new file mode 100644 index 0000000..c43cfe5 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DefaultDirectedGraph.html @@ -0,0 +1,360 @@ + + + + + + +public class DefaultDirectedGraph<V,E> +extends AbstractBaseGraph<V,E> +implements DirectedGraph<V,E>+
prefixed 'Default' to avoid name collision with the DirectedGraph + interface.
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
DefaultDirectedGraph(Class<? extends E> edgeClass)
+Creates a new directed graph.
+ |
+
DefaultDirectedGraph(EdgeFactory<V,E> ef)
+Creates a new directed graph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DefaultDirectedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic DefaultDirectedGraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DefaultDirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/DefaultDirectedWeightedGraph.html new file mode 100644 index 0000000..864d1b6 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DefaultDirectedWeightedGraph.html @@ -0,0 +1,381 @@ + + + + + + +public class DefaultDirectedWeightedGraph<V,E> +extends DefaultDirectedGraph<V,E> +implements WeightedGraph<V,E>+
DefaultDirectedGraph,
+Serialized FormAbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
DefaultDirectedWeightedGraph(Class<? extends E> edgeClass)
+Creates a new directed weighted graph.
+ |
+
DefaultDirectedWeightedGraph(EdgeFactory<V,E> ef)
+Creates a new directed weighted graph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfpublic DefaultDirectedWeightedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic DefaultDirectedWeightedGraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DefaultEdge.html b/javadoc/org/jgrapht/graph/DefaultEdge.html new file mode 100644 index 0000000..7642e8b --- /dev/null +++ b/javadoc/org/jgrapht/graph/DefaultEdge.html @@ -0,0 +1,329 @@ + + + + + + +public class DefaultEdge +extends Object+
Graph.| Constructor and Description | +
|---|
DefaultEdge() |
+
protected Object getSource()+
protected Object getTarget()+
public Object clone()+
clone in class ObjectObject.clone()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DefaultGraphMapping.html b/javadoc/org/jgrapht/graph/DefaultGraphMapping.html new file mode 100644 index 0000000..0232ab0 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DefaultGraphMapping.html @@ -0,0 +1,324 @@ + + + + + + +public class DefaultGraphMapping<V,E> +extends Object +implements GraphMapping<V,E>+
+ getVertex/EdgeCorrespondence is based on the performance of the
+ concrete Map class which is passed in the constructor. For example, using
+ hashmaps will provide O(1) performence.| Constructor and Description | +
|---|
DefaultGraphMapping(Map<V,V> g1ToG2,
+ Map<V,V> g2ToG1,
+ Graph<V,E> g1,
+ Graph<V,E> g2)
+The maps themselves are used.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+getEdgeCorrespondence(E currEdge,
+ boolean forward)
+Gets the mapped value where the key is
+edge |
+
V |
+getVertexCorrespondence(V keyVertex,
+ boolean forward)
+Gets the mapped value where the key is
+vertex |
+
public DefaultGraphMapping(Map<V,V> g1ToG2, + Map<V,V> g2ToG1, + Graph<V,E> g1, + Graph<V,E> g2)+
g1ToG2 - g2ToG1 - g1 - g2 - public E getEdgeCorrespondence(E currEdge, + boolean forward)+
GraphMappingedgegetEdgeCorrespondence in interface GraphMapping<V,E>currEdge - edge in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
+ mapping from graph2 to graph1public V getVertexCorrespondence(V keyVertex, + boolean forward)+
GraphMappingvertexgetVertexCorrespondence in interface GraphMapping<V,E>keyVertex - vertex in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
+ mapping from graph2 to graph1Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DefaultListenableGraph.html b/javadoc/org/jgrapht/graph/DefaultListenableGraph.html new file mode 100644 index 0000000..5325234 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DefaultListenableGraph.html @@ -0,0 +1,789 @@ + + + + + + +public class DefaultListenableGraph<V,E> +extends GraphDelegator<V,E> +implements ListenableGraph<V,E>, Cloneable+
GraphListener s and by
+ VertexSetListener s. Operations on this graph "pass through" to the to
+ the backing graph. Any modification made to this graph or the backing graph
+ is reflected by the other.
+
+ This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods.
GraphListener,
+VertexSetListener,
+Serialized Form| Constructor and Description | +
|---|
DefaultListenableGraph(Graph<V,E> g)
+Creates a new listenable graph.
+ |
+
DefaultListenableGraph(Graph<V,E> g,
+ boolean reuseEvents)
+Creates a new listenable graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
void |
+addGraphListener(GraphListener<V,E> l)
+Adds the specified graph listener to this graph, if not already present.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
void |
+addVertexSetListener(VertexSetListener<V> l)
+Adds the specified vertex set listener to this graph, if not already
+ present.
+ |
+
Object |
+clone() |
+
protected void |
+fireEdgeAdded(E edge,
+ V source,
+ V target)
+Notify listeners that the specified edge was added.
+ |
+
protected void |
+fireEdgeRemoved(E edge,
+ V source,
+ V target)
+Notify listeners that the specified edge was removed.
+ |
+
protected void |
+fireVertexAdded(V vertex)
+Notify listeners that the specified vertex was added.
+ |
+
protected void |
+fireVertexRemoved(V vertex)
+Notify listeners that the specified vertex was removed.
+ |
+
boolean |
+isReuseEvents()
+Tests whether the
+reuseEvents flag is set. |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
void |
+removeGraphListener(GraphListener<V,E> l)
+Removes the specified graph listener from this graph, if present.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
void |
+removeVertexSetListener(VertexSetListener<V> l)
+Removes the specified vertex set listener from this graph, if present.
+ |
+
void |
+setReuseEvents(boolean reuseEvents)
+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. |
+
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, vertexSetpublic DefaultListenableGraph(Graph<V,E> g)+
g - the backing graph.public DefaultListenableGraph(Graph<V,E> g, + boolean reuseEvents)+
reuseEvents flag is
+ set to true this class will reuse previously fired events
+ and will not create a new object for each event. This option increases
+ performance but should be used with care, especially in multithreaded
+ environment.g - the backing graph.reuseEvents - whether to reuse previously fired event objects
+ instead of creating a new event object for each event.IllegalArgumentException - if the backing graph is already a
+ listenable graph.public void setReuseEvents(boolean reuseEvents)+
reuseEvents flag is set to true this
+ class will reuse previously fired events and will not create a new object
+ for each event. This option increases performance but should be used with
+ care, especially in multithreaded environment.reuseEvents - whether to reuse previously fired event objects
+ instead of creating a new event object for each event.public boolean isReuseEvents()+
reuseEvents flag is set. If the flag is
+ set to true this class will reuse previously fired events
+ and will not create a new object for each event. This option increases
+ performance but should be used with care, especially in multithreaded
+ environment.reuseEvents flag.public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public void addGraphListener(GraphListener<V,E> l)+
ListenableGraphaddGraphListener in interface ListenableGraph<V,E>l - the listener to be added.ListenableGraph.addGraphListener(GraphListener)public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.addVertex in interface Graph<V,E>addVertex in class GraphDelegator<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)public void addVertexSetListener(VertexSetListener<V> l)+
ListenableGraphaddVertexSetListener in interface ListenableGraph<V,E>l - the listener to be added.ListenableGraph.addVertexSetListener(VertexSetListener)public Object clone()+
clone in class ObjectObject.clone()public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>removeEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
removeEdge in interface Graph<V,E>removeEdge in class GraphDelegator<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public void removeGraphListener(GraphListener<V,E> l)+
ListenableGraphremoveGraphListener in interface ListenableGraph<V,E>l - the listener to be removed.ListenableGraph.removeGraphListener(GraphListener)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>removeVertex in class GraphDelegator<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)public void removeVertexSetListener(VertexSetListener<V> l)+
ListenableGraphremoveVertexSetListener in interface ListenableGraph<V,E>l - the listener to be removed.ListenableGraph.removeVertexSetListener(VertexSetListener)protected void fireEdgeAdded(E edge, + V source, + V target)+
edge - the edge that was added.source - edge sourcetarget - edge targetprotected void fireEdgeRemoved(E edge, + V source, + V target)+
edge - the edge that was removed.source - edge sourcetarget - edge targetprotected void fireVertexAdded(V vertex)+
vertex - the vertex that was added.protected void fireVertexRemoved(V vertex)+
vertex - the vertex that was removed.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DefaultWeightedEdge.html b/javadoc/org/jgrapht/graph/DefaultWeightedEdge.html new file mode 100644 index 0000000..e8d6770 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DefaultWeightedEdge.html @@ -0,0 +1,302 @@ + + + + + + +public class DefaultWeightedEdge +extends DefaultEdge+
WeightedGraph. All access to
+ the weight of an edge must go through the graph interface, which is why this
+ class doesn't expose any public methods.| Constructor and Description | +
|---|
DefaultWeightedEdge() |
+
protected double getWeight()+
public Object clone()+
clone in class ObjectObject.clone()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedGraphUnion.html b/javadoc/org/jgrapht/graph/DirectedGraphUnion.html new file mode 100644 index 0000000..fc4ef80 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedGraphUnion.html @@ -0,0 +1,404 @@ + + + + + + +public class DirectedGraphUnion<V,E> +extends GraphUnion<V,E,DirectedGraph<V,E>> +implements DirectedGraph<V,E>+
| Constructor and Description | +
|---|
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2) |
+
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+incomingEdgesOf(V vertex)
+Returns a set of all edges incoming into the specified vertex.
+ |
+
int |
+inDegreeOf(V vertex)
+Returns the "in degree" of the specified vertex.
+ |
+
int |
+outDegreeOf(V vertex)
+Returns the "out degree" of the specified vertex.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+Returns a set of all edges outgoing from the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DirectedGraphUnion(DirectedGraph<V,E> g1, + DirectedGraph<V,E> g2, + WeightCombiner operator)+
public DirectedGraphUnion(DirectedGraph<V,E> g1, + DirectedGraph<V,E> g2)+
public int inDegreeOf(V vertex)+
DirectedGraphinDegreeOf in interface DirectedGraph<V,E>vertex - vertex whose degree is to be calculated.public Set<E> incomingEdgesOf(V vertex)+
DirectedGraphincomingEdgesOf in interface DirectedGraph<V,E>vertex - the vertex for which the list of incoming edges to be
+ returned.public int outDegreeOf(V vertex)+
DirectedGraphoutDegreeOf in interface DirectedGraph<V,E>vertex - vertex whose degree is to be calculated.public Set<E> outgoingEdgesOf(V vertex)+
DirectedGraphoutgoingEdgesOf in interface DirectedGraph<V,E>vertex - the vertex for which the list of outgoing edges to be
+ returned.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedMaskSubgraph.html b/javadoc/org/jgrapht/graph/DirectedMaskSubgraph.html new file mode 100644 index 0000000..b2acbfd --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedMaskSubgraph.html @@ -0,0 +1,280 @@ + + + + + + +public class DirectedMaskSubgraph<V,E> +extends MaskSubgraph<V,E> +implements DirectedGraph<V,E>+
MaskSubgraph on another graph.| Constructor and Description | +
|---|
DirectedMaskSubgraph(DirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask) |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DirectedMaskSubgraph(DirectedGraph<V,E> base, + MaskFunctor<V,E> mask)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedMultigraph.html b/javadoc/org/jgrapht/graph/DirectedMultigraph.html new file mode 100644 index 0000000..30f2b80 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedMultigraph.html @@ -0,0 +1,357 @@ + + + + + + +public class DirectedMultigraph<V,E> +extends AbstractBaseGraph<V,E> +implements DirectedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
DirectedMultigraph(Class<? extends E> edgeClass)
+Creates a new directed multigraph.
+ |
+
DirectedMultigraph(EdgeFactory<V,E> ef)
+Creates a new directed multigraph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DirectedMultigraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic DirectedMultigraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedPseudograph.html b/javadoc/org/jgrapht/graph/DirectedPseudograph.html new file mode 100644 index 0000000..b8ed2fd --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedPseudograph.html @@ -0,0 +1,353 @@ + + + + + + +public class DirectedPseudograph<V,E> +extends AbstractBaseGraph<V,E> +implements DirectedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
DirectedPseudograph(Class<? extends E> edgeClass) |
+
DirectedPseudograph(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DirectedPseudograph(Class<? extends E> edgeClass)+
AbstractBaseGraphpublic DirectedPseudograph(EdgeFactory<V,E> ef)+
AbstractBaseGraphpublic static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedSubgraph.html b/javadoc/org/jgrapht/graph/DirectedSubgraph.html new file mode 100644 index 0000000..5caeaa2 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedSubgraph.html @@ -0,0 +1,403 @@ + + + + + + +public class DirectedSubgraph<V,E> +extends Subgraph<V,E,DirectedGraph<V,E>> +implements DirectedGraph<V,E>+
Subgraph,
+Serialized Form| Constructor and Description | +
|---|
DirectedSubgraph(DirectedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new directed subgraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+incomingEdgesOf(V vertex)
+Returns a set of all edges incoming into the specified vertex.
+ |
+
int |
+inDegreeOf(V vertex)
+Returns the "in degree" of the specified vertex.
+ |
+
int |
+outDegreeOf(V vertex)
+Returns the "out degree" of the specified vertex.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+Returns a set of all edges outgoing from the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DirectedSubgraph(DirectedGraph<V,E> base, + Set<V> vertexSubset, + Set<E> edgeSubset)+
base - the base (backing) graph on which the subgraph will be based.vertexSubset - vertices to include in the subgraph. If
+ null then all vertices are included.edgeSubset - edges to in include in the subgraph. If
+ null then all the edges whose vertices found in the graph are
+ included.public int inDegreeOf(V vertex)+
DirectedGraphinDegreeOf in interface DirectedGraph<V,E>vertex - vertex whose degree is to be calculated.DirectedGraph.inDegreeOf(Object)public Set<E> incomingEdgesOf(V vertex)+
DirectedGraphincomingEdgesOf in interface DirectedGraph<V,E>vertex - the vertex for which the list of incoming edges to be
+ returned.DirectedGraph.incomingEdgesOf(Object)public int outDegreeOf(V vertex)+
DirectedGraphoutDegreeOf in interface DirectedGraph<V,E>vertex - vertex whose degree is to be calculated.DirectedGraph.outDegreeOf(Object)public Set<E> outgoingEdgesOf(V vertex)+
DirectedGraphoutgoingEdgesOf in interface DirectedGraph<V,E>vertex - the vertex for which the list of outgoing edges to be
+ returned.DirectedGraph.outgoingEdgesOf(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedWeightedMultigraph.html b/javadoc/org/jgrapht/graph/DirectedWeightedMultigraph.html new file mode 100644 index 0000000..a1ef6a8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedWeightedMultigraph.html @@ -0,0 +1,382 @@ + + + + + + +public class DirectedWeightedMultigraph<V,E> +extends DirectedMultigraph<V,E> +implements WeightedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
DirectedWeightedMultigraph(Class<? extends E> edgeClass)
+Creates a new directed weighted multigraph.
+ |
+
DirectedWeightedMultigraph(EdgeFactory<V,E> ef)
+Creates a new directed weighted multigraph with the specified edge
+ factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfpublic DirectedWeightedMultigraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic DirectedWeightedMultigraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedWeightedPseudograph.html b/javadoc/org/jgrapht/graph/DirectedWeightedPseudograph.html new file mode 100644 index 0000000..941ab17 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedWeightedPseudograph.html @@ -0,0 +1,382 @@ + + + + + + +public class DirectedWeightedPseudograph<V,E> +extends DirectedPseudograph<V,E> +implements WeightedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
DirectedWeightedPseudograph(Class<? extends E> edgeClass)
+Creates a new directed weighted pseudograph.
+ |
+
DirectedWeightedPseudograph(EdgeFactory<V,E> ef)
+Creates a new directed weighted pseudograph with the specified edge
+ factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfpublic DirectedWeightedPseudograph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic DirectedWeightedPseudograph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/DirectedWeightedSubgraph.html b/javadoc/org/jgrapht/graph/DirectedWeightedSubgraph.html new file mode 100644 index 0000000..cb62031 --- /dev/null +++ b/javadoc/org/jgrapht/graph/DirectedWeightedSubgraph.html @@ -0,0 +1,314 @@ + + + + + + +public class DirectedWeightedSubgraph<V,E> +extends DirectedSubgraph<V,E> +implements WeightedGraph<V,E>+
Subgraph,
+Serialized FormDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
DirectedWeightedSubgraph(WeightedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new weighted directed subgraph.
+ |
+
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic DirectedWeightedSubgraph(WeightedGraph<V,E> base, + Set<V> vertexSubset, + Set<E> edgeSubset)+
base - the base (backing) graph on which the subgraph will be based.vertexSubset - vertices to include in the subgraph. If
+ null then all vertices are included.edgeSubset - edges to in include in the subgraph. If
+ null then all the edges whose vertices found in the graph are
+ included.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/EdgeReversedGraph.html b/javadoc/org/jgrapht/graph/EdgeReversedGraph.html new file mode 100644 index 0000000..6ca1d99 --- /dev/null +++ b/javadoc/org/jgrapht/graph/EdgeReversedGraph.html @@ -0,0 +1,686 @@ + + + + + + +public class EdgeReversedGraph<V,E> +extends GraphDelegator<V,E> +implements DirectedGraph<V,E>+
This class allows you to use a directed graph algorithm in reverse. For
+ example, suppose you have a directed graph representing a tree, with edges
+ from parent to child, and you want to find all of the parents of a node. To
+ do this, simply create an edge-reversed graph and pass that as input to
+ DepthFirstIterator.
AsUndirectedGraph,
+Serialized Form| Constructor and Description | +
|---|
EdgeReversedGraph(DirectedGraph<V,E> g)
+Creates a new EdgeReversedGraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
V |
+getEdgeSource(E e)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E e)
+Returns the target vertex of an edge.
+ |
+
Set<E> |
+incomingEdgesOf(V vertex)
+Returns a set of all edges incoming into the specified vertex.
+ |
+
int |
+inDegreeOf(V vertex)
+Returns the "in degree" of the specified vertex.
+ |
+
int |
+outDegreeOf(V vertex)
+Returns the "out degree" of the specified vertex.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+Returns a set of all edges outgoing from the specified vertex.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
String |
+toString()
+Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph.
+ |
+
addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getEdgeFactory, getEdgeWeight, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeVertex, vertexSetpublic EdgeReversedGraph(DirectedGraph<V,E> g)+
g - the base (backing) graph on which the edge-reversed view will be
+ based.public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
getEdge in interface Graph<V,E>getEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getEdge(Object, Object)public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>getAllEdges in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getAllEdges(Object, Object)public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public int inDegreeOf(V vertex)+
DirectedGraphinDegreeOf in interface DirectedGraph<V,E>inDegreeOf in class GraphDelegator<V,E>vertex - vertex whose degree is to be calculated.DirectedGraph.inDegreeOf(Object)public int outDegreeOf(V vertex)+
DirectedGraphoutDegreeOf in interface DirectedGraph<V,E>outDegreeOf in class GraphDelegator<V,E>vertex - vertex whose degree is to be calculated.DirectedGraph.outDegreeOf(Object)public Set<E> incomingEdgesOf(V vertex)+
DirectedGraphincomingEdgesOf in interface DirectedGraph<V,E>incomingEdgesOf in class GraphDelegator<V,E>vertex - the vertex for which the list of incoming edges to be
+ returned.DirectedGraph.incomingEdgesOf(Object)public Set<E> outgoingEdgesOf(V vertex)+
DirectedGraphoutgoingEdgesOf in interface DirectedGraph<V,E>outgoingEdgesOf in class GraphDelegator<V,E>vertex - the vertex for which the list of outgoing edges to be
+ returned.DirectedGraph.outgoingEdgesOf(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>removeEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public V getEdgeSource(E e)+
GraphgetEdgeSource in interface Graph<V,E>getEdgeSource in class GraphDelegator<V,E>e - edge of interestGraph.getEdgeSource(Object)public V getEdgeTarget(E e)+
GraphgetEdgeTarget in interface Graph<V,E>getEdgeTarget in class GraphDelegator<V,E>e - edge of interestGraph.getEdgeTarget(Object)public String toString()+
AbstractGraphtoString in class GraphDelegator<V,E>Object.toString()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/EdgeSetFactory.html b/javadoc/org/jgrapht/graph/EdgeSetFactory.html new file mode 100644 index 0000000..5f69175 --- /dev/null +++ b/javadoc/org/jgrapht/graph/EdgeSetFactory.html @@ -0,0 +1,225 @@ + + + + + + +public interface EdgeSetFactory<V,E>
+Set implementation used internally by the graph
+ to maintain sets of edges. This provides control over performance tradeoffs
+ between memory and CPU usage.| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+createEdgeSet(V vertex)
+Create a new edge set for a particular vertex.
+ |
+
Set<E> createEdgeSet(V vertex)+
vertex - the vertex for which the edge set is being created;
+ sophisticated factories may be able to use this information to choose an
+ optimal set representation (e.g. ArrayUnenforcedSet for a vertex expected
+ to have low degree, and LinkedHashSet for a vertex expected to have high
+ degree)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/GraphDelegator.html b/javadoc/org/jgrapht/graph/GraphDelegator.html new file mode 100644 index 0000000..61c1458 --- /dev/null +++ b/javadoc/org/jgrapht/graph/GraphDelegator.html @@ -0,0 +1,937 @@ + + + + + + +public class GraphDelegator<V,E> +extends AbstractGraph<V,E> +implements Graph<V,E>, Serializable+
This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods.
+ +This class is mostly used as a base for extending subclasses.
| Constructor and Description | +
|---|
GraphDelegator(Graph<V,E> g)
+Constructor for GraphDelegator.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
boolean |
+containsEdge(E e)
+Returns true if this graph contains the specified edge.
+ |
+
boolean |
+containsVertex(V v)
+Returns true if this graph contains the specified vertex.
+ |
+
int |
+degreeOf(V vertex) |
+
Set<E> |
+edgeSet()
+Returns a set of the edges contained in this graph.
+ |
+
Set<E> |
+edgesOf(V vertex)
+Returns a set of all edges touching the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
EdgeFactory<V,E> |
+getEdgeFactory()
+Returns the edge factory using which this graph creates new edges.
+ |
+
V |
+getEdgeSource(E e)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E e)
+Returns the target vertex of an edge.
+ |
+
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
Set<E> |
+incomingEdgesOf(V vertex) |
+
int |
+inDegreeOf(V vertex) |
+
int |
+outDegreeOf(V vertex) |
+
Set<E> |
+outgoingEdgesOf(V vertex) |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
void |
+setEdgeWeight(E e,
+ double weight) |
+
String |
+toString()
+Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph.
+ |
+
Set<V> |
+vertexSet()
+Returns a set of the vertices contained in this graph.
+ |
+
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdge, removeAllEdges, removeAllEdges, removeAllVerticespublic GraphDelegator(Graph<V,E> g)+
g - the backing graph (the delegate).IllegalArgumentException - iff g==nullpublic Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getAllEdges(Object, Object)public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
getEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getEdge(Object, Object)public EdgeFactory<V,E> getEdgeFactory()+
GraphgetEdgeFactory in interface Graph<V,E>Graph.getEdgeFactory()public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.addVertex in interface Graph<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)public boolean containsEdge(E e)+
Graphe2 such that e.equals(e2). If the
+ specified edge is null returns false.containsEdge in interface Graph<V,E>e - edge whose presence in this graph is to be tested.Graph.containsEdge(Object)public boolean containsVertex(V v)+
Graphu such that u.equals(v). If the
+ specified vertex is null returns false.containsVertex in interface Graph<V,E>v - vertex whose presence in this graph is to be tested.Graph.containsVertex(Object)public int degreeOf(V vertex)+
UndirectedGraph.degreeOf(Object)public Set<E> edgeSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
edgeSet in interface Graph<V,E>Graph.edgeSet()public Set<E> edgesOf(V vertex)+
GraphedgesOf in interface Graph<V,E>vertex - the vertex for which a set of touching edges is to be
+ returned.Graph.edgesOf(Object)public int inDegreeOf(V vertex)+
DirectedGraph.inDegreeOf(Object)public int outDegreeOf(V vertex)+
DirectedGraph.outDegreeOf(Object)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
removeEdge in interface Graph<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)public String toString()+
AbstractGraphtoString in class AbstractGraph<V,E>Object.toString()public Set<V> vertexSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
vertexSet in interface Graph<V,E>Graph.vertexSet()public V getEdgeSource(E e)+
GraphgetEdgeSource in interface Graph<V,E>e - edge of interestGraph.getEdgeSource(Object)public V getEdgeTarget(E e)+
GraphgetEdgeTarget in interface Graph<V,E>e - edge of interestGraph.getEdgeTarget(Object)public double getEdgeWeight(E e)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.getEdgeWeight in interface Graph<V,E>e - edge of interestGraph.getEdgeWeight(Object)public void setEdgeWeight(E e, + double weight)+ +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/GraphPathImpl.html b/javadoc/org/jgrapht/graph/GraphPathImpl.html new file mode 100644 index 0000000..9ab00a2 --- /dev/null +++ b/javadoc/org/jgrapht/graph/GraphPathImpl.html @@ -0,0 +1,397 @@ + + + + + + +| Constructor and Description | +
|---|
GraphPathImpl(Graph<V,E> graph,
+ V startVertex,
+ V endVertex,
+ List<E> edgeList,
+ double weight) |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<E> |
+getEdgeList()
+Returns the edges making up the path.
+ |
+
V |
+getEndVertex()
+Returns the end vertex in the path.
+ |
+
Graph<V,E> |
+getGraph()
+Returns the graph over which this path is defined.
+ |
+
V |
+getStartVertex()
+Returns the start vertex in the path.
+ |
+
double |
+getWeight()
+Returns the weight assigned to the path.
+ |
+
String |
+toString() |
+
public Graph<V,E> getGraph()+
GraphPathpublic V getStartVertex()+
GraphPathgetStartVertex in interface GraphPath<V,E>public V getEndVertex()+
GraphPathgetEndVertex in interface GraphPath<V,E>public List<E> getEdgeList()+
GraphPathGraphs.getPathVertexList(org.jgrapht.GraphPath<V, E>) provides a convenience method for this.
+
+ Whether or not the returned edge list is modifiable depends on the + path implementation.
getEdgeList in interface GraphPath<V,E>public double getWeight()+
GraphPathCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/GraphUnion.html b/javadoc/org/jgrapht/graph/GraphUnion.html new file mode 100644 index 0000000..c998021 --- /dev/null +++ b/javadoc/org/jgrapht/graph/GraphUnion.html @@ -0,0 +1,795 @@ + + + + + + +public class GraphUnion<V,E,G extends Graph<V,E>> +extends AbstractGraph<V,E> +implements Serializable+
Read-only union of two graphs: G1 and G2. If + G1 = (V1, E1) and G2 = + (V2, E2) then their union G = (V, E), where V is the + union of V1 and V2, and E is the union of E1 + and E1.
+ +GraphUnion implements Graph interface. + GraphUnion uses WeightCombiner to choose policy for calculating + edge weight.
| Constructor and Description | +
|---|
GraphUnion(G g1,
+ G g2) |
+
GraphUnion(G g1,
+ G g2,
+ WeightCombiner operator) |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
boolean |
+addVertex(V v)
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
boolean |
+containsEdge(E e)
+Returns true if this graph contains the specified edge.
+ |
+
boolean |
+containsVertex(V v)
+Returns true if this graph contains the specified vertex.
+ |
+
Set<E> |
+edgeSet()
+Returns a set of the edges contained in this graph.
+ |
+
Set<E> |
+edgesOf(V vertex)
+Returns a set of all edges touching the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
EdgeFactory<V,E> |
+getEdgeFactory()
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
V |
+getEdgeSource(E e)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E e)
+Returns the target vertex of an edge.
+ |
+
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
G |
+getG1() |
+
G |
+getG2() |
+
boolean |
+removeEdge(E e)
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
boolean |
+removeVertex(V v)
+Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+ |
+
Set<V> |
+vertexSet()
+Returns a set of the vertices contained in this graph.
+ |
+
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetspublic GraphUnion(G g1, + G g2, + WeightCombiner operator)+
public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
public EdgeFactory<V,E> getEdgeFactory()+
getEdgeFactory in interface Graph<V,E>public E addEdge(V sourceVertex, + V targetVertex)+
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.getEdgeFactory()public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object),
+Graph.getEdgeFactory()public boolean addVertex(V v)+
public boolean containsEdge(E e)+
Graphe2 such that e.equals(e2). If the
+ specified edge is null returns false.containsEdge in interface Graph<V,E>e - edge whose presence in this graph is to be tested.public boolean containsVertex(V v)+
Graphu such that u.equals(v). If the
+ specified vertex is null returns false.containsVertex in interface Graph<V,E>v - vertex whose presence in this graph is to be tested.public Set<E> edgeSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
public Set<E> edgesOf(V vertex)+
Graphpublic E removeEdge(V sourceVertex, + V targetVertex)+
removeEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.public boolean removeEdge(E e)+
removeEdge in interface Graph<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.public boolean removeVertex(V v)+
removeVertex in interface Graph<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.public Set<V> vertexSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
public V getEdgeSource(E e)+
GraphgetEdgeSource in interface Graph<V,E>e - edge of interestpublic V getEdgeTarget(E e)+
GraphgetEdgeTarget in interface Graph<V,E>e - edge of interestpublic double getEdgeWeight(E e)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.getEdgeWeight in interface Graph<V,E>e - edge of interestWeightedGraphpublic G getG1()+
public G getG2()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ListenableDirectedGraph.html b/javadoc/org/jgrapht/graph/ListenableDirectedGraph.html new file mode 100644 index 0000000..2415cf0 --- /dev/null +++ b/javadoc/org/jgrapht/graph/ListenableDirectedGraph.html @@ -0,0 +1,312 @@ + + + + + + +public class ListenableDirectedGraph<V,E> +extends DefaultListenableGraph<V,E> +implements DirectedGraph<V,E>+
ListenableGraph.DefaultListenableGraph,
+Serialized Form| Constructor and Description | +
|---|
ListenableDirectedGraph(Class<? extends E> edgeClass)
+Creates a new listenable directed graph.
+ |
+
ListenableDirectedGraph(DirectedGraph<V,E> base)
+Creates a new listenable directed graph.
+ |
+
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEventscontainsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic ListenableDirectedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic ListenableDirectedGraph(DirectedGraph<V,E> base)+
base - the backing graph.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ListenableDirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/ListenableDirectedWeightedGraph.html new file mode 100644 index 0000000..7178412 --- /dev/null +++ b/javadoc/org/jgrapht/graph/ListenableDirectedWeightedGraph.html @@ -0,0 +1,335 @@ + + + + + + +public class ListenableDirectedWeightedGraph<V,E> +extends ListenableDirectedGraph<V,E> +implements WeightedGraph<V,E>+
ListenableGraph.DefaultListenableGraph,
+Serialized FormDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
ListenableDirectedWeightedGraph(Class<? extends E> edgeClass)
+Creates a new listenable directed weighted graph.
+ |
+
ListenableDirectedWeightedGraph(WeightedGraph<V,E> base)
+Creates a new listenable directed weighted graph.
+ |
+
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEventscontainsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfpublic ListenableDirectedWeightedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic ListenableDirectedWeightedGraph(WeightedGraph<V,E> base)+
base - the backing graph.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ListenableUndirectedGraph.html b/javadoc/org/jgrapht/graph/ListenableUndirectedGraph.html new file mode 100644 index 0000000..c972d2d --- /dev/null +++ b/javadoc/org/jgrapht/graph/ListenableUndirectedGraph.html @@ -0,0 +1,312 @@ + + + + + + +public class ListenableUndirectedGraph<V,E> +extends DefaultListenableGraph<V,E> +implements UndirectedGraph<V,E>+
ListenableGraph.DefaultListenableGraph,
+Serialized Form| Constructor and Description | +
|---|
ListenableUndirectedGraph(Class<? extends E> edgeClass)
+Creates a new listenable undirected simple graph.
+ |
+
ListenableUndirectedGraph(UndirectedGraph<V,E> base)
+Creates a new listenable undirected graph.
+ |
+
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEventscontainsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic ListenableUndirectedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic ListenableUndirectedGraph(UndirectedGraph<V,E> base)+
base - the backing graph.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ListenableUndirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/ListenableUndirectedWeightedGraph.html new file mode 100644 index 0000000..6bddecd --- /dev/null +++ b/javadoc/org/jgrapht/graph/ListenableUndirectedWeightedGraph.html @@ -0,0 +1,335 @@ + + + + + + +public class ListenableUndirectedWeightedGraph<V,E> +extends ListenableUndirectedGraph<V,E> +implements WeightedGraph<V,E>+
ListenableGraph.DefaultListenableGraph,
+Serialized FormDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
ListenableUndirectedWeightedGraph(Class<? extends E> edgeClass)
+Creates a new listenable undirected weighted graph.
+ |
+
ListenableUndirectedWeightedGraph(WeightedGraph<V,E> base)
+Creates a new listenable undirected weighted graph.
+ |
+
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEventscontainsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetdegreeOfpublic ListenableUndirectedWeightedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic ListenableUndirectedWeightedGraph(WeightedGraph<V,E> base)+
base - the backing graph.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/MaskFunctor.html b/javadoc/org/jgrapht/graph/MaskFunctor.html new file mode 100644 index 0000000..608f74d --- /dev/null +++ b/javadoc/org/jgrapht/graph/MaskFunctor.html @@ -0,0 +1,244 @@ + + + + + + +public interface MaskFunctor<V,E>
+| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+isEdgeMasked(E edge)
+Returns
+true if the edge is masked, false
+ otherwise. |
+
boolean |
+isVertexMasked(V vertex)
+Returns
+true if the vertex is masked, false
+ otherwise. |
+
boolean isEdgeMasked(E edge)+
true if the edge is masked, false
+ otherwise.edge - edge.boolean isVertexMasked(V vertex)+
true if the vertex is masked, false
+ otherwise.vertex - vertex.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/MaskSubgraph.html b/javadoc/org/jgrapht/graph/MaskSubgraph.html new file mode 100644 index 0000000..b5bf266 --- /dev/null +++ b/javadoc/org/jgrapht/graph/MaskSubgraph.html @@ -0,0 +1,924 @@ + + + + + + +public class MaskSubgraph<V,E> +extends AbstractGraph<V,E>+
| Constructor and Description | +
|---|
MaskSubgraph(Graph<V,E> base,
+ MaskFunctor<V,E> mask)
+Creates a new induced subgraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E edge)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
boolean |
+containsEdge(E e)
+Returns true if this graph contains the specified edge.
+ |
+
boolean |
+containsVertex(V v)
+Returns true if this graph contains the specified vertex.
+ |
+
int |
+degreeOf(V vertex) |
+
Set<E> |
+edgeSet()
+Returns a set of the edges contained in this graph.
+ |
+
Set<E> |
+edgesOf(V vertex)
+Returns a set of all edges touching the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
EdgeFactory<V,E> |
+getEdgeFactory()
+Returns the edge factory using which this graph creates new edges.
+ |
+
V |
+getEdgeSource(E edge)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E edge)
+Returns the target vertex of an edge.
+ |
+
double |
+getEdgeWeight(E edge)
+Returns the weight assigned to a given edge.
+ |
+
Set<E> |
+incomingEdgesOf(V vertex) |
+
int |
+inDegreeOf(V vertex) |
+
int |
+outDegreeOf(V vertex) |
+
Set<E> |
+outgoingEdgesOf(V vertex) |
+
boolean |
+removeAllEdges(Collection<? extends E> edges)
+Removes all the edges in this graph that are also contained in the
+ specified edge collection.
+ |
+
Set<E> |
+removeAllEdges(V sourceVertex,
+ V targetVertex)
+Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges.
+ |
+
boolean |
+removeAllVertices(Collection<? extends V> vertices)
+Removes all the vertices in this graph that are also contained in the
+ specified vertex collection.
+ |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
Set<V> |
+vertexSet()
+Returns a set of the vertices contained in this graph.
+ |
+
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toString, toStringFromSetspublic MaskSubgraph(Graph<V,E> base, + MaskFunctor<V,E> mask)+
base - the base (backing) graph on which the subgraph will be based.mask - vertices and edges to exclude in the subgraph. If a
+ vertex/edge is masked, it is as if it is not in the subgraph.public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E edge)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.edge - edge to be added to this graph.Graph.addEdge(Object, Object),
+Graph.getEdgeFactory()public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.v - vertex to be added to this graph.Graph.addVertex(Object)public boolean containsEdge(E e)+
Graphe2 such that e.equals(e2). If the
+ specified edge is null returns false.e - edge whose presence in this graph is to be tested.public boolean containsVertex(V v)+
Graphu such that u.equals(v). If the
+ specified vertex is null returns false.v - vertex whose presence in this graph is to be tested.public int degreeOf(V vertex)+
UndirectedGraph.degreeOf(Object)public Set<E> edgeSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
public Set<E> edgesOf(V vertex)+
Graphvertex - the vertex for which a set of touching edges is to be
+ returned.public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.public EdgeFactory<V,E> getEdgeFactory()+
Graphpublic V getEdgeSource(E edge)+
Graphedge - edge of interestpublic V getEdgeTarget(E edge)+
Graphedge - edge of interestpublic double getEdgeWeight(E edge)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.edge - edge of interestWeightedGraphpublic int inDegreeOf(V vertex)+
DirectedGraph.inDegreeOf(Object)public int outDegreeOf(V vertex)+
DirectedGraph.outDegreeOf(Object)public boolean removeAllEdges(Collection<? extends E> edges)+
GraphGraph.removeEdge(Object) method.removeAllEdges in interface Graph<V,E>removeAllEdges in class AbstractGraph<V,E>edges - edges to be removed from this graph.Graph.removeAllEdges(Collection)public Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
Graphnull if any of the specified vertices does not exist in the
+ graph. If both vertices exist but no edge is found, returns an empty set.
+ This method will either invoke the Graph.removeEdge(Object) method, or
+ the Graph.removeEdge(Object, Object) method.removeAllEdges in interface Graph<V,E>removeAllEdges in class AbstractGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if either vertex is not
+ part of graphGraph.removeAllEdges(Object, Object)public boolean removeAllVertices(Collection<? extends V> vertices)+
GraphGraph.removeVertex(Object) method.removeAllVertices in interface Graph<V,E>removeAllVertices in class AbstractGraph<V,E>vertices - vertices to be removed from this graph.Graph.removeAllVertices(Collection)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)public Set<V> vertexSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/MixedGraphUnion.html b/javadoc/org/jgrapht/graph/MixedGraphUnion.html new file mode 100644 index 0000000..c2bc36d --- /dev/null +++ b/javadoc/org/jgrapht/graph/MixedGraphUnion.html @@ -0,0 +1,404 @@ + + + + + + +public class MixedGraphUnion<V,E> +extends GraphUnion<V,E,Graph<V,E>> +implements DirectedGraph<V,E>+
| Constructor and Description | +
|---|
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2) |
+
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
| Modifier and Type | +Method and Description | +
|---|---|
Set<E> |
+incomingEdgesOf(V vertex)
+Returns a set of all edges incoming into the specified vertex.
+ |
+
int |
+inDegreeOf(V vertex)
+Returns the "in degree" of the specified vertex.
+ |
+
int |
+outDegreeOf(V vertex)
+Returns the "out degree" of the specified vertex.
+ |
+
Set<E> |
+outgoingEdgesOf(V vertex)
+Returns a set of all edges outgoing from the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic MixedGraphUnion(UndirectedGraph<V,E> g1, + DirectedGraph<V,E> g2, + WeightCombiner operator)+
public MixedGraphUnion(UndirectedGraph<V,E> g1, + DirectedGraph<V,E> g2)+
public int inDegreeOf(V vertex)+
DirectedGraphinDegreeOf in interface DirectedGraph<V,E>vertex - vertex whose degree is to be calculated.public Set<E> incomingEdgesOf(V vertex)+
DirectedGraphincomingEdgesOf in interface DirectedGraph<V,E>vertex - the vertex for which the list of incoming edges to be
+ returned.public int outDegreeOf(V vertex)+
DirectedGraphoutDegreeOf in interface DirectedGraph<V,E>vertex - vertex whose degree is to be calculated.public Set<E> outgoingEdgesOf(V vertex)+
DirectedGraphoutgoingEdgesOf in interface DirectedGraph<V,E>vertex - the vertex for which the list of outgoing edges to be
+ returned.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/Multigraph.html b/javadoc/org/jgrapht/graph/Multigraph.html new file mode 100644 index 0000000..5701069 --- /dev/null +++ b/javadoc/org/jgrapht/graph/Multigraph.html @@ -0,0 +1,359 @@ + + + + + + +public class Multigraph<V,E> +extends AbstractBaseGraph<V,E> +implements UndirectedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
Multigraph(Class<? extends E> edgeClass)
+Creates a new multigraph.
+ |
+
Multigraph(EdgeFactory<V,E> ef)
+Creates a new multigraph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic Multigraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic Multigraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/ParanoidGraph.html b/javadoc/org/jgrapht/graph/ParanoidGraph.html new file mode 100644 index 0000000..b07b44f --- /dev/null +++ b/javadoc/org/jgrapht/graph/ParanoidGraph.html @@ -0,0 +1,367 @@ + + + + + + +public class ParanoidGraph<V,E> +extends GraphDelegator<V,E>+
| Constructor and Description | +
|---|
ParanoidGraph(Graph<V,E> g) |
+
| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
addEdge, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdge, removeAllEdges, removeAllEdges, removeAllVerticespublic boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.addVertex in interface Graph<V,E>addVertex in class GraphDelegator<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/Pseudograph.html b/javadoc/org/jgrapht/graph/Pseudograph.html new file mode 100644 index 0000000..5c6dbb6 --- /dev/null +++ b/javadoc/org/jgrapht/graph/Pseudograph.html @@ -0,0 +1,358 @@ + + + + + + +public class Pseudograph<V,E> +extends AbstractBaseGraph<V,E> +implements UndirectedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
Pseudograph(Class<? extends E> edgeClass)
+Creates a new pseudograph.
+ |
+
Pseudograph(EdgeFactory<V,E> ef)
+Creates a new pseudograph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic Pseudograph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic Pseudograph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/SimpleDirectedGraph.html b/javadoc/org/jgrapht/graph/SimpleDirectedGraph.html new file mode 100644 index 0000000..28a22da --- /dev/null +++ b/javadoc/org/jgrapht/graph/SimpleDirectedGraph.html @@ -0,0 +1,356 @@ + + + + + + +public class SimpleDirectedGraph<V,E> +extends AbstractBaseGraph<V,E> +implements DirectedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
SimpleDirectedGraph(Class<? extends E> edgeClass)
+Creates a new simple directed graph.
+ |
+
SimpleDirectedGraph(EdgeFactory<V,E> ef)
+Creates a new simple directed graph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic SimpleDirectedGraph(Class<? extends E> edgeClass)+
edgeClass - class on which to base factory for edgespublic SimpleDirectedGraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/SimpleDirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/SimpleDirectedWeightedGraph.html new file mode 100644 index 0000000..40c0d06 --- /dev/null +++ b/javadoc/org/jgrapht/graph/SimpleDirectedWeightedGraph.html @@ -0,0 +1,381 @@ + + + + + + +public class SimpleDirectedWeightedGraph<V,E> +extends SimpleDirectedGraph<V,E> +implements WeightedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
SimpleDirectedWeightedGraph(Class<? extends E> edgeClass)
+Creates a new simple directed weighted graph.
+ |
+
SimpleDirectedWeightedGraph(EdgeFactory<V,E> ef)
+Creates a new simple directed weighted graph with the specified edge
+ factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfpublic SimpleDirectedWeightedGraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/SimpleGraph.html b/javadoc/org/jgrapht/graph/SimpleGraph.html new file mode 100644 index 0000000..288f41c --- /dev/null +++ b/javadoc/org/jgrapht/graph/SimpleGraph.html @@ -0,0 +1,359 @@ + + + + + + +public class SimpleGraph<V,E> +extends AbstractBaseGraph<V,E> +implements UndirectedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecifics| Constructor and Description | +
|---|
SimpleGraph(Class<? extends E> edgeClass)
+Creates a new simple graph.
+ |
+
SimpleGraph(EdgeFactory<V,E> ef)
+Creates a new simple graph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic SimpleGraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/SimpleGraphPath.html b/javadoc/org/jgrapht/graph/SimpleGraphPath.html new file mode 100644 index 0000000..f505228 --- /dev/null +++ b/javadoc/org/jgrapht/graph/SimpleGraphPath.html @@ -0,0 +1,389 @@ + + + + + + +public class SimpleGraphPath<V,E> +extends Object +implements GraphPath<V,E>+
SimpleGraph| Constructor and Description | +
|---|
SimpleGraphPath(SimpleGraph<V,E> simpleGraph,
+ List<V> vertices,
+ double weight) |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<E> |
+getEdgeList()
+Returns the edges making up the path.
+ |
+
V |
+getEndVertex()
+Returns the end vertex in the path.
+ |
+
SimpleGraph<V,E> |
+getGraph()
+Returns the graph over which this path is defined.
+ |
+
V |
+getStartVertex()
+Returns the start vertex in the path.
+ |
+
List<V> |
+getVertexList() |
+
double |
+getWeight()
+Returns the weight assigned to the path.
+ |
+
public SimpleGraphPath(SimpleGraph<V,E> simpleGraph, + List<V> vertices, + double weight)+
simpleGraph - The simple graph where the path is.vertices - A list of vertices that make up the path.IllegalArgumentException - if the vertices are not in the path or
+ if they do not define a path in the graph.public SimpleGraph<V,E> getGraph()+
GraphPathpublic V getStartVertex()+
GraphPathgetStartVertex in interface GraphPath<V,E>public V getEndVertex()+
GraphPathgetEndVertex in interface GraphPath<V,E>public List<E> getEdgeList()+
GraphPathGraphs.getPathVertexList(org.jgrapht.GraphPath<V, E>) provides a convenience method for this.
+
+ Whether or not the returned edge list is modifiable depends on the + path implementation.
getEdgeList in interface GraphPath<V,E>public List<V> getVertexList()+
public double getWeight()+
GraphPathCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/SimpleWeightedGraph.html b/javadoc/org/jgrapht/graph/SimpleWeightedGraph.html new file mode 100644 index 0000000..f91d0f8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/SimpleWeightedGraph.html @@ -0,0 +1,379 @@ + + + + + + +public class SimpleWeightedGraph<V,E> +extends SimpleGraph<V,E> +implements WeightedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
SimpleWeightedGraph(Class<? extends E> edgeClass)
+Creates a new simple weighted graph.
+ |
+
SimpleWeightedGraph(EdgeFactory<V,E> ef)
+Creates a new simple weighted graph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetdegreeOfpublic SimpleWeightedGraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/Subgraph.html b/javadoc/org/jgrapht/graph/Subgraph.html new file mode 100644 index 0000000..30da50b --- /dev/null +++ b/javadoc/org/jgrapht/graph/Subgraph.html @@ -0,0 +1,899 @@ + + + + + + +public class Subgraph<V,E,G extends Graph<V,E>> +extends AbstractGraph<V,E> +implements Serializable+
Graph interface.
+
+ If the base graph is a ListenableGraph, the subgraph
+ listens on the base graph and guarantees the subgraph property. If an edge or
+ a vertex is removed from the base graph, it is automatically removed from the
+ subgraph. Subgraph listeners are informed on such removal only if it results
+ in a cascaded removal from the subgraph. If the subgraph has been created as
+ an induced subgraph it also keeps track of edges being added to its vertices.
+ If vertices are added to the base graph, the subgraph remains unaffected.
If the base graph is not a ListenableGraph, then the subgraph + property cannot be guaranteed. If edges or vertices are removed from the base + graph, they are not removed from the subgraph.
+ +Modifications to Subgraph are allowed as long as the subgraph property is + maintained. Addition of vertices or edges are allowed as long as they also + exist in the base graph. Removal of vertices or edges is always allowed. The + base graph is never affected by any modification made to the + subgraph.
+ +A subgraph may provide a "live-window" on a base graph, so that changes
+ made to its vertices or edges are immediately reflected in the base graph,
+ and vice versa. For that to happen, vertices and edges added to the subgraph
+ must be identical (that is, reference-equal and not only value-equal)
+ to their respective ones in the base graph. Previous versions of this class
+ enforced such identity, at a severe performance cost. Currently it is no
+ longer enforced. If you want to achieve a "live-window"functionality, your
+ safest tactics would be to NOT override the equals() methods of
+ your vertices and edges. If you use a class that has already overridden the
+ equals() method, such as String, than you can use a
+ wrapper around it, or else use it directly but exercise a great care to avoid
+ having different-but-equal instances in the subgraph and the base graph.
This graph implementation guarantees deterministic vertex and edge set
+ ordering (via LinkedHashSet).
Graph,
+Set,
+Serialized Form| Constructor and Description | +
|---|
Subgraph(G base,
+ Set<V> vertexSubset)
+Creates a new induced Subgraph.
+ |
+
Subgraph(G base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new Subgraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this subgraph.
+ |
+
boolean |
+containsEdge(E e)
+Returns true if this graph contains the specified edge.
+ |
+
boolean |
+containsVertex(V v)
+Returns true if this graph contains the specified vertex.
+ |
+
Set<E> |
+edgeSet()
+Returns a set of the edges contained in this graph.
+ |
+
Set<E> |
+edgesOf(V vertex)
+Returns a set of all edges touching the specified vertex.
+ |
+
Set<E> |
+getAllEdges(V sourceVertex,
+ V targetVertex)
+Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph.
+ |
+
G |
+getBase() |
+
E |
+getEdge(V sourceVertex,
+ V targetVertex)
+Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph.
+ |
+
EdgeFactory<V,E> |
+getEdgeFactory()
+Returns the edge factory using which this graph creates new edges.
+ |
+
V |
+getEdgeSource(E e)
+Returns the source vertex of an edge.
+ |
+
V |
+getEdgeTarget(E e)
+Returns the target vertex of an edge.
+ |
+
double |
+getEdgeWeight(E e)
+Returns the weight assigned to a given edge.
+ |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
void |
+setEdgeWeight(E e,
+ double weight) |
+
Set<V> |
+vertexSet()
+Returns a set of the vertices contained in this graph.
+ |
+
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetspublic Subgraph(G base, + Set<V> vertexSubset, + Set<E> edgeSubset)+
base - the base (backing) graph on which the subgraph will be based.vertexSubset - vertices to include in the subgraph. If
+ null then all vertices are included.edgeSubset - edges to in include in the subgraph. If
+ null then all the edges whose vertices found in the graph are
+ included.public Subgraph(G base, + Set<V> vertexSubset)+
base - the base (backing) graph on which the subgraph will be based.vertexSubset - vertices to include in the subgraph. If
+ null then all vertices are included.public Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
Graphnull, returns null. If both vertices
+ exist but no edges found, returns an empty set.
+
+ In undirected graphs, some of the returned edges may have their source + and target vertices in the opposite order. In simple graphs the returned + set is either singleton set or empty set.
getAllEdges in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getAllEdges(Object, Object)public E getEdge(V sourceVertex, + V targetVertex)+
Graph
+ null. If any of the specified vertices is null
+ returns null
+
+ In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
getEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.Graph.getEdge(Object, Object)public EdgeFactory<V,E> getEdgeFactory()+
GraphgetEdgeFactory in interface Graph<V,E>Graph.getEdgeFactory()public E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean addVertex(V v)+
addVertex in interface Graph<V,E>v - the vertex to be added.true if the vertex was added, otherwise
+ false.NullPointerExceptionIllegalArgumentExceptionSubgraph,
+Graph.addVertex(Object)public boolean containsEdge(E e)+
Graphe2 such that e.equals(e2). If the
+ specified edge is null returns false.containsEdge in interface Graph<V,E>e - edge whose presence in this graph is to be tested.Graph.containsEdge(Object)public boolean containsVertex(V v)+
Graphu such that u.equals(v). If the
+ specified vertex is null returns false.containsVertex in interface Graph<V,E>v - vertex whose presence in this graph is to be tested.Graph.containsVertex(Object)public Set<E> edgeSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
edgeSet in interface Graph<V,E>Graph.edgeSet()public Set<E> edgesOf(V vertex)+
GraphedgesOf in interface Graph<V,E>vertex - the vertex for which a set of touching edges is to be
+ returned.Graph.edgesOf(Object)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
removeEdge in interface Graph<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)public Set<V> vertexSet()+
GraphThe graph implementation may maintain a particular set ordering (e.g.
+ via LinkedHashSet) for deterministic iteration, but
+ this is not required. It is the responsibility of callers who rely on
+ this behavior to only use graph implementations which support it.
vertexSet in interface Graph<V,E>Graph.vertexSet()public V getEdgeSource(E e)+
GraphgetEdgeSource in interface Graph<V,E>e - edge of interestGraph.getEdgeSource(Object)public V getEdgeTarget(E e)+
GraphgetEdgeTarget in interface Graph<V,E>e - edge of interestGraph.getEdgeTarget(Object)public G getBase()+
public double getEdgeWeight(E e)+
GraphWeightedGraph.DEFAULT_EDGE_WEIGHT), allowing
+ weighted-graph algorithms to apply to them where meaningful.getEdgeWeight in interface Graph<V,E>e - edge of interestGraph.getEdgeWeight(Object)public void setEdgeWeight(E e, + double weight)+ +
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UndirectedGraphUnion.html b/javadoc/org/jgrapht/graph/UndirectedGraphUnion.html new file mode 100644 index 0000000..90ea244 --- /dev/null +++ b/javadoc/org/jgrapht/graph/UndirectedGraphUnion.html @@ -0,0 +1,273 @@ + + + + + + +public class UndirectedGraphUnion<V,E> +extends GraphUnion<V,E,UndirectedGraph<V,E>> +implements UndirectedGraph<V,E>+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+degreeOf(V vertex)
+Returns the degree of the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic int degreeOf(V vertex)+
UndirectedGraphdegreeOf in interface UndirectedGraph<V,E>vertex - vertex whose degree is to be calculated.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UndirectedMaskSubgraph.html b/javadoc/org/jgrapht/graph/UndirectedMaskSubgraph.html new file mode 100644 index 0000000..28dc18d --- /dev/null +++ b/javadoc/org/jgrapht/graph/UndirectedMaskSubgraph.html @@ -0,0 +1,280 @@ + + + + + + +public class UndirectedMaskSubgraph<V,E> +extends MaskSubgraph<V,E> +implements UndirectedGraph<V,E>+
MaskSubgraph on another graph.| Constructor and Description | +
|---|
UndirectedMaskSubgraph(UndirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask) |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic UndirectedMaskSubgraph(UndirectedGraph<V,E> base, + MaskFunctor<V,E> mask)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UndirectedSubgraph.html b/javadoc/org/jgrapht/graph/UndirectedSubgraph.html new file mode 100644 index 0000000..49dbaca --- /dev/null +++ b/javadoc/org/jgrapht/graph/UndirectedSubgraph.html @@ -0,0 +1,324 @@ + + + + + + +public class UndirectedSubgraph<V,E> +extends Subgraph<V,E,UndirectedGraph<V,E>> +implements UndirectedGraph<V,E>+
Subgraph,
+Serialized Form| Constructor and Description | +
|---|
UndirectedSubgraph(UndirectedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new undirected subgraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+degreeOf(V vertex)
+Returns the degree of the specified vertex.
+ |
+
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic UndirectedSubgraph(UndirectedGraph<V,E> base, + Set<V> vertexSubset, + Set<E> edgeSubset)+
base - the base (backing) graph on which the subgraph will be based.vertexSubset - vertices to include in the subgraph. If
+ null then all vertices are included.edgeSubset - edges to in include in the subgraph. If
+ null then all the edges whose vertices found in the graph are
+ included.public int degreeOf(V vertex)+
UndirectedGraphdegreeOf in interface UndirectedGraph<V,E>vertex - vertex whose degree is to be calculated.UndirectedGraph.degreeOf(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UndirectedWeightedSubgraph.html b/javadoc/org/jgrapht/graph/UndirectedWeightedSubgraph.html new file mode 100644 index 0000000..1a6a957 --- /dev/null +++ b/javadoc/org/jgrapht/graph/UndirectedWeightedSubgraph.html @@ -0,0 +1,314 @@ + + + + + + +public class UndirectedWeightedSubgraph<V,E> +extends UndirectedSubgraph<V,E> +implements WeightedGraph<V,E>+
Subgraph,
+Serialized FormDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
UndirectedWeightedSubgraph(WeightedGraph<V,E> base,
+ Set<V> vertexSubset,
+ Set<E> edgeSubset)
+Creates a new undirected weighted subgraph.
+ |
+
degreeOfaddEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic UndirectedWeightedSubgraph(WeightedGraph<V,E> base, + Set<V> vertexSubset, + Set<E> edgeSubset)+
base - the base (backing) graph on which the subgraph will be based.vertexSubset - vertices to include in the subgraph. If
+ null then all vertices are included.edgeSubset - edges to in include in the subgraph. If
+ null then all the edges whose vertices found in the graph are
+ included.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UnmodifiableDirectedGraph.html b/javadoc/org/jgrapht/graph/UnmodifiableDirectedGraph.html new file mode 100644 index 0000000..0706087 --- /dev/null +++ b/javadoc/org/jgrapht/graph/UnmodifiableDirectedGraph.html @@ -0,0 +1,295 @@ + + + + + + +public class UnmodifiableDirectedGraph<V,E> +extends UnmodifiableGraph<V,E> +implements DirectedGraph<V,E>+
UnmodifiableGraph,
+Serialized Form| Constructor and Description | +
|---|
UnmodifiableDirectedGraph(DirectedGraph<V,E> g)
+Creates a new unmodifiable directed graph based on the specified backing
+ graph.
+ |
+
addEdge, addEdge, addVertex, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertexcontainsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitincomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic UnmodifiableDirectedGraph(DirectedGraph<V,E> g)+
g - the backing graph on which an unmodifiable graph is to be
+ created.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UnmodifiableGraph.html b/javadoc/org/jgrapht/graph/UnmodifiableGraph.html new file mode 100644 index 0000000..96c85c8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/UnmodifiableGraph.html @@ -0,0 +1,623 @@ + + + + + + +public class UnmodifiableGraph<V,E> +extends GraphDelegator<V,E> +implements Serializable+
+ UnsupportedOperationException.
+
+ This graph does not pass the hashCode and equals operations through + to the backing graph, but relies on Object's equals and + hashCode methods. This graph will be serializable if the backing + graph is serializable.
| Constructor and Description | +
|---|
UnmodifiableGraph(Graph<V,E> g)
+Creates a new unmodifiable graph based on the specified backing graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
E |
+addEdge(V sourceVertex,
+ V targetVertex)
+Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge.
+ |
+
boolean |
+addEdge(V sourceVertex,
+ V targetVertex,
+ E e)
+Adds the specified edge to this graph, going from the source vertex to
+ the target vertex.
+ |
+
boolean |
+addVertex(V v)
+Adds the specified vertex to this graph if not already present.
+ |
+
boolean |
+removeAllEdges(Collection<? extends E> edges)
+Removes all the edges in this graph that are also contained in the
+ specified edge collection.
+ |
+
Set<E> |
+removeAllEdges(V sourceVertex,
+ V targetVertex)
+Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges.
+ |
+
boolean |
+removeAllVertices(Collection<? extends V> vertices)
+Removes all the vertices in this graph that are also contained in the
+ specified vertex collection.
+ |
+
boolean |
+removeEdge(E e)
+Removes the specified edge from the graph.
+ |
+
E |
+removeEdge(V sourceVertex,
+ V targetVertex)
+Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph.
+ |
+
boolean |
+removeVertex(V v)
+Removes the specified vertex from this graph including all its touching
+ edges if present.
+ |
+
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitcontainsEdgepublic E addEdge(V sourceVertex, + V targetVertex)+
Graphnull.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
+ +This method creates the new edge e using this graph's
+ EdgeFactory. For the new edge to be added e
+ must not be equal to any other edge the graph (even if the graph
+ allows edge-multiplicity). More formally, the graph must not contain any
+ edge e2 such that e2.equals(e). If such
+ e2 is found then the newly created edge e is
+ abandoned, the method leaves this graph unchanged returns
+ null.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.
+ null.Graph.addEdge(Object, Object)public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
Graph
+ e, to this graph if this graph contains no edge e2
+ such that e2.equals(e). If this graph already contains such
+ an edge, the call leaves this graph unchanged and returns false.
+ Some graphs do not allow edge-multiplicity. In such cases, if the graph
+ already contains an edge from the specified source to the specified
+ target, than this method does not change the graph and returns
+ false. If the edge was added to the graph, returns
+ true.
+
+ The source and target vertices must already be contained in this + graph. If they are not found in graph IllegalArgumentException is + thrown.
addEdge in interface Graph<V,E>addEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.e - edge to be added to this graph.Graph.addEdge(Object, Object, Object)public boolean addVertex(V v)+
Graphv, to this graph if
+ this graph contains no vertex u such that
+ u.equals(v). If this graph already contains such vertex, the call
+ leaves this graph unchanged and returns false. In combination
+ with the restriction on constructors, this ensures that graphs never
+ contain duplicate vertices.addVertex in interface Graph<V,E>addVertex in class GraphDelegator<V,E>v - vertex to be added to this graph.Graph.addVertex(Object)public boolean removeAllEdges(Collection<? extends E> edges)+
GraphGraph.removeEdge(Object) method.removeAllEdges in interface Graph<V,E>removeAllEdges in class AbstractGraph<V,E>edges - edges to be removed from this graph.Graph.removeAllEdges(Collection)public Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
Graphnull if any of the specified vertices does not exist in the
+ graph. If both vertices exist but no edge is found, returns an empty set.
+ This method will either invoke the Graph.removeEdge(Object) method, or
+ the Graph.removeEdge(Object, Object) method.removeAllEdges in interface Graph<V,E>removeAllEdges in class AbstractGraph<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if either vertex is not
+ part of graphGraph.removeAllEdges(Object, Object)public boolean removeAllVertices(Collection<? extends V> vertices)+
GraphGraph.removeVertex(Object) method.removeAllVertices in interface Graph<V,E>removeAllVertices in class AbstractGraph<V,E>vertices - vertices to be removed from this graph.Graph.removeAllVertices(Collection)public boolean removeEdge(E e)+
Graph
+ e2 such that e2.equals(e), if the graph contains such
+ edge. Returns true if the graph contained the specified edge.
+ (The graph will not contain the specified edge once the call returns).
+
+ If the specified edge is null returns
+ false.
removeEdge in interface Graph<V,E>removeEdge in class GraphDelegator<V,E>e - edge to be removed from this graph, if present.true if and only if the graph contained the
+ specified edge.Graph.removeEdge(Object)public E removeEdge(V sourceVertex, + V targetVertex)+
Graphnull otherwise.removeEdge in interface Graph<V,E>removeEdge in class GraphDelegator<V,E>sourceVertex - source vertex of the edge.targetVertex - target vertex of the edge.null if no edge removed.Graph.removeEdge(Object, Object)public boolean removeVertex(V v)+
Graph
+ u such that u.equals(v), the call removes all edges
+ that touch u and then removes u itself. If no
+ such u is found, the call leaves the graph unchanged.
+ Returns true if the graph contained the specified vertex. (The
+ graph will not contain the specified vertex once the call returns).
+
+ If the specified vertex is null returns
+ false.
removeVertex in interface Graph<V,E>removeVertex in class GraphDelegator<V,E>v - vertex to be removed from this graph, if present.true if the graph contained the specified vertex;
+ false otherwise.Graph.removeVertex(Object)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/UnmodifiableUndirectedGraph.html b/javadoc/org/jgrapht/graph/UnmodifiableUndirectedGraph.html new file mode 100644 index 0000000..b42b5e7 --- /dev/null +++ b/javadoc/org/jgrapht/graph/UnmodifiableUndirectedGraph.html @@ -0,0 +1,295 @@ + + + + + + +public class UnmodifiableUndirectedGraph<V,E> +extends UnmodifiableGraph<V,E> +implements UndirectedGraph<V,E>+
UnmodifiableGraph,
+Serialized Form| Constructor and Description | +
|---|
UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)
+Creates a new unmodifiable undirected graph based on the specified
+ backing graph.
+ |
+
addEdge, addEdge, addVertex, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertexcontainsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toStringFromSetsclone, finalize, getClass, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)+
g - the backing graph on which an unmodifiable graph is to be
+ created.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/WeightedMultigraph.html b/javadoc/org/jgrapht/graph/WeightedMultigraph.html new file mode 100644 index 0000000..6c99b33 --- /dev/null +++ b/javadoc/org/jgrapht/graph/WeightedMultigraph.html @@ -0,0 +1,382 @@ + + + + + + +public class WeightedMultigraph<V,E> +extends Multigraph<V,E> +implements WeightedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
WeightedMultigraph(Class<? extends E> edgeClass)
+Creates a new weighted multigraph.
+ |
+
WeightedMultigraph(EdgeFactory<V,E> ef)
+Creates a new weighted multigraph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetdegreeOfpublic WeightedMultigraph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/WeightedPseudograph.html b/javadoc/org/jgrapht/graph/WeightedPseudograph.html new file mode 100644 index 0000000..50774aa --- /dev/null +++ b/javadoc/org/jgrapht/graph/WeightedPseudograph.html @@ -0,0 +1,382 @@ + + + + + + +public class WeightedPseudograph<V,E> +extends Pseudograph<V,E> +implements WeightedGraph<V,E>+
AbstractBaseGraph.DirectedEdgeContainer<VV,EE>, AbstractBaseGraph.DirectedSpecifics, AbstractBaseGraph.UndirectedSpecificsDEFAULT_EDGE_WEIGHT| Constructor and Description | +
|---|
WeightedPseudograph(Class<? extends E> edgeClass)
+Creates a new weighted pseudograph.
+ |
+
WeightedPseudograph(EdgeFactory<V,E> ef)
+Creates a new weighted pseudograph with the specified edge factory.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+builder(EdgeFactory<V,E> ef) |
+
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, createDirectedSpecifics, createUndirectedSpecifics, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsfinalize, getClass, notify, notifyAll, wait, wait, waitsetEdgeWeightaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetdegreeOfpublic WeightedPseudograph(EdgeFactory<V,E> ef)+
ef - the edge factory of the new graph.public static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> builder(Class<? extends E> edgeClass)+
public static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> builder(EdgeFactory<V,E> ef)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/AbstractGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/AbstractGraphBuilder.html new file mode 100644 index 0000000..2fdb797 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/AbstractGraphBuilder.html @@ -0,0 +1,520 @@ + + + + + + +public abstract class AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>> +extends Object+
Graph| Modifier and Type | +Field and Description | +
|---|---|
protected G |
+graph |
+
| Constructor and Description | +
|---|
AbstractGraphBuilder(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
B |
+addEdge(V source,
+ V target)
+Adds an edge to the graph being built.
+ |
+
B |
+addEdgeChain(V first,
+ V second,
+ V... rest)
+Adds a chain of edges to the graph being built.
+ |
+
B |
+addGraph(Graph<? extends V,? extends E> sourceGraph)
+Adds all the vertices and all the edges of the
+sourceGraph to the
+ graph being built. |
+
B |
+addVertex(V vertex)
+Adds
+vertex to the graph being built. |
+
B |
+addVertices(V... vertices)
+Adds each vertex of
+vertices to the graph being built. |
+
G |
+build()
+Build the graph.
+ |
+
UnmodifiableGraph<V,E> |
+buildUnmodifiable()
+Build an unmodifiable version graph.
+ |
+
B |
+removeEdge(V source,
+ V target)
+Removes an edge going from source vertex to target vertex from the graph
+ being built, if such vertices and such edge exist in the graph.
+ |
+
B |
+removeVertex(V vertex)
+Removes
+vertex from the graph being built, if such vertex exist
+ in graph. |
+
B |
+removeVertices(V... vertices)
+Removes each vertex of
+vertices from the graph being built, if
+ such vertices exist in graph. |
+
protected abstract B |
+self() |
+
public AbstractGraphBuilder(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.baseGraph - the graph object to base building onprotected abstract B self()+
this object.public B addVertex(V vertex)+
vertex to the graph being built.vertex - the vertex to addGraph.addVertex(Object)public B addVertices(V... vertices)+
vertices to the graph being built.vertices - the vertices to addaddVertex(Object)public B addEdge(V source, + V target)+
source - source vertex of the edge.target - target vertex of the edge.Graphs.addEdgeWithVertices(Graph, Object, Object)public B addEdgeChain(V first, + V second, + V... rest)+
addEdge(Object, Object)public B addGraph(Graph<? extends V,? extends E> sourceGraph)+
sourceGraph to the
+ graph being built.Graphs.addGraph(Graph, Graph)public B removeVertex(V vertex)+
vertex from the graph being built, if such vertex exist
+ in graph.vertex - the vertex to removeGraph.removeVertex(Object)public B removeVertices(V... vertices)+
vertices from the graph being built, if
+ such vertices exist in graph.vertices - the vertices to removeremoveVertex(Object)public B removeEdge(V source, + V target)+
source - source vertex of the edge.target - target vertex of the edge.Graph.removeVertex(Object)public G build()+
public UnmodifiableGraph<V,E> buildUnmodifiable()+
build()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/DirectedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/DirectedGraphBuilder.html new file mode 100644 index 0000000..75e11b8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/DirectedGraphBuilder.html @@ -0,0 +1,317 @@ + + + + + + +public final class DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>> +extends DirectedGraphBuilderBase<V,E,G,DirectedGraphBuilder<V,E,G>>+
Graph. If you want to extend this class, see
+ DirectedGraphBuilderBase.graph| Constructor and Description | +
|---|
DirectedGraphBuilder(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected DirectedGraphBuilder<V,E,G> |
+self() |
+
buildUnmodifiableaddEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVerticespublic DirectedGraphBuilder(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.
+
+ The recomended way to use this constructor is: new
+ DirectedGraphBuilder<...>(new YourGraph<...>(...)).
+
+
NOTE: baseGraph should not be an existing graph. If you want
+ to add an existing graph to the graph being built, you should use the
+ AbstractGraphBuilder.addVertex(Object) method.
baseGraph - the graph object to base building onprotected DirectedGraphBuilder<V,E,G> self()+
self in class AbstractGraphBuilder<V,E,G extends DirectedGraph<V,E>,DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>>>this object.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/DirectedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/DirectedGraphBuilderBase.html new file mode 100644 index 0000000..788caea --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/DirectedGraphBuilderBase.html @@ -0,0 +1,307 @@ + + + + + + +public abstract class DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>> +extends AbstractGraphBuilder<V,E,G,B>+
DirectedGraphBuilder for extending.graph| Constructor and Description | +
|---|
DirectedGraphBuilderBase(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
UnmodifiableDirectedGraph<V,E> |
+buildUnmodifiable()
+Build an unmodifiable version graph.
+ |
+
addEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVertices, selfpublic DirectedGraphBuilderBase(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.baseGraph - the graph object to base building onpublic UnmodifiableDirectedGraph<V,E> buildUnmodifiable()+
AbstractGraphBuilderbuildUnmodifiable in class AbstractGraphBuilder<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>>AbstractGraphBuilder.build()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/DirectedWeightedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/DirectedWeightedGraphBuilder.html new file mode 100644 index 0000000..1820a1d --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/DirectedWeightedGraphBuilder.html @@ -0,0 +1,329 @@ + + + + + + +public final class DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>> +extends DirectedWeightedGraphBuilderBase<V,E,G,DirectedWeightedGraphBuilder<V,E,G>>+
DirectedWeightedGraphBuilderBase.graph| Constructor and Description | +
|---|
DirectedWeightedGraphBuilder(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected DirectedWeightedGraphBuilder<V,E,G> |
+self() |
+
addEdgebuildUnmodifiableaddEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVerticespublic DirectedWeightedGraphBuilder(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.
+
+ The recomended way to use this constructor is: new
+ DirectedWeightedGraphBuilder<...>(new YourGraph<...>(...)).
+
+
NOTE: baseGraph should not be an existing graph. If you want
+ to add an existing graph to the graph being built, you should use the
+ AbstractGraphBuilder.addVertex(Object) method.
baseGraph - the graph object to base building onprotected DirectedWeightedGraphBuilder<V,E,G> self()+
self in class AbstractGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>>this object.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/DirectedWeightedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/DirectedWeightedGraphBuilderBase.html new file mode 100644 index 0000000..d995bc4 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/DirectedWeightedGraphBuilderBase.html @@ -0,0 +1,321 @@ + + + + + + +public abstract class DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>> +extends DirectedGraphBuilderBase<V,E,G,B>+
DirectedWeightedGraphBuilder for extending.graph| Constructor and Description | +
|---|
DirectedWeightedGraphBuilderBase(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
B |
+addEdge(V source,
+ V target,
+ double weight)
+Adds an weighted edge to the graph being built.
+ |
+
buildUnmodifiableaddEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVertices, selfpublic DirectedWeightedGraphBuilderBase(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.baseGraph - the graph object to base building onpublic B addEdge(V source, + V target, + double weight)+
source - source vertex of the edge.target - target vertex of the edge.weight - weight of the edge.Graphs.addEdgeWithVertices(Graph, Object, Object, double)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/UndirectedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/UndirectedGraphBuilder.html new file mode 100644 index 0000000..ab4a4cb --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/UndirectedGraphBuilder.html @@ -0,0 +1,317 @@ + + + + + + +public final class UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>> +extends UndirectedGraphBuilderBase<V,E,G,UndirectedGraphBuilder<V,E,G>>+
Graph. If you want to extend this class, see
+ UndirectedGraphBuilderBase.graph| Constructor and Description | +
|---|
UndirectedGraphBuilder(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected UndirectedGraphBuilder<V,E,G> |
+self() |
+
buildUnmodifiableaddEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVerticespublic UndirectedGraphBuilder(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.
+
+ The recomended way to use this constructor is: new
+ UndirectedGraphBuilder<...>(new YourGraph<...>(...)).
+
+
NOTE: baseGraph should not be an existing graph. If you want
+ to add an existing graph to the graph being built, you should use the
+ AbstractGraphBuilder.addVertex(Object) method.
baseGraph - the graph object to base building onprotected UndirectedGraphBuilder<V,E,G> self()+
self in class AbstractGraphBuilder<V,E,G extends UndirectedGraph<V,E>,UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>>>this object.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/UndirectedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/UndirectedGraphBuilderBase.html new file mode 100644 index 0000000..833d95b --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/UndirectedGraphBuilderBase.html @@ -0,0 +1,307 @@ + + + + + + +public abstract class UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>> +extends AbstractGraphBuilder<V,E,G,B>+
UndirectedGraphBuilder for extending.graph| Constructor and Description | +
|---|
UndirectedGraphBuilderBase(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
UnmodifiableUndirectedGraph<V,E> |
+buildUnmodifiable()
+Build an unmodifiable version graph.
+ |
+
addEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVertices, selfpublic UndirectedGraphBuilderBase(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.baseGraph - the graph object to base building onpublic UnmodifiableUndirectedGraph<V,E> buildUnmodifiable()+
AbstractGraphBuilderbuildUnmodifiable in class AbstractGraphBuilder<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>>AbstractGraphBuilder.build()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/UndirectedWeightedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/UndirectedWeightedGraphBuilder.html new file mode 100644 index 0000000..01823b6 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/UndirectedWeightedGraphBuilder.html @@ -0,0 +1,329 @@ + + + + + + +public final class UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>> +extends UndirectedWeightedGraphBuilderBase<V,E,G,UndirectedWeightedGraphBuilder<V,E,G>>+
UndirectedWeightedGraphBuilderBase.graph| Constructor and Description | +
|---|
UndirectedWeightedGraphBuilder(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected UndirectedWeightedGraphBuilder<V,E,G> |
+self() |
+
addEdgebuildUnmodifiableaddEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVerticespublic UndirectedWeightedGraphBuilder(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.
+
+ The recomended way to use this constructor is: new
+ UndirectedWeightedGraphBuilder<...>(new YourGraph<...>(...)).
+
+
NOTE: baseGraph should not be an existing graph. If you want
+ to add an existing graph to the graph being built, you should use the
+ AbstractGraphBuilder.addVertex(Object) method.
baseGraph - the graph object to base building onprotected UndirectedWeightedGraphBuilder<V,E,G> self()+
self in class AbstractGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>>this object.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/UndirectedWeightedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/UndirectedWeightedGraphBuilderBase.html new file mode 100644 index 0000000..5811c3d --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/UndirectedWeightedGraphBuilderBase.html @@ -0,0 +1,321 @@ + + + + + + +public abstract class UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>> +extends UndirectedGraphBuilderBase<V,E,G,B>+
UndirectedWeightedGraphBuilder for extending.graph| Constructor and Description | +
|---|
UndirectedWeightedGraphBuilderBase(G baseGraph)
+Creates a builder based on
+baseGraph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
B |
+addEdge(V source,
+ V target,
+ double weight)
+Adds an weighted edge to the graph being built.
+ |
+
buildUnmodifiableaddEdge, addEdgeChain, addGraph, addVertex, addVertices, build, removeEdge, removeVertex, removeVertices, selfpublic UndirectedWeightedGraphBuilderBase(G baseGraph)+
baseGraph. baseGraph must be
+ mutable.baseGraph - the graph object to base building onpublic B addEdge(V source, + V target, + double weight)+
source - source vertex of the edge.target - target vertex of the edge.weight - weight of the edge.Graphs.addEdgeWithVertices(Graph, Object, Object, double)Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/AbstractGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/class-use/AbstractGraphBuilder.html new file mode 100644 index 0000000..8ba518c --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/AbstractGraphBuilder.html @@ -0,0 +1,218 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>>
+Base class for builders of
+Graph |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>>
+A builder class for
+Graph. |
+
class |
+DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedGraphBuilder for extending. |
+
class |
+DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for directed weighted graphs}.
+ |
+
class |
+DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedWeightedGraphBuilder for extending. |
+
class |
+UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>>
+A builder class for
+Graph. |
+
class |
+UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedGraphBuilder for extending. |
+
class |
+UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for undirected weighted graphs.
+ |
+
class |
+UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/DirectedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/class-use/DirectedGraphBuilder.html new file mode 100644 index 0000000..204e58d --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/DirectedGraphBuilder.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected DirectedGraphBuilder<V,E,G> |
+DirectedGraphBuilder.self() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/DirectedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/class-use/DirectedGraphBuilderBase.html new file mode 100644 index 0000000..3e3b3d8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/DirectedGraphBuilderBase.html @@ -0,0 +1,240 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+DefaultDirectedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+DirectedPseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+DirectedMultigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+SimpleDirectedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+DefaultDirectedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+DirectedPseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+DirectedMultigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+SimpleDirectedGraph.builder(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedGraphBuilder for extending. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>>
+A builder class for
+Graph. |
+
class |
+DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for directed weighted graphs}.
+ |
+
class |
+DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/DirectedWeightedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/class-use/DirectedWeightedGraphBuilder.html new file mode 100644 index 0000000..c09aca3 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/DirectedWeightedGraphBuilder.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected DirectedWeightedGraphBuilder<V,E,G> |
+DirectedWeightedGraphBuilder.self() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/DirectedWeightedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/class-use/DirectedWeightedGraphBuilderBase.html new file mode 100644 index 0000000..e6c4c88 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/DirectedWeightedGraphBuilderBase.html @@ -0,0 +1,228 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+DirectedWeightedMultigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+DefaultDirectedWeightedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+SimpleDirectedWeightedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+DirectedWeightedPseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+DirectedWeightedMultigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+DefaultDirectedWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+SimpleDirectedWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+DirectedWeightedPseudograph.builder(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+DirectedWeightedGraphBuilder for extending. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for directed weighted graphs}.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/UndirectedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedGraphBuilder.html new file mode 100644 index 0000000..fb688dd --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedGraphBuilder.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected UndirectedGraphBuilder<V,E,G> |
+UndirectedGraphBuilder.self() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/UndirectedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedGraphBuilderBase.html new file mode 100644 index 0000000..736e509 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedGraphBuilderBase.html @@ -0,0 +1,232 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+Pseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+SimpleGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+Multigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+Pseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+SimpleGraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+Multigraph.builder(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedGraphBuilder for extending. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>>
+A builder class for
+Graph. |
+
class |
+UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for undirected weighted graphs.
+ |
+
class |
+UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/UndirectedWeightedGraphBuilder.html b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedWeightedGraphBuilder.html new file mode 100644 index 0000000..cb08b26 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedWeightedGraphBuilder.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected UndirectedWeightedGraphBuilder<V,E,G> |
+UndirectedWeightedGraphBuilder.self() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/class-use/UndirectedWeightedGraphBuilderBase.html b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedWeightedGraphBuilderBase.html new file mode 100644 index 0000000..0b7e3b7 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/class-use/UndirectedWeightedGraphBuilderBase.html @@ -0,0 +1,220 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+WeightedPseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+WeightedMultigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+SimpleWeightedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+WeightedPseudograph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+WeightedMultigraph.builder(EdgeFactory<V,E> ef) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+SimpleWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>
+Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>
+A builder class for undirected weighted graphs.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/package-frame.html b/javadoc/org/jgrapht/graph/builder/package-frame.html new file mode 100644 index 0000000..4a64654 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/package-frame.html @@ -0,0 +1,28 @@ + + + + + + +| Class | +Description | +
|---|---|
| AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>> | +
+ Base class for builders of
+Graph |
+
| DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>> | +
+ A builder class for
+Graph. |
+
| DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>> | +
+ Base class for
+DirectedGraphBuilder for extending. |
+
| DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>> | +
+ A builder class for directed weighted graphs}.
+ |
+
| DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>> | +
+ Base class for
+DirectedWeightedGraphBuilder for extending. |
+
| UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>> | +
+ A builder class for
+Graph. |
+
| UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>> | +
+ Base class for
+UndirectedGraphBuilder for extending. |
+
| UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>> | +
+ A builder class for undirected weighted graphs.
+ |
+
| UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>> | +
+ Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/package-tree.html b/javadoc/org/jgrapht/graph/builder/package-tree.html new file mode 100644 index 0000000..1921096 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/package-tree.html @@ -0,0 +1,153 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/builder/package-use.html b/javadoc/org/jgrapht/graph/builder/package-use.html new file mode 100644 index 0000000..d726c68 --- /dev/null +++ b/javadoc/org/jgrapht/graph/builder/package-use.html @@ -0,0 +1,232 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Class and Description | +
|---|
| DirectedGraphBuilderBase
+ Base class for
+DirectedGraphBuilder for extending. |
+
| DirectedWeightedGraphBuilderBase
+ Base class for
+DirectedWeightedGraphBuilder for extending. |
+
| UndirectedGraphBuilderBase
+ Base class for
+UndirectedGraphBuilder for extending. |
+
| UndirectedWeightedGraphBuilderBase
+ Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
| Class and Description | +
|---|
| AbstractGraphBuilder
+ Base class for builders of
+Graph |
+
| DirectedGraphBuilder
+ A builder class for
+Graph. |
+
| DirectedGraphBuilderBase
+ Base class for
+DirectedGraphBuilder for extending. |
+
| DirectedWeightedGraphBuilder
+ A builder class for directed weighted graphs}.
+ |
+
| DirectedWeightedGraphBuilderBase
+ Base class for
+DirectedWeightedGraphBuilder for extending. |
+
| UndirectedGraphBuilder
+ A builder class for
+Graph. |
+
| UndirectedGraphBuilderBase
+ Base class for
+UndirectedGraphBuilder for extending. |
+
| UndirectedWeightedGraphBuilder
+ A builder class for undirected weighted graphs.
+ |
+
| UndirectedWeightedGraphBuilderBase
+ Base class for
+UndirectedWeightedGraphBuilder for extending. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.DirectedEdgeContainer.html b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.DirectedEdgeContainer.html new file mode 100644 index 0000000..9862412 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.DirectedEdgeContainer.html @@ -0,0 +1,170 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected Map<V,AbstractBaseGraph.DirectedEdgeContainer<V,E>> |
+AbstractBaseGraph.DirectedSpecifics.vertexMapDirected |
+
| Constructor and Description | +
|---|
AbstractBaseGraph.DirectedSpecifics(Map<V,AbstractBaseGraph.DirectedEdgeContainer<V,E>> vertexMap) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.DirectedSpecifics.html b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.DirectedSpecifics.html new file mode 100644 index 0000000..f501815 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.DirectedSpecifics.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected AbstractBaseGraph.DirectedSpecifics |
+AbstractBaseGraph.createDirectedSpecifics() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.UndirectedSpecifics.html b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.UndirectedSpecifics.html new file mode 100644 index 0000000..80d89fb --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.UndirectedSpecifics.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected AbstractBaseGraph.UndirectedSpecifics |
+AbstractBaseGraph.createUndirectedSpecifics() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.html b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.html new file mode 100644 index 0000000..32d5ad4 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AbstractBaseGraph.html @@ -0,0 +1,353 @@ + + + + + + +| Package | +Description | +
|---|---|
| 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.dag | ++ |
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphSquare<V,E>
+DOCUMENT ME!
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+DOTImporter.read(String input,
+ AbstractBaseGraph<V,E> graph)
+Read a dot formatted string and populate the provided graph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DefaultDirectedGraph<V,E>
+A directed graph.
+ |
+
class |
+DefaultDirectedWeightedGraph<V,E>
+A directed weighted graph.
+ |
+
class |
+DirectedMultigraph<V,E>
+A directed multigraph.
+ |
+
class |
+DirectedPseudograph<V,E>
+A directed pseudograph.
+ |
+
class |
+DirectedWeightedMultigraph<V,E>
+A directed weighted multigraph.
+ |
+
class |
+DirectedWeightedPseudograph<V,E>
+A directed weighted pseudograph.
+ |
+
class |
+Multigraph<V,E>
+A multigraph.
+ |
+
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 |
+WeightedMultigraph<V,E>
+A weighted multigraph.
+ |
+
class |
+WeightedPseudograph<V,E>
+A weighted pseudograph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AbstractGraph.html b/javadoc/org/jgrapht/graph/class-use/AbstractGraph.html new file mode 100644 index 0000000..c0554ed --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AbstractGraph.html @@ -0,0 +1,501 @@ + + + + + + +| Package | +Description | +
|---|---|
| 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.dag | ++ |
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+GraphSquare<V,E>
+DOCUMENT ME!
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AbstractBaseGraph<V,E>
+The most general implementation of the
+Graph interface. |
+
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 |
+AsWeightedDirectedGraph<V,E>
+A weighted view of the backing 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 |
+MixedGraphUnion<V,E> |
+
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.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AsUndirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/AsUndirectedGraph.html new file mode 100644 index 0000000..70ce773 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AsUndirectedGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AsUnweightedDirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/AsUnweightedDirectedGraph.html new file mode 100644 index 0000000..178e0bf --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AsUnweightedDirectedGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AsUnweightedGraph.html b/javadoc/org/jgrapht/graph/class-use/AsUnweightedGraph.html new file mode 100644 index 0000000..8bfa860 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AsUnweightedGraph.html @@ -0,0 +1,162 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AsUnweightedDirectedGraph<V,E>
+An unweighted view of the backing weighted graph specified in the
+ constructor.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AsWeightedDirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/AsWeightedDirectedGraph.html new file mode 100644 index 0000000..1c70313 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AsWeightedDirectedGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/AsWeightedGraph.html b/javadoc/org/jgrapht/graph/class-use/AsWeightedGraph.html new file mode 100644 index 0000000..9a4b02c --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/AsWeightedGraph.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AsWeightedDirectedGraph<V,E>
+A weighted view of the backing graph specified in the constructor.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ClassBasedEdgeFactory.html b/javadoc/org/jgrapht/graph/class-use/ClassBasedEdgeFactory.html new file mode 100644 index 0000000..6468f72 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ClassBasedEdgeFactory.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ClassBasedVertexFactory.html b/javadoc/org/jgrapht/graph/class-use/ClassBasedVertexFactory.html new file mode 100644 index 0000000..d94340a --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ClassBasedVertexFactory.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DefaultDirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/DefaultDirectedGraph.html new file mode 100644 index 0000000..152613f --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DefaultDirectedGraph.html @@ -0,0 +1,178 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DefaultDirectedWeightedGraph<V,E>
+A directed weighted graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+DefaultDirectedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DefaultDirectedGraph<V,E>,?> |
+DefaultDirectedGraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DefaultDirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/class-use/DefaultDirectedWeightedGraph.html new file mode 100644 index 0000000..d181970 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DefaultDirectedWeightedGraph.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+DefaultDirectedWeightedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DefaultDirectedWeightedGraph<V,E>,?> |
+DefaultDirectedWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DefaultEdge.html b/javadoc/org/jgrapht/graph/class-use/DefaultEdge.html new file mode 100644 index 0000000..09e6a4d --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DefaultEdge.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DefaultWeightedEdge
+A default implementation for edges in a
+WeightedGraph. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DefaultGraphMapping.html b/javadoc/org/jgrapht/graph/class-use/DefaultGraphMapping.html new file mode 100644 index 0000000..118ae9d --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DefaultGraphMapping.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DefaultListenableGraph.html b/javadoc/org/jgrapht/graph/class-use/DefaultListenableGraph.html new file mode 100644 index 0000000..2274833 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DefaultListenableGraph.html @@ -0,0 +1,179 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DefaultWeightedEdge.html b/javadoc/org/jgrapht/graph/class-use/DefaultWeightedEdge.html new file mode 100644 index 0000000..7df39bf --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DefaultWeightedEdge.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedGraphUnion.html b/javadoc/org/jgrapht/graph/class-use/DirectedGraphUnion.html new file mode 100644 index 0000000..72e981c --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedGraphUnion.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedMaskSubgraph.html b/javadoc/org/jgrapht/graph/class-use/DirectedMaskSubgraph.html new file mode 100644 index 0000000..9d878d0 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedMaskSubgraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedMultigraph.html b/javadoc/org/jgrapht/graph/class-use/DirectedMultigraph.html new file mode 100644 index 0000000..30d1afe --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedMultigraph.html @@ -0,0 +1,178 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedWeightedMultigraph<V,E>
+A directed weighted multigraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+DirectedMultigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedMultigraph<V,E>,?> |
+DirectedMultigraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedPseudograph.html b/javadoc/org/jgrapht/graph/class-use/DirectedPseudograph.html new file mode 100644 index 0000000..0621bc1 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedPseudograph.html @@ -0,0 +1,178 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedWeightedPseudograph<V,E>
+A directed weighted pseudograph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+DirectedPseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends DirectedPseudograph<V,E>,?> |
+DirectedPseudograph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedSubgraph.html b/javadoc/org/jgrapht/graph/class-use/DirectedSubgraph.html new file mode 100644 index 0000000..0263fdb --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedSubgraph.html @@ -0,0 +1,224 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.interfaces | ++ |
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<DirectedSubgraph<V,E>> |
+GabowStrongConnectivityInspector.stronglyConnectedSubgraphs()
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
List<DirectedSubgraph<V,E>> |
+StrongConnectivityInspector.stronglyConnectedSubgraphs()
+Deprecated.
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
List<DirectedSubgraph<V,E>> |
+KosarajuStrongConnectivityInspector.stronglyConnectedSubgraphs()
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
| Modifier and Type | +Method and Description | +
|---|---|
List<DirectedSubgraph<V,E>> |
+StrongConnectivityAlgorithm.stronglyConnectedSubgraphs()
+Computes a list of
+DirectedSubgraphs of the given graph. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedWeightedSubgraph<V,E>
+A directed weighted graph that is a subgraph on other graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedWeightedMultigraph.html b/javadoc/org/jgrapht/graph/class-use/DirectedWeightedMultigraph.html new file mode 100644 index 0000000..5bae201 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedWeightedMultigraph.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+DirectedWeightedMultigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedMultigraph<V,E>,?> |
+DirectedWeightedMultigraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedWeightedPseudograph.html b/javadoc/org/jgrapht/graph/class-use/DirectedWeightedPseudograph.html new file mode 100644 index 0000000..075572d --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedWeightedPseudograph.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+DirectedWeightedPseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends DirectedWeightedPseudograph<V,E>,?> |
+DirectedWeightedPseudograph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/DirectedWeightedSubgraph.html b/javadoc/org/jgrapht/graph/class-use/DirectedWeightedSubgraph.html new file mode 100644 index 0000000..aa74a7f --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/DirectedWeightedSubgraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/EdgeReversedGraph.html b/javadoc/org/jgrapht/graph/class-use/EdgeReversedGraph.html new file mode 100644 index 0000000..adc13ae --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/EdgeReversedGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/EdgeSetFactory.html b/javadoc/org/jgrapht/graph/class-use/EdgeSetFactory.html new file mode 100644 index 0000000..8fb3b71 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/EdgeSetFactory.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+AbstractBaseGraph.setEdgeSetFactory(EdgeSetFactory<V,E> edgeSetFactory)
+Set the
+EdgeSetFactory to use for this graph. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/GraphDelegator.html b/javadoc/org/jgrapht/graph/class-use/GraphDelegator.html new file mode 100644 index 0000000..2eed832 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/GraphDelegator.html @@ -0,0 +1,251 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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 |
+AsWeightedDirectedGraph<V,E>
+A weighted view of the backing graph specified in the constructor.
+ |
+
class |
+AsWeightedGraph<V,E>
+A weighted view of the backing graph specified in the constructor.
+ |
+
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 |
+EdgeReversedGraph<V,E>
+Provides an edge-reversed view g' of a directed graph g.
+ |
+
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 |
+ParanoidGraph<V,E>
+ParanoidGraph provides a way to verify that objects added to a graph obey the
+ standard equals/hashCode contract.
+ |
+
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.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/GraphPathImpl.html b/javadoc/org/jgrapht/graph/class-use/GraphPathImpl.html new file mode 100644 index 0000000..829aac2 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/GraphPathImpl.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/GraphUnion.html b/javadoc/org/jgrapht/graph/class-use/GraphUnion.html new file mode 100644 index 0000000..70169a6 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/GraphUnion.html @@ -0,0 +1,167 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedGraphUnion<V,E> |
+
class |
+MixedGraphUnion<V,E> |
+
class |
+UndirectedGraphUnion<V,E> |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ListenableDirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/ListenableDirectedGraph.html new file mode 100644 index 0000000..c3e6fe0 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ListenableDirectedGraph.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+ListenableDirectedWeightedGraph<V,E>
+A directed weighted graph which is also
+ListenableGraph. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ListenableDirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/class-use/ListenableDirectedWeightedGraph.html new file mode 100644 index 0000000..755d46b --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ListenableDirectedWeightedGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ListenableUndirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/ListenableUndirectedGraph.html new file mode 100644 index 0000000..5ea46dd --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ListenableUndirectedGraph.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+ListenableUndirectedWeightedGraph<V,E>
+An undirected weighted graph which is also
+ListenableGraph. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ListenableUndirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/class-use/ListenableUndirectedWeightedGraph.html new file mode 100644 index 0000000..736cbe0 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ListenableUndirectedWeightedGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/MaskFunctor.html b/javadoc/org/jgrapht/graph/class-use/MaskFunctor.html new file mode 100644 index 0000000..377a790 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/MaskFunctor.html @@ -0,0 +1,168 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Constructor and Description | +
|---|
DirectedMaskSubgraph(DirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask) |
+
MaskSubgraph(Graph<V,E> base,
+ MaskFunctor<V,E> mask)
+Creates a new induced subgraph.
+ |
+
UndirectedMaskSubgraph(UndirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/MaskSubgraph.html b/javadoc/org/jgrapht/graph/class-use/MaskSubgraph.html new file mode 100644 index 0000000..8bfd4ca --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/MaskSubgraph.html @@ -0,0 +1,167 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedMaskSubgraph<V,E>
+A directed graph that is a
+MaskSubgraph on another graph. |
+
class |
+UndirectedMaskSubgraph<V,E>
+An undirected graph that is a
+MaskSubgraph on another graph. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/MixedGraphUnion.html b/javadoc/org/jgrapht/graph/class-use/MixedGraphUnion.html new file mode 100644 index 0000000..c40c3ff --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/MixedGraphUnion.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/Multigraph.html b/javadoc/org/jgrapht/graph/class-use/Multigraph.html new file mode 100644 index 0000000..b88a6ad --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/Multigraph.html @@ -0,0 +1,178 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+WeightedMultigraph<V,E>
+A weighted multigraph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+Multigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Multigraph<V,E>,?> |
+Multigraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/ParanoidGraph.html b/javadoc/org/jgrapht/graph/class-use/ParanoidGraph.html new file mode 100644 index 0000000..f404af4 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/ParanoidGraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/Pseudograph.html b/javadoc/org/jgrapht/graph/class-use/Pseudograph.html new file mode 100644 index 0000000..d022397 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/Pseudograph.html @@ -0,0 +1,178 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+WeightedPseudograph<V,E>
+A weighted pseudograph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+Pseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends Pseudograph<V,E>,?> |
+Pseudograph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/SimpleDirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/SimpleDirectedGraph.html new file mode 100644 index 0000000..b189e7d --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/SimpleDirectedGraph.html @@ -0,0 +1,230 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.experimental.dag | ++ |
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
<V,E> void |
+TransitiveClosure.closeSimpleDirectedGraph(SimpleDirectedGraph<V,E> graph)
+Computes the transitive closure of the given graph.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+SimpleDirectedWeightedGraph<V,E>
+A simple directed weighted graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+SimpleDirectedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
+SimpleDirectedGraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/SimpleDirectedWeightedGraph.html b/javadoc/org/jgrapht/graph/class-use/SimpleDirectedWeightedGraph.html new file mode 100644 index 0000000..0c2d981 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/SimpleDirectedWeightedGraph.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+SimpleDirectedWeightedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> DirectedWeightedGraphBuilderBase<V,E,? extends SimpleDirectedWeightedGraph<V,E>,?> |
+SimpleDirectedWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/SimpleGraph.html b/javadoc/org/jgrapht/graph/class-use/SimpleGraph.html new file mode 100644 index 0000000..6c99deb --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/SimpleGraph.html @@ -0,0 +1,237 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
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. |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+SimpleWeightedGraph<V,E>
+A simple weighted graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
SimpleGraph<V,E> |
+SimpleGraphPath.getGraph() |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+SimpleGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedGraphBuilderBase<V,E,? extends SimpleGraph<V,E>,?> |
+SimpleGraph.builder(EdgeFactory<V,E> ef) |
+
| Constructor and Description | +
|---|
SimpleGraphPath(SimpleGraph<V,E> simpleGraph,
+ List<V> vertices,
+ double weight) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/SimpleGraphPath.html b/javadoc/org/jgrapht/graph/class-use/SimpleGraphPath.html new file mode 100644 index 0000000..a055427 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/SimpleGraphPath.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/SimpleWeightedGraph.html b/javadoc/org/jgrapht/graph/class-use/SimpleWeightedGraph.html new file mode 100644 index 0000000..19a4abe --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/SimpleWeightedGraph.html @@ -0,0 +1,190 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> List<V> |
+HamiltonianCycle.getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)
+This method will return an approximate minimal traveling salesman tour
+ (hamiltonian cycle).
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+SimpleWeightedGraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends SimpleWeightedGraph<V,E>,?> |
+SimpleWeightedGraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/Subgraph.html b/javadoc/org/jgrapht/graph/class-use/Subgraph.html new file mode 100644 index 0000000..c66daa0 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/Subgraph.html @@ -0,0 +1,179 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+DirectedSubgraph<V,E>
+A directed graph that is a subgraph on other graph.
+ |
+
class |
+DirectedWeightedSubgraph<V,E>
+A directed weighted graph that is a subgraph on other 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.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UndirectedGraphUnion.html b/javadoc/org/jgrapht/graph/class-use/UndirectedGraphUnion.html new file mode 100644 index 0000000..b8f204a --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UndirectedGraphUnion.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UndirectedMaskSubgraph.html b/javadoc/org/jgrapht/graph/class-use/UndirectedMaskSubgraph.html new file mode 100644 index 0000000..d3a47e2 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UndirectedMaskSubgraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UndirectedSubgraph.html b/javadoc/org/jgrapht/graph/class-use/UndirectedSubgraph.html new file mode 100644 index 0000000..d544460 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UndirectedSubgraph.html @@ -0,0 +1,161 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UndirectedWeightedSubgraph<V,E>
+An undirected weighted graph that is a subgraph on other graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UndirectedWeightedSubgraph.html b/javadoc/org/jgrapht/graph/class-use/UndirectedWeightedSubgraph.html new file mode 100644 index 0000000..6b7278f --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UndirectedWeightedSubgraph.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UnmodifiableDirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/UnmodifiableDirectedGraph.html new file mode 100644 index 0000000..f7e36cb --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UnmodifiableDirectedGraph.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
UnmodifiableDirectedGraph<V,E> |
+DirectedGraphBuilderBase.buildUnmodifiable() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UnmodifiableGraph.html b/javadoc/org/jgrapht/graph/class-use/UnmodifiableGraph.html new file mode 100644 index 0000000..d6116e8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UnmodifiableGraph.html @@ -0,0 +1,193 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+UnmodifiableDirectedGraph<V,E>
+A directed graph that cannot be modified.
+ |
+
class |
+UnmodifiableUndirectedGraph<V,E>
+An undirected graph that cannot be modified.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
UnmodifiableGraph<V,E> |
+AbstractGraphBuilder.buildUnmodifiable()
+Build an unmodifiable version graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/UnmodifiableUndirectedGraph.html b/javadoc/org/jgrapht/graph/class-use/UnmodifiableUndirectedGraph.html new file mode 100644 index 0000000..2c32ab8 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/UnmodifiableUndirectedGraph.html @@ -0,0 +1,159 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
UnmodifiableUndirectedGraph<V,E> |
+UndirectedGraphBuilderBase.buildUnmodifiable() |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/WeightedMultigraph.html b/javadoc/org/jgrapht/graph/class-use/WeightedMultigraph.html new file mode 100644 index 0000000..655f679 --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/WeightedMultigraph.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+WeightedMultigraph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedMultigraph<V,E>,?> |
+WeightedMultigraph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/class-use/WeightedPseudograph.html b/javadoc/org/jgrapht/graph/class-use/WeightedPseudograph.html new file mode 100644 index 0000000..4b3cc3b --- /dev/null +++ b/javadoc/org/jgrapht/graph/class-use/WeightedPseudograph.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+WeightedPseudograph.builder(Class<? extends E> edgeClass) |
+
static <V,E> UndirectedWeightedGraphBuilderBase<V,E,? extends WeightedPseudograph<V,E>,?> |
+WeightedPseudograph.builder(EdgeFactory<V,E> ef) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/package-frame.html b/javadoc/org/jgrapht/graph/package-frame.html new file mode 100644 index 0000000..5eac32a --- /dev/null +++ b/javadoc/org/jgrapht/graph/package-frame.html @@ -0,0 +1,76 @@ + + + + + + +| Interface | +Description | +
|---|---|
| EdgeSetFactory<V,E> | +
+ A factory for edge sets.
+ |
+
| MaskFunctor<V,E> | +
+ A functor interface for masking out vertices and edges of a graph.
+ |
+
| Class | +Description | +
|---|---|
| AbstractBaseGraph<V,E> | +
+ The most general implementation of the
+Graph interface. |
+
| AbstractBaseGraph.DirectedEdgeContainer<VV,EE> | +
+ A container for vertex edges.
+ |
+
| AbstractGraph<V,E> | +
+ A skeletal implementation of the Graph interface, to minimize the
+ effort required to implement graph interfaces.
+ |
+
| AsUndirectedGraph<V,E> | +
+ An undirected view of the backing directed graph specified in the
+ constructor.
+ |
+
| AsUnweightedDirectedGraph<V,E> | +
+ An unweighted view of the backing weighted graph specified in the
+ constructor.
+ |
+
| AsUnweightedGraph<V,E> | +
+ An unweighted view of the backing weighted graph specified in the
+ constructor.
+ |
+
| AsWeightedDirectedGraph<V,E> | +
+ A weighted view of the backing graph specified in the constructor.
+ |
+
| AsWeightedGraph<V,E> | +
+ A weighted view of the backing graph specified in the constructor.
+ |
+
| ClassBasedEdgeFactory<V,E> | +
+ An
+EdgeFactory for producing edges by using a class as a factory. |
+
| ClassBasedVertexFactory<V> | +
+ A
+VertexFactory for producing vertices by using a class as a factory. |
+
| DefaultDirectedGraph<V,E> | +
+ A directed graph.
+ |
+
| DefaultDirectedWeightedGraph<V,E> | +
+ A directed weighted graph.
+ |
+
| DefaultEdge | +
+ A default implementation for edges in a
+Graph. |
+
| DefaultGraphMapping<V,E> | +
+ Implementation of the GraphMapping interface.
+ |
+
| 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. |
+
| DefaultWeightedEdge | +
+ A default implementation for edges in a
+WeightedGraph. |
+
| DirectedGraphUnion<V,E> | ++ |
| DirectedMaskSubgraph<V,E> | +
+ A directed graph that is a
+MaskSubgraph on another graph. |
+
| DirectedMultigraph<V,E> | +
+ A directed multigraph.
+ |
+
| DirectedPseudograph<V,E> | +
+ A directed pseudograph.
+ |
+
| DirectedSubgraph<V,E> | +
+ A directed graph that is a subgraph on other graph.
+ |
+
| DirectedWeightedMultigraph<V,E> | +
+ A directed weighted multigraph.
+ |
+
| DirectedWeightedPseudograph<V,E> | +
+ A directed weighted pseudograph.
+ |
+
| DirectedWeightedSubgraph<V,E> | +
+ A directed weighted graph that is a subgraph on other graph.
+ |
+
| EdgeReversedGraph<V,E> | +
+ Provides an edge-reversed view g' of a directed graph g.
+ |
+
| GraphDelegator<V,E> | +
+ A graph backed by the the graph specified at the constructor, which delegates
+ all its methods to the backing graph.
+ |
+
| GraphPathImpl<V,E> | +
+ GraphPathImpl is a default implementation of
+GraphPath. |
+
| GraphUnion<V,E,G extends Graph<V,E>> | +
+ Read-only union of two graphs: G1 and G2.
+ |
+
| ListenableDirectedGraph<V,E> | +
+ A directed graph which is also
+ListenableGraph. |
+
| ListenableDirectedWeightedGraph<V,E> | +
+ A directed weighted graph which is also
+ListenableGraph. |
+
| ListenableUndirectedGraph<V,E> | +
+ An undirected graph which is also
+ListenableGraph. |
+
| ListenableUndirectedWeightedGraph<V,E> | +
+ An undirected weighted graph which is also
+ListenableGraph. |
+
| MaskSubgraph<V,E> | +
+ An unmodifiable subgraph induced by a vertex/edge masking function.
+ |
+
| MixedGraphUnion<V,E> | ++ |
| Multigraph<V,E> | +
+ A multigraph.
+ |
+
| ParanoidGraph<V,E> | +
+ ParanoidGraph provides a way to verify that objects added to a graph obey the
+ standard equals/hashCode contract.
+ |
+
| Pseudograph<V,E> | +
+ A pseudograph.
+ |
+
| SimpleDirectedGraph<V,E> | +
+ A simple directed graph.
+ |
+
| SimpleDirectedWeightedGraph<V,E> | +
+ A simple directed weighted graph.
+ |
+
| SimpleGraph<V,E> | +
+ A simple graph.
+ |
+
| SimpleGraphPath<V,E> | +
+ A vertex-based representation of a simple path.
+ |
+
| SimpleWeightedGraph<V,E> | +
+ A simple weighted graph.
+ |
+
| 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.
+ |
+
| UndirectedGraphUnion<V,E> | ++ |
| UndirectedMaskSubgraph<V,E> | +
+ An undirected graph that is a
+MaskSubgraph on another graph. |
+
| UndirectedSubgraph<V,E> | +
+ An undirected graph that is a subgraph on other graph.
+ |
+
| UndirectedWeightedSubgraph<V,E> | +
+ An undirected weighted graph that is a subgraph on other graph.
+ |
+
| UnmodifiableDirectedGraph<V,E> | +
+ A directed graph that cannot be modified.
+ |
+
| UnmodifiableGraph<V,E> | +
+ An unmodifiable view of the backing graph specified in the constructor.
+ |
+
| UnmodifiableUndirectedGraph<V,E> | +
+ An undirected graph that cannot be modified.
+ |
+
| WeightedMultigraph<V,E> | +
+ A weighted multigraph.
+ |
+
| WeightedPseudograph<V,E> | +
+ A weighted pseudograph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/package-tree.html b/javadoc/org/jgrapht/graph/package-tree.html new file mode 100644 index 0000000..cdde94d --- /dev/null +++ b/javadoc/org/jgrapht/graph/package-tree.html @@ -0,0 +1,254 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/graph/package-use.html b/javadoc/org/jgrapht/graph/package-use.html new file mode 100644 index 0000000..ecbdcbd --- /dev/null +++ b/javadoc/org/jgrapht/graph/package-use.html @@ -0,0 +1,514 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.interfaces | ++ |
| 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.dag | ++ |
| org.jgrapht.ext | +
+
+Extensions and integration means to other products.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.graph.builder | +
+ Various builder for graphs.
+ |
+
| Class and Description | +
|---|
| AbstractBaseGraph
+ The most general implementation of the
+Graph interface. |
+
| AbstractGraph
+ A skeletal implementation of the Graph interface, to minimize the
+ effort required to implement graph interfaces.
+ |
+
| DirectedSubgraph
+ A directed graph that is a subgraph on other graph.
+ |
+
| SimpleDirectedGraph
+ A simple directed graph.
+ |
+
| SimpleGraph
+ A simple graph.
+ |
+
| SimpleWeightedGraph
+ A simple weighted graph.
+ |
+
| Class and Description | +
|---|
| DirectedSubgraph
+ A directed graph that is a subgraph on other graph.
+ |
+
| Class and Description | +
|---|
| AbstractBaseGraph
+ The most general implementation of the
+Graph interface. |
+
| AbstractGraph
+ A skeletal implementation of the Graph interface, to minimize the
+ effort required to implement graph interfaces.
+ |
+
| Class and Description | +
|---|
| AbstractBaseGraph
+ The most general implementation of the
+Graph interface. |
+
| AbstractGraph
+ A skeletal implementation of the Graph interface, to minimize the
+ effort required to implement graph interfaces.
+ |
+
| SimpleDirectedGraph
+ A simple directed graph.
+ |
+
| Class and Description | +
|---|
| AbstractBaseGraph
+ The most general implementation of the
+Graph interface. |
+
| Class and Description | +
|---|
| AbstractBaseGraph
+ The most general implementation of the
+Graph interface. |
+
| AbstractBaseGraph.DirectedEdgeContainer
+ A container for vertex edges.
+ |
+
| AbstractBaseGraph.DirectedSpecifics
+ .
+ |
+
| AbstractBaseGraph.UndirectedSpecifics
+ .
+ |
+
| AbstractGraph
+ A skeletal implementation of the Graph interface, to minimize the
+ effort required to implement graph interfaces.
+ |
+
| AsUnweightedGraph
+ An unweighted view of the backing weighted graph specified in the
+ constructor.
+ |
+
| AsWeightedGraph
+ A weighted view of the backing graph specified in the constructor.
+ |
+
| DefaultDirectedGraph
+ A directed graph.
+ |
+
| DefaultDirectedWeightedGraph
+ A directed weighted graph.
+ |
+
| DefaultEdge
+ A default implementation for edges in a
+Graph. |
+
| DefaultListenableGraph
+ A graph backed by the the graph specified at the constructor, which can be
+ listened by
+GraphListener s and by
+ VertexSetListener s. |
+
| DirectedMultigraph
+ A directed multigraph.
+ |
+
| DirectedPseudograph
+ A directed pseudograph.
+ |
+
| DirectedSubgraph
+ A directed graph that is a subgraph on other graph.
+ |
+
| DirectedWeightedMultigraph
+ A directed weighted multigraph.
+ |
+
| DirectedWeightedPseudograph
+ A directed weighted pseudograph.
+ |
+
| EdgeSetFactory
+ A factory for edge sets.
+ |
+
| GraphDelegator
+ A graph backed by the the graph specified at the constructor, which delegates
+ all its methods to the backing graph.
+ |
+
| GraphUnion
+ Read-only union of two graphs: G1 and G2.
+ |
+
| ListenableDirectedGraph
+ A directed graph which is also
+ListenableGraph. |
+
| ListenableUndirectedGraph
+ An undirected graph which is also
+ListenableGraph. |
+
| MaskFunctor
+ A functor interface for masking out vertices and edges of a graph.
+ |
+
| MaskSubgraph
+ An unmodifiable subgraph induced by a vertex/edge masking function.
+ |
+
| Multigraph
+ A multigraph.
+ |
+
| Pseudograph
+ A pseudograph.
+ |
+
| SimpleDirectedGraph
+ A simple directed graph.
+ |
+
| SimpleDirectedWeightedGraph
+ A simple directed weighted graph.
+ |
+
| SimpleGraph
+ A simple graph.
+ |
+
| SimpleWeightedGraph
+ A simple weighted graph.
+ |
+
| Subgraph
+ A subgraph is a graph that has a subset of vertices and a subset of edges
+ with respect to some base graph.
+ |
+
| UndirectedSubgraph
+ An undirected graph that is a subgraph on other graph.
+ |
+
| UnmodifiableGraph
+ An unmodifiable view of the backing graph specified in the constructor.
+ |
+
| WeightedMultigraph
+ A weighted multigraph.
+ |
+
| WeightedPseudograph
+ A weighted pseudograph.
+ |
+
| Class and Description | +
|---|
| UnmodifiableDirectedGraph
+ A directed graph that cannot be modified.
+ |
+
| UnmodifiableGraph
+ An unmodifiable view of the backing graph specified in the constructor.
+ |
+
| UnmodifiableUndirectedGraph
+ An undirected graph that cannot be modified.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/package-frame.html b/javadoc/org/jgrapht/package-frame.html new file mode 100644 index 0000000..a77191b --- /dev/null +++ b/javadoc/org/jgrapht/package-frame.html @@ -0,0 +1,33 @@ + + + + + + +| Interface | +Description | +
|---|---|
| DirectedGraph<V,E> | +
+ A graph whose all edges are directed.
+ |
+
| EdgeFactory<V,E> | +
+ An edge factory used by graphs for creating new edges.
+ |
+
| Graph<V,E> | +
+ The root interface in the graph hierarchy.
+ |
+
| GraphMapping<V,E> | +
+ GraphMapping represents a bidirectional mapping between two graphs (called
+ graph1 and graph2), which allows the caller to obtain the matching vertex or
+ edge in either direction, from graph1 to graph2, or from graph2 to graph1.
+ |
+
| GraphPath<V,E> | ++ + | +
| ListenableGraph<V,E> | +
+ A graph that supports listeners on structural change events.
+ |
+
| UndirectedGraph<V,E> | +
+ A graph whose all edges are undirected.
+ |
+
| VertexFactory<V> | +
+ A vertex factory used by graph algorithms for creating new vertices.
+ |
+
| WeightedGraph<V,E> | +
+ An interface for a graph whose edges have non-uniform weights.
+ |
+
| Class | +Description | +
|---|---|
| GraphHelper | +Deprecated
+ Use
+Graphs instead. |
+
| Graphs | +
+ A collection of utilities to assist with graph manipulation.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/package-tree.html b/javadoc/org/jgrapht/package-tree.html new file mode 100644 index 0000000..12e0a5a --- /dev/null +++ b/javadoc/org/jgrapht/package-tree.html @@ -0,0 +1,149 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/package-use.html b/javadoc/org/jgrapht/package-use.html new file mode 100644 index 0000000..7495536 --- /dev/null +++ b/javadoc/org/jgrapht/package-use.html @@ -0,0 +1,657 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| org.jgrapht.alg.flow | ++ |
| org.jgrapht.alg.interfaces | ++ |
| org.jgrapht.alg.isomorphism | ++ |
| org.jgrapht.alg.util | +
+ Utilities used by JGraphT algorithms.
+ |
+
| 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.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.graph.builder | +
+ Various builder for graphs.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| EdgeFactory
+ An edge factory used by graphs for creating new edges.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| GraphPath + + | +
| Graphs
+ A collection of utilities to assist with graph manipulation.
+ |
+
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| GraphPath + + | +
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| WeightedGraph
+ An interface for a graph whose edges have non-uniform weights.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| Class and Description | +
|---|
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| GraphMapping
+ GraphMapping represents a bidirectional mapping between two graphs (called
+ graph1 and graph2), which allows the caller to obtain the matching vertex or
+ edge in either direction, from graph1 to graph2, or from graph2 to graph1.
+ |
+
| Class and Description | +
|---|
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| Class and Description | +
|---|
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| VertexFactory
+ A vertex factory used by graph algorithms for creating new vertices.
+ |
+
| Class and Description | +
|---|
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| Class and Description | +
|---|
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| EdgeFactory
+ An edge factory used by graphs for creating new edges.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| ListenableGraph
+ A graph that supports listeners on structural change events.
+ |
+
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| Class and Description | +
|---|
| EdgeFactory
+ An edge factory used by graphs for creating new edges.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| VertexFactory
+ A vertex factory used by graph algorithms for creating new vertices.
+ |
+
| WeightedGraph
+ An interface for a graph whose edges have non-uniform weights.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| EdgeFactory
+ An edge factory used by graphs for creating new edges.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| GraphMapping
+ GraphMapping represents a bidirectional mapping between two graphs (called
+ graph1 and graph2), which allows the caller to obtain the matching vertex or
+ edge in either direction, from graph1 to graph2, or from graph2 to graph1.
+ |
+
| GraphPath + + | +
| ListenableGraph
+ A graph that supports listeners on structural change events.
+ |
+
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| VertexFactory
+ A vertex factory used by graph algorithms for creating new vertices.
+ |
+
| WeightedGraph
+ An interface for a graph whose edges have non-uniform weights.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
| UndirectedGraph
+ A graph whose all edges are undirected.
+ |
+
| WeightedGraph
+ An interface for a graph whose edges have non-uniform weights.
+ |
+
| Class and Description | +
|---|
| DirectedGraph
+ A graph whose all edges are directed.
+ |
+
| Graph
+ The root interface in the graph hierarchy.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/AbstractGraphIterator.html b/javadoc/org/jgrapht/traverse/AbstractGraphIterator.html new file mode 100644 index 0000000..981be9d --- /dev/null +++ b/javadoc/org/jgrapht/traverse/AbstractGraphIterator.html @@ -0,0 +1,549 @@ + + + + + + +public abstract class AbstractGraphIterator<V,E> +extends Object +implements GraphIterator<V,E>+
| Modifier and Type | +Field and Description | +
|---|---|
protected int |
+nListeners |
+
| Constructor and Description | +
|---|
AbstractGraphIterator() |
+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+addTraversalListener(TraversalListener<V,E> l)
+Adds the specified traversal listener to this iterator.
+ |
+
protected void |
+fireConnectedComponentFinished(ConnectedComponentTraversalEvent e)
+Informs all listeners that the traversal of the current connected
+ component finished.
+ |
+
protected void |
+fireConnectedComponentStarted(ConnectedComponentTraversalEvent e)
+Informs all listeners that a traversal of a new connected component has
+ started.
+ |
+
protected void |
+fireEdgeTraversed(EdgeTraversalEvent<V,E> e)
+Informs all listeners that a the specified edge was visited.
+ |
+
protected void |
+fireVertexFinished(VertexTraversalEvent<V> e)
+Informs all listeners that a the specified vertex was finished.
+ |
+
protected void |
+fireVertexTraversed(VertexTraversalEvent<V> e)
+Informs all listeners that a the specified vertex was visited.
+ |
+
boolean |
+isCrossComponentTraversal()
+Test whether this iterator is set to traverse the graph across connected
+ components.
+ |
+
boolean |
+isReuseEvents()
+Tests whether the
+reuseEvents flag is set. |
+
void |
+remove()
+Unsupported.
+ |
+
void |
+removeTraversalListener(TraversalListener<V,E> l)
+Removes the specified traversal listener from this iterator.
+ |
+
void |
+setCrossComponentTraversal(boolean crossComponentTraversal)
+Sets the cross component traversal flag - indicates whether to traverse
+ the graph across connected components.
+ |
+
void |
+setReuseEvents(boolean reuseEvents)
+Sets a value the
+reuseEvents flag. |
+
public void setCrossComponentTraversal(boolean crossComponentTraversal)+
crossComponentTraversal - if true traverses across
+ connected components.public boolean isCrossComponentTraversal()+
isCrossComponentTraversal in interface GraphIterator<V,E>true if traverses across connected components,
+ otherwise false.public void setReuseEvents(boolean reuseEvents)+
GraphIteratorreuseEvents flag. 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.
+ This option increases performance but should be used with care,
+ especially in multithreaded environment.setReuseEvents in interface GraphIterator<V,E>reuseEvents - whether to reuse previously fired event objects
+ instead of creating a new event object for each event.GraphIterator.setReuseEvents(boolean)public boolean isReuseEvents()+
GraphIteratorreuseEvents flag is set. If the flag is
+ set to true this class will reuse previously fired events
+ and will not create a new object for each event. This option increases
+ performance but should be used with care, especially in multithreaded
+ environment.isReuseEvents in interface GraphIterator<V,E>reuseEvents flag.GraphIterator.isReuseEvents()public void addTraversalListener(TraversalListener<V,E> l)+
addTraversalListener in interface GraphIterator<V,E>l - the traversal listener to be added.public void remove()+
remove in interface Iterator<V>remove in interface GraphIterator<V,E>UnsupportedOperationExceptionpublic void removeTraversalListener(TraversalListener<V,E> l)+
removeTraversalListener in interface GraphIterator<V,E>l - the traversal listener to be removed.protected void fireConnectedComponentFinished(ConnectedComponentTraversalEvent e)+
e - the connected component finished event.protected void fireConnectedComponentStarted(ConnectedComponentTraversalEvent e)+
e - the connected component started event.protected void fireEdgeTraversed(EdgeTraversalEvent<V,E> e)+
e - the edge traversal event.protected void fireVertexTraversed(VertexTraversalEvent<V> e)+
e - the vertex traversal event.protected void fireVertexFinished(VertexTraversalEvent<V> e)+
e - the vertex traversal event.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html b/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html new file mode 100644 index 0000000..ead5d9a --- /dev/null +++ b/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html @@ -0,0 +1,438 @@ + + + + + + +public class BreadthFirstIterator<V,E> +extends CrossComponentIterator<V,E,Object>+
CrossComponentIterator.VisitColornListeners| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+encounterVertex(V vertex,
+ E edge)
+Update data structures the first time we see a vertex.
+ |
+
protected void |
+encounterVertexAgain(V vertex,
+ E edge)
+Called whenever we re-encounter a vertex.
+ |
+
protected boolean |
+isConnectedComponentExhausted()
+Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+ |
+
protected V |
+provideNextVertex()
+Returns the vertex to be returned in the following call to the iterator
+
+next method. |
+
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenDataaddTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEventspublic BreadthFirstIterator(Graph<V,E> g)+
g - the graph to be iterated.public BreadthFirstIterator(Graph<V,E> g, + V startVertex)+
null, iteration will start at an arbitrary vertex
+ and will not be limited, that is, will be able to traverse all the graph.g - the graph to be iterated.startVertex - the vertex iteration to be started.protected boolean isConnectedComponentExhausted()+
CrossComponentIteratorisConnectedComponentExhausted in class CrossComponentIterator<V,E,Object>CrossComponentIterator.isConnectedComponentExhausted()protected void encounterVertex(V vertex, + E edge)+
CrossComponentIteratorencounterVertex in class CrossComponentIterator<V,E,Object>vertex - the vertex encounterededge - the edge via which the vertex was encountered, or null if the
+ vertex is a starting pointCrossComponentIterator.encounterVertex(Object, Object)protected void encounterVertexAgain(V vertex, + E edge)+
CrossComponentIteratorencounterVertexAgain in class CrossComponentIterator<V,E,Object>vertex - the vertex re-encounterededge - the edge via which the vertex was re-encounteredCrossComponentIterator.encounterVertexAgain(Object, Object)protected V provideNextVertex()+
CrossComponentIteratornext method.provideNextVertex in class CrossComponentIterator<V,E,Object>CrossComponentIterator.provideNextVertex()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html b/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html new file mode 100644 index 0000000..168ee4a --- /dev/null +++ b/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html @@ -0,0 +1,544 @@ + + + + + + +public class ClosestFirstIterator<V,E> +extends CrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>+
The metric for closest here is the weighted path length from a + start vertex, i.e. Graph.getEdgeWeight(Edge) is summed to calculate path + length. Negative edge weights will result in an IllegalArgumentException. + Optionally, path length may be bounded by a finite radius.
CrossComponentIterator.VisitColornListeners| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+encounterVertex(V vertex,
+ E edge)
+Update data structures the first time we see a vertex.
+ |
+
protected void |
+encounterVertexAgain(V vertex,
+ E edge)
+Override superclass.
+ |
+
double |
+getShortestPathLength(V vertex)
+Get the weighted length of the shortest path known to the given vertex.
+ |
+
E |
+getSpanningTreeEdge(V vertex)
+Get the spanning tree edge reaching a vertex which has been seen already
+ in this traversal.
+ |
+
protected boolean |
+isConnectedComponentExhausted()
+Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+ |
+
protected V |
+provideNextVertex()
+Returns the vertex to be returned in the following call to the iterator
+
+next method. |
+
void |
+setCrossComponentTraversal(boolean crossComponentTraversal)
+Sets the cross component traversal flag - indicates whether to traverse
+ the graph across connected components.
+ |
+
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenDataaddTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setReuseEventspublic ClosestFirstIterator(Graph<V,E> g)+
g - the graph to be iterated.public ClosestFirstIterator(Graph<V,E> g, + V startVertex)+
null, iteration will start at an arbitrary vertex
+ and will not be limited, that is, will be able to traverse all the graph.g - the graph to be iterated.startVertex - the vertex iteration to be started.public ClosestFirstIterator(Graph<V,E> g, + V startVertex, + double radius)+
+ null.g - the graph to be iterated.startVertex - the vertex iteration to be started.radius - limit on weighted path length, or Double.POSITIVE_INFINITY
+ for unbounded search.public void setCrossComponentTraversal(boolean crossComponentTraversal)+
AbstractGraphIteratorsetCrossComponentTraversal in class AbstractGraphIterator<V,E>crossComponentTraversal - if true traverses across
+ connected components.public double getShortestPathLength(V vertex)+
vertex - vertex being sought from start vertexpublic E getSpanningTreeEdge(V vertex)+
vertex - the spanned vertex.protected boolean isConnectedComponentExhausted()+
CrossComponentIteratorisConnectedComponentExhausted in class CrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>CrossComponentIterator.isConnectedComponentExhausted()protected void encounterVertex(V vertex, + E edge)+
CrossComponentIteratorencounterVertex in class CrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>vertex - the vertex encounterededge - the edge via which the vertex was encountered, or null if the
+ vertex is a starting pointCrossComponentIterator.encounterVertex(Object, Object)protected void encounterVertexAgain(V vertex, + E edge)+
encounterVertexAgain in class CrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>vertex - the vertex re-encounterededge - the edge via which the vertex was re-encounteredprotected V provideNextVertex()+
CrossComponentIteratornext method.provideNextVertex in class CrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>CrossComponentIterator.provideNextVertex()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/CrossComponentIterator.VisitColor.html b/javadoc/org/jgrapht/traverse/CrossComponentIterator.VisitColor.html new file mode 100644 index 0000000..582bc3a --- /dev/null +++ b/javadoc/org/jgrapht/traverse/CrossComponentIterator.VisitColor.html @@ -0,0 +1,351 @@ + + + + + + +protected static enum CrossComponentIterator.VisitColor +extends Enum<CrossComponentIterator.VisitColor>+
| Enum Constant and Description | +
|---|
BLACK
+Vertex has been returned via iterator, and we're done with all of its
+ out-edges.
+ |
+
GRAY
+Vertex has been returned via iterator, but we're not done with all of
+ its out-edges yet.
+ |
+
WHITE
+Vertex has not been returned via iterator yet.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static CrossComponentIterator.VisitColor |
+valueOf(String name)
+Returns the enum constant of this type with the specified name.
+ |
+
static CrossComponentIterator.VisitColor[] |
+values()
+Returns an array containing the constants of this enum type, in
+the order they are declared.
+ |
+
public static final CrossComponentIterator.VisitColor WHITE+
public static final CrossComponentIterator.VisitColor GRAY+
public static final CrossComponentIterator.VisitColor BLACK+
public static CrossComponentIterator.VisitColor[] values()+
+for (CrossComponentIterator.VisitColor c : CrossComponentIterator.VisitColor.values()) + System.out.println(c); +
public static CrossComponentIterator.VisitColor valueOf(String name)+
name - the name of the enum constant to be returned.IllegalArgumentException - if this enum type has no constant with the specified nameNullPointerException - if the argument is nullCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/CrossComponentIterator.html b/javadoc/org/jgrapht/traverse/CrossComponentIterator.html new file mode 100644 index 0000000..8b832cf --- /dev/null +++ b/javadoc/org/jgrapht/traverse/CrossComponentIterator.html @@ -0,0 +1,533 @@ + + + + + + +V - vertex typeE - edge typeD - type of data associated to seen verticespublic abstract class CrossComponentIterator<V,E,D> +extends AbstractGraphIterator<V,E>+
| Modifier and Type | +Class and Description | +
|---|---|
protected static class |
+CrossComponentIterator.VisitColor
+Standard vertex visit state enumeration.
+ |
+
nListeners| Constructor and Description | +
|---|
CrossComponentIterator(Graph<V,E> g,
+ V startVertex)
+Creates a new iterator for the specified graph.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected abstract void |
+encounterVertex(V vertex,
+ E edge)
+Update data structures the first time we see a vertex.
+ |
+
protected abstract void |
+encounterVertexAgain(V vertex,
+ E edge)
+Called whenever we re-encounter a vertex.
+ |
+
protected void |
+finishVertex(V vertex)
+Called when a vertex has been finished (meaning is dependent on traversal
+ represented by subclass).
+ |
+
Graph<V,E> |
+getGraph() |
+
protected D |
+getSeenData(V vertex)
+Access the data stored for a seen vertex.
+ |
+
boolean |
+hasNext() |
+
protected abstract boolean |
+isConnectedComponentExhausted()
+Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+ |
+
protected boolean |
+isSeenVertex(Object vertex)
+Determines whether a vertex has been seen yet by this traversal.
+ |
+
V |
+next() |
+
protected abstract V |
+provideNextVertex()
+Returns the vertex to be returned in the following call to the iterator
+
+next method. |
+
protected D |
+putSeenData(V vertex,
+ D data)
+Stores iterator-dependent data for a vertex that has been seen.
+ |
+
addTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEventspublic CrossComponentIterator(Graph<V,E> g, + V startVertex)+
+ null, Iteration will start at an arbitrary graph vertex.g - the graph to be iterated.startVertex - the vertex iteration to be started.IllegalArgumentException - if g==null or does not
+ contain startVertexpublic boolean hasNext()+
Iterator.hasNext()public V next()+
Iterator.next()protected abstract boolean isConnectedComponentExhausted()+
protected abstract void encounterVertex(V vertex, + E edge)+
vertex - the vertex encounterededge - the edge via which the vertex was encountered, or null if the
+ vertex is a starting pointprotected abstract V provideNextVertex()+
next method.protected D getSeenData(V vertex)+
vertex - a vertex which has already been seen.null if no
+ data was associated with the vertex. A null return can also
+ indicate that the vertex was explicitly associated with
+ null.protected boolean isSeenVertex(Object vertex)+
vertex - vertex in questionprotected abstract void encounterVertexAgain(V vertex, + E edge)+
vertex - the vertex re-encounterededge - the edge via which the vertex was re-encounteredprotected D putSeenData(V vertex, + D data)+
vertex - a vertex which has been seen.data - data to be associated with the seen vertex.
+ null if no data was associated with the vertex. A
+ null return can also indicate that the vertex was explicitly
+ associated with null.protected void finishVertex(V vertex)+
vertex - vertex which has been finishedCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/DepthFirstIterator.html b/javadoc/org/jgrapht/traverse/DepthFirstIterator.html new file mode 100644 index 0000000..454d9bc --- /dev/null +++ b/javadoc/org/jgrapht/traverse/DepthFirstIterator.html @@ -0,0 +1,493 @@ + + + + + + +public class DepthFirstIterator<V,E> +extends CrossComponentIterator<V,E,CrossComponentIterator.VisitColor>+
CrossComponentIterator.VisitColor| Modifier and Type | +Field and Description | +
|---|---|
static Object |
+SENTINEL
+Sentinel object.
+ |
+
nListeners| Constructor and Description | +
|---|
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.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+encounterVertex(V vertex,
+ E edge)
+Update data structures the first time we see a vertex.
+ |
+
protected void |
+encounterVertexAgain(V vertex,
+ E edge)
+Called whenever we re-encounter a vertex.
+ |
+
Deque<Object> |
+getStack()
+Retrieves the LIFO stack of vertices which have been encountered but not
+ yet visited (WHITE).
+ |
+
protected boolean |
+isConnectedComponentExhausted()
+Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+ |
+
protected V |
+provideNextVertex()
+Returns the vertex to be returned in the following call to the iterator
+
+next method. |
+
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenDataaddTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEventspublic static final Object SENTINEL+
public DepthFirstIterator(Graph<V,E> g)+
g - the graph to be iterated.public DepthFirstIterator(Graph<V,E> g, + V startVertex)+
null, iteration will start at an arbitrary vertex
+ and will not be limited, that is, will be able to traverse all the graph.g - the graph to be iterated.startVertex - the vertex iteration to be started.protected boolean isConnectedComponentExhausted()+
CrossComponentIteratorisConnectedComponentExhausted in class CrossComponentIterator<V,E,CrossComponentIterator.VisitColor>CrossComponentIterator.isConnectedComponentExhausted()protected void encounterVertex(V vertex, + E edge)+
CrossComponentIteratorencounterVertex in class CrossComponentIterator<V,E,CrossComponentIterator.VisitColor>vertex - the vertex encounterededge - the edge via which the vertex was encountered, or null if the
+ vertex is a starting pointCrossComponentIterator.encounterVertex(Object, Object)protected void encounterVertexAgain(V vertex, + E edge)+
CrossComponentIteratorencounterVertexAgain in class CrossComponentIterator<V,E,CrossComponentIterator.VisitColor>vertex - the vertex re-encounterededge - the edge via which the vertex was re-encounteredCrossComponentIterator.encounterVertexAgain(Object, Object)protected V provideNextVertex()+
CrossComponentIteratornext method.provideNextVertex in class CrossComponentIterator<V,E,CrossComponentIterator.VisitColor>CrossComponentIterator.provideNextVertex()public Deque<Object> getStack()+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/GraphIterator.html b/javadoc/org/jgrapht/traverse/GraphIterator.html new file mode 100644 index 0000000..b124ec9 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/GraphIterator.html @@ -0,0 +1,334 @@ + + + + + + +public interface GraphIterator<V,E> +extends Iterator<V>+
| Modifier and Type | +Method and Description | +
|---|---|
void |
+addTraversalListener(TraversalListener<V,E> l)
+Adds the specified traversal listener to this iterator.
+ |
+
boolean |
+isCrossComponentTraversal()
+Test whether this iterator is set to traverse the grpah across connected
+ components.
+ |
+
boolean |
+isReuseEvents()
+Tests whether the
+reuseEvents flag is set. |
+
void |
+remove()
+Unsupported.
+ |
+
void |
+removeTraversalListener(TraversalListener<V,E> l)
+Removes the specified traversal listener from this iterator.
+ |
+
void |
+setReuseEvents(boolean reuseEvents)
+Sets a value the
+reuseEvents flag. |
+
boolean isCrossComponentTraversal()+
true if traverses across connected components,
+ otherwise false.void setReuseEvents(boolean reuseEvents)+
reuseEvents flag. 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.
+ This option increases performance but should be used with care,
+ especially in multithreaded environment.reuseEvents - whether to reuse previously fired event objects
+ instead of creating a new event object for each event.boolean isReuseEvents()+
reuseEvents flag is set. If the flag is
+ set to true this class will reuse previously fired events
+ and will not create a new object for each event. This option increases
+ performance but should be used with care, especially in multithreaded
+ environment.reuseEvents flag.void addTraversalListener(TraversalListener<V,E> l)+
l - the traversal listener to be added.void remove()+
remove in interface Iterator<V>UnsupportedOperationExceptionvoid removeTraversalListener(TraversalListener<V,E> l)+
l - the traversal listener to be removed.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/TopologicalOrderIterator.html b/javadoc/org/jgrapht/traverse/TopologicalOrderIterator.html new file mode 100644 index 0000000..badd29b --- /dev/null +++ b/javadoc/org/jgrapht/traverse/TopologicalOrderIterator.html @@ -0,0 +1,462 @@ + + + + + + +public class TopologicalOrderIterator<V,E> +extends CrossComponentIterator<V,E,Object>+
See "Algorithms in Java, Third Edition, Part 5: Graph Algorithms" by + Robert Sedgewick and "Data Structures and Algorithms with Object-Oriented + Design Patterns in Java" by Bruno R. Preiss for implementation alternatives. + The latter can be found online at + http://www.brpreiss.com/books/opus5/
+ +For this iterator to work correctly the graph must be acyclic, and must
+ not be modified during iteration. Currently there are no means to ensure
+ that, nor to fail-fast; the results with cyclic input (including self-loops)
+ or concurrent modifications are undefined. To precheck a graph for cycles,
+ consider using CycleDetector or KosarajuStrongConnectivityInspector.
CrossComponentIterator.VisitColornListeners| Constructor and Description | +
|---|
TopologicalOrderIterator(DirectedGraph<V,E> dg)
+Creates a new topological order iterator over the directed graph
+ specified, with arbitrary tie-breaking in case of partial order.
+ |
+
TopologicalOrderIterator(DirectedGraph<V,E> dg,
+ Queue<V> queue)
+Creates a new topological order iterator over the directed graph
+ specified, with a user-supplied queue implementation to allow customized
+ control over tie-breaking in case of partial order.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+encounterVertex(V vertex,
+ E edge)
+Update data structures the first time we see a vertex.
+ |
+
protected void |
+encounterVertexAgain(V vertex,
+ E edge)
+Called whenever we re-encounter a vertex.
+ |
+
protected boolean |
+isConnectedComponentExhausted()
+Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+ |
+
protected V |
+provideNextVertex()
+Returns the vertex to be returned in the following call to the iterator
+
+next method. |
+
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenDataaddTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEventspublic TopologicalOrderIterator(DirectedGraph<V,E> dg)+
dg - the directed graph to be iterated.public TopologicalOrderIterator(DirectedGraph<V,E> dg, + Queue<V> queue)+
dg - the directed graph to be iterated.queue - queue to use for tie-break in case of partial order (e.g. a
+ PriorityQueue can be used to break ties according to vertex priority);
+ must be initially emptyprotected boolean isConnectedComponentExhausted()+
CrossComponentIteratorisConnectedComponentExhausted in class CrossComponentIterator<V,E,Object>CrossComponentIterator.isConnectedComponentExhausted()protected void encounterVertex(V vertex, + E edge)+
CrossComponentIteratorencounterVertex in class CrossComponentIterator<V,E,Object>vertex - the vertex encounterededge - the edge via which the vertex was encountered, or null if the
+ vertex is a starting pointCrossComponentIterator.encounterVertex(Object, Object)protected void encounterVertexAgain(V vertex, + E edge)+
CrossComponentIteratorencounterVertexAgain in class CrossComponentIterator<V,E,Object>vertex - the vertex re-encounterededge - the edge via which the vertex was re-encounteredCrossComponentIterator.encounterVertexAgain(Object, Object)protected V provideNextVertex()+
CrossComponentIteratornext method.provideNextVertex in class CrossComponentIterator<V,E,Object>CrossComponentIterator.provideNextVertex()Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/AbstractGraphIterator.html b/javadoc/org/jgrapht/traverse/class-use/AbstractGraphIterator.html new file mode 100644 index 0000000..7fa77f5 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/AbstractGraphIterator.html @@ -0,0 +1,186 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+BreadthFirstIterator<V,E>
+A breadth-first iterator for a directed and an undirected graph.
+ |
+
class |
+ClosestFirstIterator<V,E>
+A closest-first iterator for a directed or undirected graph.
+ |
+
class |
+CrossComponentIterator<V,E,D>
+Provides a cross-connected-component traversal functionality for iterator
+ subclasses.
+ |
+
class |
+DepthFirstIterator<V,E>
+A depth-first iterator for a directed and an undirected graph.
+ |
+
class |
+TopologicalOrderIterator<V,E>
+Implements topological order traversal for a directed acyclic graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/BreadthFirstIterator.html b/javadoc/org/jgrapht/traverse/class-use/BreadthFirstIterator.html new file mode 100644 index 0000000..ebcf262 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/BreadthFirstIterator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/ClosestFirstIterator.html b/javadoc/org/jgrapht/traverse/class-use/ClosestFirstIterator.html new file mode 100644 index 0000000..726c07d --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/ClosestFirstIterator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/CrossComponentIterator.VisitColor.html b/javadoc/org/jgrapht/traverse/class-use/CrossComponentIterator.VisitColor.html new file mode 100644 index 0000000..0d29341 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/CrossComponentIterator.VisitColor.html @@ -0,0 +1,168 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static CrossComponentIterator.VisitColor |
+CrossComponentIterator.VisitColor.valueOf(String name)
+Returns the enum constant of this type with the specified name.
+ |
+
static CrossComponentIterator.VisitColor[] |
+CrossComponentIterator.VisitColor.values()
+Returns an array containing the constants of this enum type, in
+the order they are declared.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/CrossComponentIterator.html b/javadoc/org/jgrapht/traverse/class-use/CrossComponentIterator.html new file mode 100644 index 0000000..c27abd4 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/CrossComponentIterator.html @@ -0,0 +1,179 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+BreadthFirstIterator<V,E>
+A breadth-first iterator for a directed and an undirected graph.
+ |
+
class |
+ClosestFirstIterator<V,E>
+A closest-first iterator for a directed or undirected graph.
+ |
+
class |
+DepthFirstIterator<V,E>
+A depth-first iterator for a directed and an undirected graph.
+ |
+
class |
+TopologicalOrderIterator<V,E>
+Implements topological order traversal for a directed acyclic graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/DepthFirstIterator.html b/javadoc/org/jgrapht/traverse/class-use/DepthFirstIterator.html new file mode 100644 index 0000000..2ed1dc9 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/DepthFirstIterator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/GraphIterator.html b/javadoc/org/jgrapht/traverse/class-use/GraphIterator.html new file mode 100644 index 0000000..545f826 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/GraphIterator.html @@ -0,0 +1,193 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Modifier and Type | +Class and Description | +
|---|---|
class |
+AbstractGraphIterator<V,E>
+An empty implementation of a graph iterator to minimize the effort required
+ to implement graph iterators.
+ |
+
class |
+BreadthFirstIterator<V,E>
+A breadth-first iterator for a directed and an undirected graph.
+ |
+
class |
+ClosestFirstIterator<V,E>
+A closest-first iterator for a directed or undirected graph.
+ |
+
class |
+CrossComponentIterator<V,E,D>
+Provides a cross-connected-component traversal functionality for iterator
+ subclasses.
+ |
+
class |
+DepthFirstIterator<V,E>
+A depth-first iterator for a directed and an undirected graph.
+ |
+
class |
+TopologicalOrderIterator<V,E>
+Implements topological order traversal for a directed acyclic graph.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/class-use/TopologicalOrderIterator.html b/javadoc/org/jgrapht/traverse/class-use/TopologicalOrderIterator.html new file mode 100644 index 0000000..4581ddd --- /dev/null +++ b/javadoc/org/jgrapht/traverse/class-use/TopologicalOrderIterator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/package-frame.html b/javadoc/org/jgrapht/traverse/package-frame.html new file mode 100644 index 0000000..03e589b --- /dev/null +++ b/javadoc/org/jgrapht/traverse/package-frame.html @@ -0,0 +1,33 @@ + + + + + + +| Interface | +Description | +
|---|---|
| GraphIterator<V,E> | +
+ A graph iterator.
+ |
+
| Class | +Description | +
|---|---|
| AbstractGraphIterator<V,E> | +
+ An empty implementation of a graph iterator to minimize the effort required
+ to implement graph iterators.
+ |
+
| BreadthFirstIterator<V,E> | +
+ A breadth-first iterator for a directed and an undirected graph.
+ |
+
| ClosestFirstIterator<V,E> | +
+ A closest-first iterator for a directed or undirected graph.
+ |
+
| CrossComponentIterator<V,E,D> | +
+ Provides a cross-connected-component traversal functionality for iterator
+ subclasses.
+ |
+
| DepthFirstIterator<V,E> | +
+ A depth-first iterator for a directed and an undirected graph.
+ |
+
| TopologicalOrderIterator<V,E> | +
+ Implements topological order traversal for a directed acyclic graph.
+ |
+
| Enum | +Description | +
|---|---|
| CrossComponentIterator.VisitColor | +
+ Standard vertex visit state enumeration.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/package-tree.html b/javadoc/org/jgrapht/traverse/package-tree.html new file mode 100644 index 0000000..ecbdd5b --- /dev/null +++ b/javadoc/org/jgrapht/traverse/package-tree.html @@ -0,0 +1,161 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/traverse/package-use.html b/javadoc/org/jgrapht/traverse/package-use.html new file mode 100644 index 0000000..16583a3 --- /dev/null +++ b/javadoc/org/jgrapht/traverse/package-use.html @@ -0,0 +1,171 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| Class and Description | +
|---|
| AbstractGraphIterator
+ An empty implementation of a graph iterator to minimize the effort required
+ to implement graph iterators.
+ |
+
| CrossComponentIterator
+ Provides a cross-connected-component traversal functionality for iterator
+ subclasses.
+ |
+
| CrossComponentIterator.VisitColor
+ Standard vertex visit state enumeration.
+ |
+
| GraphIterator
+ A graph iterator.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/ArrayUnenforcedSet.html b/javadoc/org/jgrapht/util/ArrayUnenforcedSet.html new file mode 100644 index 0000000..788bc7b --- /dev/null +++ b/javadoc/org/jgrapht/util/ArrayUnenforcedSet.html @@ -0,0 +1,388 @@ + + + + + + +public class ArrayUnenforcedSet<E> +extends ArrayList<E> +implements Set<E>+
Note that for equals/hashCode, the class implements the Set behavior + (unordered), not the list behavior (ordered); the fact that it subclasses + ArrayList should be considered an implementation detail.
modCount| Constructor and Description | +
|---|
ArrayUnenforcedSet() |
+
ArrayUnenforcedSet(Collection<? extends E> c) |
+
ArrayUnenforcedSet(int n) |
+
| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+equals(Object o) |
+
int |
+hashCode() |
+
add, add, addAll, addAll, clear, clone, contains, ensureCapacity, get, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeRange, retainAll, set, size, subList, toArray, toArray, trimToSizecontainsAll, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitadd, addAll, clear, contains, containsAll, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArraycontainsAllpublic ArrayUnenforcedSet()+
public ArrayUnenforcedSet(Collection<? extends E> c)+
public ArrayUnenforcedSet(int n)+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/FibonacciHeap.html b/javadoc/org/jgrapht/util/FibonacciHeap.html new file mode 100644 index 0000000..39a409f --- /dev/null +++ b/javadoc/org/jgrapht/util/FibonacciHeap.html @@ -0,0 +1,555 @@ + + + + + + +public class FibonacciHeap<T> +extends Object+
delete() operation may fail to
+ remove the correct element.
+
+ Note that this implementation is not synchronized. If multiple + threads access a set concurrently, and at least one of the threads modifies + the set, it must be synchronized externally. This is typically + accomplished by synchronizing on some object that naturally encapsulates the + set.
+ +This class was originally developed by Nathan Fiedler for the GraphMaker + project. It was imported to JGraphT with permission, courtesy of Nathan + Fiedler.
| Constructor and Description | +
|---|
FibonacciHeap()
+Constructs a FibonacciHeap object that contains no elements.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+cascadingCut(FibonacciHeapNode<T> y)
+Performs a cascading cut operation.
+ |
+
void |
+clear()
+Removes all elements from this heap.
+ |
+
protected void |
+consolidate() |
+
protected void |
+cut(FibonacciHeapNode<T> x,
+ FibonacciHeapNode<T> y)
+The reverse of the link operation: removes x from the child list of y.
+ |
+
void |
+decreaseKey(FibonacciHeapNode<T> x,
+ double k)
+Decreases the key value for a heap node, given the new value to take on.
+ |
+
void |
+delete(FibonacciHeapNode<T> x)
+Deletes a node from the heap given the reference to the node.
+ |
+
void |
+insert(FibonacciHeapNode<T> node,
+ double key)
+Inserts a new data element into the heap.
+ |
+
boolean |
+isEmpty()
+Tests if the Fibonacci heap is empty or not.
+ |
+
protected void |
+link(FibonacciHeapNode<T> y,
+ FibonacciHeapNode<T> x)
+Make node y a child of node x.
+ |
+
FibonacciHeapNode<T> |
+min()
+Returns the smallest element in the heap.
+ |
+
FibonacciHeapNode<T> |
+removeMin()
+Removes the smallest element from the heap.
+ |
+
int |
+size()
+Returns the size of the heap which is measured in the number of elements
+ contained in the heap.
+ |
+
String |
+toString()
+Creates a String representation of this Fibonacci heap.
+ |
+
static <T> FibonacciHeap<T> |
+union(FibonacciHeap<T> h1,
+ FibonacciHeap<T> h2)
+Joins two Fibonacci heaps into a new one.
+ |
+
public FibonacciHeap()+
public boolean isEmpty()+
Running time: O(1) actual
public void clear()+
public void decreaseKey(FibonacciHeapNode<T> x, + double k)+
Running time: O(1) amortized
x - node to decrease the key ofk - new key value for node xIllegalArgumentException - Thrown if k is larger than x.key
+ value.public void delete(FibonacciHeapNode<T> x)+
Running time: O(log n) amortized
x - node to remove from heappublic void insert(FibonacciHeapNode<T> node, + double key)+
Running time: O(1) actual
node - new node to insert into heapkey - key value associated with data objectpublic FibonacciHeapNode<T> min()+
Running time: O(1) actual
public FibonacciHeapNode<T> removeMin()+
Running time: O(log n) amortized
public int size()+
Running time: O(1) actual
public static <T> FibonacciHeap<T> union(FibonacciHeap<T> h1, + FibonacciHeap<T> h2)+
Running time: O(1) actual
h1 - first heaph2 - second heappublic String toString()+
protected void cascadingCut(FibonacciHeapNode<T> y)+
Running time: O(log n); O(1) excluding the recursion
y - node to perform cascading cut onprotected void consolidate()+
protected void cut(FibonacciHeapNode<T> x, + FibonacciHeapNode<T> y)+
Running time: O(1)
x - child of y to be removed from y's child listy - parent of x about to lose a childprotected void link(FibonacciHeapNode<T> y, + FibonacciHeapNode<T> x)+
Running time: O(1) actual
y - node to become childx - node to become parentCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/FibonacciHeapNode.html b/javadoc/org/jgrapht/util/FibonacciHeapNode.html new file mode 100644 index 0000000..428784b --- /dev/null +++ b/javadoc/org/jgrapht/util/FibonacciHeapNode.html @@ -0,0 +1,310 @@ + + + + + + +public class FibonacciHeapNode<T> +extends Object+
| Constructor and Description | +
|---|
FibonacciHeapNode(T data)
+Default constructor.
+ |
+
public FibonacciHeapNode(T data)+
data - data for this nodeCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/MathUtil.html b/javadoc/org/jgrapht/util/MathUtil.html new file mode 100644 index 0000000..594722e --- /dev/null +++ b/javadoc/org/jgrapht/util/MathUtil.html @@ -0,0 +1,267 @@ + + + + + + +public class MathUtil +extends Object+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/ModifiableInteger.html b/javadoc/org/jgrapht/util/ModifiableInteger.html new file mode 100644 index 0000000..732c937 --- /dev/null +++ b/javadoc/org/jgrapht/util/ModifiableInteger.html @@ -0,0 +1,608 @@ + + + + + + +public class ModifiableInteger +extends Number +implements Comparable<ModifiableInteger>+
ModifiableInteger class wraps a value of the primitive type
+ int in an object, similarly to Integer. An
+ object of type ModifiableInteger contains a single field whose
+ type is int.
+
+ Unlike java.lang.Integer, the int value which the
+ ModifiableInteger represents can be modified. It becomes useful when used
+ together with the collection framework. For example, if you want to have a
+ List of counters. You could use Integer but
+ that would have became wasteful and inefficient if you frequently had to
+ update the counters.
WARNING: Because instances of this class are mutable, great care must be
+ exercised if used as keys of a Map or as values in a Set in a manner that affects equals comparisons while the
+ instances are keys in the map (or values in the set). For more see
+ documentation of Map and Set.
| Modifier and Type | +Field and Description | +
|---|---|
int |
+value
+The int value represented by this
+ModifiableInteger. |
+
| Constructor and Description | +
|---|
ModifiableInteger()
+Deprecated.
+
+not really deprecated, just marked so to avoid mistaken use.
+ |
+
ModifiableInteger(int value)
+Constructs a newly allocated
+ModifiableInteger object that
+ represents the specified int value. |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+compareTo(ModifiableInteger anotherInteger)
+Compares two
+ModifiableInteger objects numerically. |
+
void |
+decrement()
+Subtracts one from the value of this modifiable integer.
+ |
+
double |
+doubleValue() |
+
boolean |
+equals(Object o)
+Compares this object to the specified object.
+ |
+
float |
+floatValue() |
+
int |
+getValue()
+Returns the value of this object, similarly to
+intValue(). |
+
int |
+hashCode()
+Returns a hash code for this
+ModifiableInteger. |
+
void |
+increment()
+Adds one to the value of this modifiable integer.
+ |
+
int |
+intValue() |
+
long |
+longValue() |
+
void |
+setValue(int value)
+Sets a new value for this modifiable integer.
+ |
+
Integer |
+toInteger()
+Returns an
+Integer object representing this
+ ModifiableInteger's value. |
+
String |
+toString()
+Returns a
+String object representing this
+ ModifiableInteger's value. |
+
byteValue, shortValuepublic int value+
ModifiableInteger.@Deprecated +public ModifiableInteger()+
ModifiableInteger(int) constructor
+ instead !!!
+
+ This constructor is for the use of java.beans.XMLDecoder + deserialization. The constructor is marked as 'deprecated' to indicate to + the programmer against using it by mistake.
public ModifiableInteger(int value)+
ModifiableInteger object that
+ represents the specified int value.value - the value to be represented by the
+ ModifiableInteger object.public void setValue(int value)+
value - the new value to set.public int getValue()+
intValue(). This
+ getter is NOT redundant. It is used for serialization by
+ java.beans.XMLEncoder.public void increment()+
public void decrement()+
public int compareTo(ModifiableInteger anotherInteger)+
ModifiableInteger objects numerically.compareTo in interface Comparable<ModifiableInteger>anotherInteger - the ModifiableInteger to be compared.0 if this ModifiableInteger
+ is equal to the argument ModifiableInteger; a value less
+ than 0 if this ModifiableInteger is numerically
+ less than the argument ModifiableInteger; and a value
+ greater than 0 if this ModifiableInteger is
+ numerically greater than the argument ModifiableInteger
+ (signed comparison).public double doubleValue()+
doubleValue in class NumberNumber.doubleValue()public boolean equals(Object o)+
+ true if and only if the argument is not null and is
+ an ModifiableInteger object that contains the same
+ int value as this object.public float floatValue()+
floatValue in class NumberNumber.floatValue()public int hashCode()+
ModifiableInteger.public int intValue()+
intValue in class NumberNumber.intValue()public long longValue()+
longValue in class NumberNumber.longValue()public Integer toInteger()+
Integer object representing this
+ ModifiableInteger's value.Integer representation of the value of this
+ object.public String toString()+
String object representing this
+ ModifiableInteger's value. The value is converted to signed
+ decimal representation and returned as a string, exactly as if the
+ integer value were given as an argument to the Integer.toString(int) method.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/PrefetchIterator.NextElementFunctor.html b/javadoc/org/jgrapht/util/PrefetchIterator.NextElementFunctor.html new file mode 100644 index 0000000..6be742c --- /dev/null +++ b/javadoc/org/jgrapht/util/PrefetchIterator.NextElementFunctor.html @@ -0,0 +1,220 @@ + + + + + + +public static interface PrefetchIterator.NextElementFunctor<EE>
+| Modifier and Type | +Method and Description | +
|---|---|
EE |
+nextElement()
+You must implement that NoSuchElementException is thrown on
+ nextElement() if it is out of bound.
+ |
+
EE nextElement() + throws NoSuchElementException+
NoSuchElementExceptionCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/PrefetchIterator.html b/javadoc/org/jgrapht/util/PrefetchIterator.html new file mode 100644 index 0000000..3cc006b --- /dev/null +++ b/javadoc/org/jgrapht/util/PrefetchIterator.html @@ -0,0 +1,432 @@ + + + + + + +public class PrefetchIterator<E> +extends Object +implements Iterator<E>, Enumeration<E>+
Many classes which implement an iterator face a common problem: if there + is no easy way to calculate hasNext() other than to call getNext(), then they + save the result for fetching in the next call to getNext(). This utility + helps in doing just that. + +
Usage: The new iterator class will hold this class as a member + variable and forward the hasNext() and next() to it. When creating an + instance of this class, you supply it with a functor that is doing the real + job of calculating the next element. + +
+ //This class supllies enumeration of integer till 100.
+ public class IteratorExample implements Enumeration{
+ private int counter=0;
+ private PrefetchIterator nextSupplier;
+
+ IteratorExample()
+ {
+ nextSupplier = new PrefetchIterator(new PrefetchIterator.NextElementFunctor(){
+
+ public Object nextElement() throws NoSuchElementException {
+ counter++;
+ if (counter <= 100)
+ throw new NoSuchElementException();
+ else
+ return new Integer(counter);
+ }
+
+ });
+ }
+ //forwarding to nextSupplier and return its returned value
+ public boolean hasMoreElements() {
+ return this.nextSupplier.hasMoreElements();
+ }
+ // forwarding to nextSupplier and return its returned value
+ public Object nextElement() {
+ return this.nextSupplier.nextElement();
+ }
+ }
+ | Modifier and Type | +Class and Description | +
|---|---|
static interface |
+PrefetchIterator.NextElementFunctor<EE> |
+
| Constructor and Description | +
|---|
PrefetchIterator(PrefetchIterator.NextElementFunctor<E> aEnum) |
+
| Modifier and Type | +Method and Description | +
|---|---|
boolean |
+hasMoreElements()
+If (isGetNextLastResultUpToDate==true) returns true else 1.
+ |
+
boolean |
+hasNext() |
+
boolean |
+isEnumerationStartedEmpty()
+Tests whether the enumeration started as an empty one.
+ |
+
E |
+next() |
+
E |
+nextElement()
+1.
+ |
+
void |
+remove()
+Always throws UnsupportedOperationException.
+ |
+
public PrefetchIterator(PrefetchIterator.NextElementFunctor<E> aEnum)+
public E nextElement()+
nextElement in interface Enumeration<E>public boolean hasMoreElements()+
hasMoreElements in interface Enumeration<E>public boolean isEnumerationStartedEmpty()+
public void remove() + throws UnsupportedOperationException+
remove in interface Iterator<E>UnsupportedOperationExceptionCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/TypeUtil.html b/javadoc/org/jgrapht/util/TypeUtil.html new file mode 100644 index 0000000..454ab04 --- /dev/null +++ b/javadoc/org/jgrapht/util/TypeUtil.html @@ -0,0 +1,270 @@ + + + + + + +public class TypeUtil<T> +extends Object+
| Modifier and Type | +Method and Description | +
|---|---|
static <T> T |
+uncheckedCast(Object o,
+ TypeUtil<T> typeDecl)
+Casts an object to a type.
+ |
+
public static <T> T uncheckedCast(Object o, + TypeUtil<T> typeDecl)+
o - object to be casttypeDecl - conveys the target type information; the actual value is
+ unused and can be null since this is all just stupid compiler tricksCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/VertexPair.html b/javadoc/org/jgrapht/util/VertexPair.html new file mode 100644 index 0000000..a836467 --- /dev/null +++ b/javadoc/org/jgrapht/util/VertexPair.html @@ -0,0 +1,365 @@ + + + + + + +public class VertexPair<V> +extends Object+
| Constructor and Description | +
|---|
VertexPair(V n1,
+ V n2) |
+
public V getFirst()+
public V getSecond()+
public boolean hasVertex(V v)+
v - The vertex in questionCopyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/WeightCombiner.html b/javadoc/org/jgrapht/util/WeightCombiner.html new file mode 100644 index 0000000..b32c5c8 --- /dev/null +++ b/javadoc/org/jgrapht/util/WeightCombiner.html @@ -0,0 +1,335 @@ + + + + + + +public interface WeightCombiner
+| Modifier and Type | +Field and Description | +
|---|---|
static WeightCombiner |
+FIRST
+First weight.
+ |
+
static WeightCombiner |
+MAX
+Maximum weight.
+ |
+
static WeightCombiner |
+MIN
+Minimum weight.
+ |
+
static WeightCombiner |
+MULT
+Multiplication of weights.
+ |
+
static WeightCombiner |
+SECOND
+Second weight.
+ |
+
static WeightCombiner |
+SUM
+Sum of weights.
+ |
+
static final WeightCombiner SUM+
static final WeightCombiner MULT+
static final WeightCombiner MIN+
static final WeightCombiner MAX+
static final WeightCombiner FIRST+
static final WeightCombiner SECOND+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/ArrayUnenforcedSet.html b/javadoc/org/jgrapht/util/class-use/ArrayUnenforcedSet.html new file mode 100644 index 0000000..c5474ce --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/ArrayUnenforcedSet.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/FibonacciHeap.html b/javadoc/org/jgrapht/util/class-use/FibonacciHeap.html new file mode 100644 index 0000000..4d5cf57 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/FibonacciHeap.html @@ -0,0 +1,210 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected FibonacciHeap<V> |
+AStarShortestPath.openList |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <T> FibonacciHeap<T> |
+FibonacciHeap.union(FibonacciHeap<T> h1,
+ FibonacciHeap<T> h2)
+Joins two Fibonacci heaps into a new one.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <T> FibonacciHeap<T> |
+FibonacciHeap.union(FibonacciHeap<T> h1,
+ FibonacciHeap<T> h2)
+Joins two Fibonacci heaps into a new one.
+ |
+
static <T> FibonacciHeap<T> |
+FibonacciHeap.union(FibonacciHeap<T> h1,
+ FibonacciHeap<T> h2)
+Joins two Fibonacci heaps into a new one.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/FibonacciHeapNode.html b/javadoc/org/jgrapht/util/class-use/FibonacciHeapNode.html new file mode 100644 index 0000000..7b21b28 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/FibonacciHeapNode.html @@ -0,0 +1,255 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Modifier and Type | +Field and Description | +
|---|---|
protected Map<V,FibonacciHeapNode<V>> |
+AStarShortestPath.vertexToHeapNodeMap |
+
| Modifier and Type | +Method and Description | +
|---|---|
FibonacciHeapNode<T> |
+FibonacciHeap.min()
+Returns the smallest element in the heap.
+ |
+
FibonacciHeapNode<T> |
+FibonacciHeap.removeMin()
+Removes the smallest element from the heap.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
protected void |
+FibonacciHeap.cascadingCut(FibonacciHeapNode<T> y)
+Performs a cascading cut operation.
+ |
+
protected void |
+FibonacciHeap.cut(FibonacciHeapNode<T> x,
+ FibonacciHeapNode<T> y)
+The reverse of the link operation: removes x from the child list of y.
+ |
+
protected void |
+FibonacciHeap.cut(FibonacciHeapNode<T> x,
+ FibonacciHeapNode<T> y)
+The reverse of the link operation: removes x from the child list of y.
+ |
+
void |
+FibonacciHeap.decreaseKey(FibonacciHeapNode<T> x,
+ double k)
+Decreases the key value for a heap node, given the new value to take on.
+ |
+
void |
+FibonacciHeap.delete(FibonacciHeapNode<T> x)
+Deletes a node from the heap given the reference to the node.
+ |
+
void |
+FibonacciHeap.insert(FibonacciHeapNode<T> node,
+ double key)
+Inserts a new data element into the heap.
+ |
+
protected void |
+FibonacciHeap.link(FibonacciHeapNode<T> y,
+ FibonacciHeapNode<T> x)
+Make node y a child of node x.
+ |
+
protected void |
+FibonacciHeap.link(FibonacciHeapNode<T> y,
+ FibonacciHeapNode<T> x)
+Make node y a child of node x.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/MathUtil.html b/javadoc/org/jgrapht/util/class-use/MathUtil.html new file mode 100644 index 0000000..c699a19 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/MathUtil.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/ModifiableInteger.html b/javadoc/org/jgrapht/util/class-use/ModifiableInteger.html new file mode 100644 index 0000000..6ef827f --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/ModifiableInteger.html @@ -0,0 +1,162 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
int |
+ModifiableInteger.compareTo(ModifiableInteger anotherInteger)
+Compares two
+ModifiableInteger objects numerically. |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/PrefetchIterator.NextElementFunctor.html b/javadoc/org/jgrapht/util/class-use/PrefetchIterator.NextElementFunctor.html new file mode 100644 index 0000000..ef108b0 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/PrefetchIterator.NextElementFunctor.html @@ -0,0 +1,158 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Constructor and Description | +
|---|
PrefetchIterator(PrefetchIterator.NextElementFunctor<E> aEnum) |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/PrefetchIterator.html b/javadoc/org/jgrapht/util/class-use/PrefetchIterator.html new file mode 100644 index 0000000..c532342 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/PrefetchIterator.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/TypeUtil.html b/javadoc/org/jgrapht/util/class-use/TypeUtil.html new file mode 100644 index 0000000..fe950e0 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/TypeUtil.html @@ -0,0 +1,163 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Modifier and Type | +Method and Description | +
|---|---|
static <T> T |
+TypeUtil.uncheckedCast(Object o,
+ TypeUtil<T> typeDecl)
+Casts an object to a type.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/VertexPair.html b/javadoc/org/jgrapht/util/class-use/VertexPair.html new file mode 100644 index 0000000..7554f83 --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/VertexPair.html @@ -0,0 +1,117 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/class-use/WeightCombiner.html b/javadoc/org/jgrapht/util/class-use/WeightCombiner.html new file mode 100644 index 0000000..3219b2a --- /dev/null +++ b/javadoc/org/jgrapht/util/class-use/WeightCombiner.html @@ -0,0 +1,226 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Constructor and Description | +
|---|
DirectedGraphUnion(DirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
GraphUnion(G g1,
+ G g2,
+ WeightCombiner operator) |
+
MixedGraphUnion(UndirectedGraph<V,E> g1,
+ DirectedGraph<V,E> g2,
+ WeightCombiner operator) |
+
| Modifier and Type | +Field and Description | +
|---|---|
static WeightCombiner |
+WeightCombiner.FIRST
+First weight.
+ |
+
static WeightCombiner |
+WeightCombiner.MAX
+Maximum weight.
+ |
+
static WeightCombiner |
+WeightCombiner.MIN
+Minimum weight.
+ |
+
static WeightCombiner |
+WeightCombiner.MULT
+Multiplication of weights.
+ |
+
static WeightCombiner |
+WeightCombiner.SECOND
+Second weight.
+ |
+
static WeightCombiner |
+WeightCombiner.SUM
+Sum of weights.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/package-frame.html b/javadoc/org/jgrapht/util/package-frame.html new file mode 100644 index 0000000..8d7c23b --- /dev/null +++ b/javadoc/org/jgrapht/util/package-frame.html @@ -0,0 +1,32 @@ + + + + + + +See: Description
+| Interface | +Description | +
|---|---|
| PrefetchIterator.NextElementFunctor<EE> | ++ |
| WeightCombiner | +
+ Binary operator for edge weights.
+ |
+
| Class | +Description | +
|---|---|
| ArrayUnenforcedSet<E> | +
+ Helper for efficiently representing small sets whose elements are known to be
+ unique by construction, implying we don't need to enforce the uniqueness
+ property in the data structure itself.
+ |
+
| FibonacciHeap<T> | +
+ This class implements a Fibonacci heap data structure.
+ |
+
| FibonacciHeapNode<T> | +
+ Implements a node of the Fibonacci heap.
+ |
+
| MathUtil | +
+ Math Utilities.
+ |
+
| ModifiableInteger | +
+ The
+ModifiableInteger class wraps a value of the primitive type
+ int in an object, similarly to Integer. |
+
| PrefetchIterator<E> | +
+ Utility class to help implement an iterator/enumerator in which the hasNext()
+ method needs to calculate the next elements ahead of time.
+ |
+
| TypeUtil<T> | +
+ TypeUtil isolates type-unsafety so that code which uses it for legitimate
+ reasons can stay warning-free.
+ |
+
| VertexPair<V> | +
+ Representation of a pair of vertices; to be replaced by Pair<V,V> if
+ Sun ever gets around to adding Pair to java.util.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/package-tree.html b/javadoc/org/jgrapht/util/package-tree.html new file mode 100644 index 0000000..084e777 --- /dev/null +++ b/javadoc/org/jgrapht/util/package-tree.html @@ -0,0 +1,158 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/org/jgrapht/util/package-use.html b/javadoc/org/jgrapht/util/package-use.html new file mode 100644 index 0000000..44967e7 --- /dev/null +++ b/javadoc/org/jgrapht/util/package-use.html @@ -0,0 +1,231 @@ + + + + + + +| Package | +Description | +
|---|---|
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.graph | +
+ Implementations of various graphs.
+ |
+
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
| Class and Description | +
|---|
| FibonacciHeap
+ This class implements a Fibonacci heap data structure.
+ |
+
| FibonacciHeapNode
+ Implements a node of the Fibonacci heap.
+ |
+
| Class and Description | +
|---|
| WeightCombiner
+ Binary operator for edge weights.
+ |
+
| Class and Description | +
|---|
| FibonacciHeap
+ This class implements a Fibonacci heap data structure.
+ |
+
| FibonacciHeapNode
+ Implements a node of the Fibonacci heap.
+ |
+
| ModifiableInteger
+ The
+ModifiableInteger class wraps a value of the primitive type
+ int in an object, similarly to Integer. |
+
| PrefetchIterator.NextElementFunctor | +
| TypeUtil
+ TypeUtil isolates type-unsafety so that code which uses it for legitimate
+ reasons can stay warning-free.
+ |
+
| WeightCombiner
+ Binary operator for edge weights.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/overview-frame.html b/javadoc/overview-frame.html new file mode 100644 index 0000000..c275fba --- /dev/null +++ b/javadoc/overview-frame.html @@ -0,0 +1,39 @@ + + + + + + ++ + diff --git a/javadoc/overview-summary.html b/javadoc/overview-summary.html new file mode 100644 index 0000000..057bce3 --- /dev/null +++ b/javadoc/overview-summary.html @@ -0,0 +1,234 @@ + + + + + + +
| Package | +Description | +
|---|---|
| org.jgrapht | ++ + | +
| org.jgrapht.alg | +
+ Algorithms provided with JGraphT.
+ |
+
| org.jgrapht.alg.cycle | +
+ Algorithms for enumeration of simple cycles in graphs.
+ |
+
| org.jgrapht.alg.flow | ++ |
| org.jgrapht.alg.interfaces | ++ |
| org.jgrapht.alg.isomorphism | ++ |
| org.jgrapht.alg.util | +
+ Utilities used by JGraphT algorithms.
+ |
+
| org.jgrapht.demo | +
+ Demo programs that help to get started with JGraphT.
+ |
+
| org.jgrapht.event | +
+ Event classes and listener interfaces, used to provide a change
+notification mechanism on graph modification events.
+ |
+
| 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.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.graph.builder | +
+ Various builder for graphs.
+ |
+
| org.jgrapht.traverse | +
+ Graph traversal means.
+ |
+
| org.jgrapht.util | +
+ Non-graph-specific data structures, algorithms, and utilities used by
+JGraphT.
+ |
+
Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/overview-tree.html b/javadoc/overview-tree.html new file mode 100644 index 0000000..f72bf88 --- /dev/null +++ b/javadoc/overview-tree.html @@ -0,0 +1,602 @@ + + + + + + +Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/package-list b/javadoc/package-list new file mode 100644 index 0000000..e445e80 --- /dev/null +++ b/javadoc/package-list @@ -0,0 +1,19 @@ +org.jgrapht +org.jgrapht.alg +org.jgrapht.alg.cycle +org.jgrapht.alg.flow +org.jgrapht.alg.interfaces +org.jgrapht.alg.isomorphism +org.jgrapht.alg.util +org.jgrapht.demo +org.jgrapht.event +org.jgrapht.experimental +org.jgrapht.experimental.alg +org.jgrapht.experimental.alg.color +org.jgrapht.experimental.dag +org.jgrapht.ext +org.jgrapht.generate +org.jgrapht.graph +org.jgrapht.graph.builder +org.jgrapht.traverse +org.jgrapht.util diff --git a/javadoc/resources/background.gif b/javadoc/resources/background.gif new file mode 100644 index 0000000..f471940 Binary files /dev/null and b/javadoc/resources/background.gif differ diff --git a/javadoc/resources/tab.gif b/javadoc/resources/tab.gif new file mode 100644 index 0000000..1a73a83 Binary files /dev/null and b/javadoc/resources/tab.gif differ diff --git a/javadoc/resources/titlebar.gif b/javadoc/resources/titlebar.gif new file mode 100644 index 0000000..17443b3 Binary files /dev/null and b/javadoc/resources/titlebar.gif differ diff --git a/javadoc/resources/titlebar_end.gif b/javadoc/resources/titlebar_end.gif new file mode 100644 index 0000000..3ad78d4 Binary files /dev/null and b/javadoc/resources/titlebar_end.gif differ diff --git a/javadoc/serialized-form.html b/javadoc/serialized-form.html new file mode 100644 index 0000000..545a764 --- /dev/null +++ b/javadoc/serialized-form.html @@ -0,0 +1,1415 @@ + + + + + + +Set<E> cutpoints+
DirectedGraph<V,E> dfsTree+
UndirectedGraph<V,E> graph+
int numOrder+
Deque<E> stack+
Map<K,V> vertex2biconnectedSubgraphs+
Map<K,V> vertex2block+
Map<K,V> vertex2numOrder+
JGraphModelAdapter<V,E> jgAdapter+
JGraphXAdapter<V,E> jgxAdapter+
int type+
int type+
org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoComparator<V> topoComparator+
DirectedAcyclicGraph.TopoOrderMapping<V> topoOrderMap+
int maxTopoIndex+
int minTopoIndex+
long topologyUpdateCount+
DirectedAcyclicGraph.VisitedFactory visitedFactory+
DirectedAcyclicGraph.TopoOrderMappingFactory<V> topoOrderFactory+
int start+
int finish+
boolean[] visited+
DirectedAcyclicGraph.Region region+
List<E> visited+
DirectedAcyclicGraph.Region affectedRegion+
BitSet visited+
DirectedAcyclicGraph.Region affectedRegion+
Set<E> jCellsBeingAdded+
+ 1. First, we add the desired edge to jCellsBeingAdded to indicate + that the edge is being inserted internally. + 2. Then we invoke the JGraph 'insert' operation. + 3. The JGraph listener will detect the newly inserted edge. + 4. It checks if the edge is contained in jCellsBeingAdded. + 5. If yes, + it just removes it and does nothing else. + if no, + it knows that the edge was inserted externally and performs + the insertion. + 6. Lastly, we remove the edge from the jCellsBeingAdded. ++ +
Step 6 is not always required but we do it anyway as a safeguard + against the rare case where the edge to be added is already contained in + the graph and thus NO event will be fired. If 6 is not done, a junk edge + will remain in the jCellsBeingAdded set.
+ +The other sets are used in a similar manner to the above. Apparently, + All that complication could be eliminated if JGraph and JGraphT had both + allowed operations that do not inform listeners...
Set<E> jCellsBeingRemoved+
Set<E> jtElementsBeingAdded+
Set<E> jtElementsBeingRemoved+
JGraphModelAdapter.CellFactory<VV,EE> cellFactory+
Map<K,V> cellToEdge+
Map<K,V> cellToVertex+
org.jgraph.graph.AttributeMap defaultEdgeAttributes+
org.jgraph.graph.AttributeMap defaultVertexAttributes+
Map<K,V> edgeToCell+
Map<K,V> vertexToCell+
org.jgrapht.ext.JGraphModelAdapter.ShieldedGraph jtGraph+
boolean allowingLoops+
EdgeFactory<V,E> edgeFactory+
EdgeSetFactory<V,E> edgeSetFactory+
Map<K,V> edgeMap+
org.jgrapht.graph.AbstractBaseGraph.Specifics specifics+
boolean allowingMultipleEdges+
List<E> graphListeners+
List<E> vertexSetListeners+
org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent<VV,EE> reuseableEdgeEvent+
org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent<VV> reuseableVertexEvent+
boolean reuseEvents+
double weight+
UndirectedGraph<V,E> undirectedGraph+
DirectedGraph<V,E> directedGraph+
int value+
ModifiableInteger.Copyright © 2016. All rights reserved.
+ + diff --git a/javadoc/stylesheet.css b/javadoc/stylesheet.css new file mode 100644 index 0000000..0aeaa97 --- /dev/null +++ b/javadoc/stylesheet.css @@ -0,0 +1,474 @@ +/* Javadoc style sheet */ +/* +Overall document style +*/ +body { + background-color:#ffffff; + color:#353833; + font-family:Arial, Helvetica, sans-serif; + font-size:76%; + margin:0; +} +a:link, a:visited { + text-decoration:none; + color:#4c6b87; +} +a:hover, a:focus { + text-decoration:none; + color:#bb7a2a; +} +a:active { + text-decoration:none; + color:#4c6b87; +} +a[name] { + color:#353833; +} +a[name]:hover { + text-decoration:none; + color:#353833; +} +pre { + font-size:1.3em; +} +h1 { + font-size:1.8em; +} +h2 { + font-size:1.5em; +} +h3 { + font-size:1.4em; +} +h4 { + font-size:1.3em; +} +h5 { + font-size:1.2em; +} +h6 { + font-size:1.1em; +} +ul { + list-style-type:disc; +} +code, tt { + font-size:1.2em; +} +dt code { + font-size:1.2em; +} +table tr td dt code { + font-size:1.2em; + vertical-align:top; +} +sup { + font-size:.6em; +} +/* +Document title and Copyright styles +*/ +.clear { + clear:both; + height:0px; + overflow:hidden; +} +.aboutLanguage { + float:right; + padding:0px 21px; + font-size:.8em; + z-index:200; + margin-top:-7px; +} +.legalCopy { + margin-left:.5em; +} +.bar a, .bar a:link, .bar a:visited, .bar a:active { + color:#FFFFFF; + text-decoration:none; +} +.bar a:hover, .bar a:focus { + color:#bb7a2a; +} +.tab { + background-color:#0066FF; + background-image:url(resources/titlebar.gif); + background-position:left top; + background-repeat:no-repeat; + color:#ffffff; + padding:8px; + width:5em; + font-weight:bold; +} +/* +Navigation bar styles +*/ +.bar { + background-image:url(resources/background.gif); + background-repeat:repeat-x; + color:#FFFFFF; + padding:.8em .5em .4em .8em; + height:auto;/*height:1.8em;*/ + font-size:1em; + margin:0; +} +.topNav { + background-image:url(resources/background.gif); + background-repeat:repeat-x; + color:#FFFFFF; + float:left; + padding:0; + width:100%; + clear:right; + height:2.8em; + padding-top:10px; + overflow:hidden; +} +.bottomNav { + margin-top:10px; + background-image:url(resources/background.gif); + background-repeat:repeat-x; + color:#FFFFFF; + float:left; + padding:0; + width:100%; + clear:right; + height:2.8em; + padding-top:10px; + overflow:hidden; +} +.subNav { + background-color:#dee3e9; + border-bottom:1px solid #9eadc0; + float:left; + width:100%; + overflow:hidden; +} +.subNav div { + clear:left; + float:left; + padding:0 0 5px 6px; +} +ul.navList, ul.subNavList { + float:left; + margin:0 25px 0 0; + padding:0; +} +ul.navList li{ + list-style:none; + float:left; + padding:3px 6px; +} +ul.subNavList li{ + list-style:none; + float:left; + font-size:90%; +} +.topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited { + color:#FFFFFF; + text-decoration:none; +} +.topNav a:hover, .bottomNav a:hover { + text-decoration:none; + color:#bb7a2a; +} +.navBarCell1Rev { + background-image:url(resources/tab.gif); + background-color:#a88834; + color:#FFFFFF; + margin: auto 5px; + border:1px solid #c9aa44; +} +/* +Page header and footer styles +*/ +.header, .footer { + clear:both; + margin:0 20px; + padding:5px 0 0 0; +} +.indexHeader { + margin:10px; + position:relative; +} +.indexHeader h1 { + font-size:1.3em; +} +.title { + color:#2c4557; + margin:10px 0; +} +.subTitle { + margin:5px 0 0 0; +} +.header ul { + margin:0 0 25px 0; + padding:0; +} +.footer ul { + margin:20px 0 5px 0; +} +.header ul li, .footer ul li { + list-style:none; + font-size:1.2em; +} +/* +Heading styles +*/ +div.details ul.blockList ul.blockList ul.blockList li.blockList h4, div.details ul.blockList ul.blockList ul.blockListLast li.blockList h4 { + background-color:#dee3e9; + border-top:1px solid #9eadc0; + border-bottom:1px solid #9eadc0; + margin:0 0 6px -8px; + padding:2px 5px; +} +ul.blockList ul.blockList ul.blockList li.blockList h3 { + background-color:#dee3e9; + border-top:1px solid #9eadc0; + border-bottom:1px solid #9eadc0; + margin:0 0 6px -8px; + padding:2px 5px; +} +ul.blockList ul.blockList li.blockList h3 { + padding:0; + margin:15px 0; +} +ul.blockList li.blockList h2 { + padding:0px 0 20px 0; +} +/* +Page layout container styles +*/ +.contentContainer, .sourceContainer, .classUseContainer, .serializedFormContainer, .constantValuesContainer { + clear:both; + padding:10px 20px; + position:relative; +} +.indexContainer { + margin:10px; + position:relative; + font-size:1.0em; +} +.indexContainer h2 { + font-size:1.1em; + padding:0 0 3px 0; +} +.indexContainer ul { + margin:0; + padding:0; +} +.indexContainer ul li { + list-style:none; +} +.contentContainer .description dl dt, .contentContainer .details dl dt, .serializedFormContainer dl dt { + font-size:1.1em; + font-weight:bold; + margin:10px 0 0 0; + color:#4E4E4E; +} +.contentContainer .description dl dd, .contentContainer .details dl dd, .serializedFormContainer dl dd { + margin:10px 0 10px 20px; +} +.serializedFormContainer dl.nameValue dt { + margin-left:1px; + font-size:1.1em; + display:inline; + font-weight:bold; +} +.serializedFormContainer dl.nameValue dd { + margin:0 0 0 1px; + font-size:1.1em; + display:inline; +} +/* +List styles +*/ +ul.horizontal li { + display:inline; + font-size:0.9em; +} +ul.inheritance { + margin:0; + padding:0; +} +ul.inheritance li { + display:inline; + list-style:none; +} +ul.inheritance li ul.inheritance { + margin-left:15px; + padding-left:15px; + padding-top:1px; +} +ul.blockList, ul.blockListLast { + margin:10px 0 10px 0; + padding:0; +} +ul.blockList li.blockList, ul.blockListLast li.blockList { + list-style:none; + margin-bottom:25px; +} +ul.blockList ul.blockList li.blockList, ul.blockList ul.blockListLast li.blockList { + padding:0px 20px 5px 10px; + border:1px solid #9eadc0; + background-color:#f9f9f9; +} +ul.blockList ul.blockList ul.blockList li.blockList, ul.blockList ul.blockList ul.blockListLast li.blockList { + padding:0 0 5px 8px; + background-color:#ffffff; + border:1px solid #9eadc0; + border-top:none; +} +ul.blockList ul.blockList ul.blockList ul.blockList li.blockList { + margin-left:0; + padding-left:0; + padding-bottom:15px; + border:none; + border-bottom:1px solid #9eadc0; +} +ul.blockList ul.blockList ul.blockList ul.blockList li.blockListLast { + list-style:none; + border-bottom:none; + padding-bottom:0; +} +table tr td dl, table tr td dl dt, table tr td dl dd { + margin-top:0; + margin-bottom:1px; +} +/* +Table styles +*/ +.contentContainer table, .classUseContainer table, .constantValuesContainer table { + border-bottom:1px solid #9eadc0; + width:100%; +} +.contentContainer ul li table, .classUseContainer ul li table, .constantValuesContainer ul li table { + width:100%; +} +.contentContainer .description table, .contentContainer .details table { + border-bottom:none; +} +.contentContainer ul li table th.colOne, .contentContainer ul li table th.colFirst, .contentContainer ul li table th.colLast, .classUseContainer ul li table th, .constantValuesContainer ul li table th, .contentContainer ul li table td.colOne, .contentContainer ul li table td.colFirst, .contentContainer ul li table td.colLast, .classUseContainer ul li table td, .constantValuesContainer ul li table td{ + vertical-align:top; + padding-right:20px; +} +.contentContainer ul li table th.colLast, .classUseContainer ul li table th.colLast,.constantValuesContainer ul li table th.colLast, +.contentContainer ul li table td.colLast, .classUseContainer ul li table td.colLast,.constantValuesContainer ul li table td.colLast, +.contentContainer ul li table th.colOne, .classUseContainer ul li table th.colOne, +.contentContainer ul li table td.colOne, .classUseContainer ul li table td.colOne { + padding-right:3px; +} +.overviewSummary caption, .packageSummary caption, .contentContainer ul.blockList li.blockList caption, .summary caption, .classUseContainer caption, .constantValuesContainer caption { + position:relative; + text-align:left; + background-repeat:no-repeat; + color:#FFFFFF; + font-weight:bold; + clear:none; + overflow:hidden; + padding:0px; + margin:0px; +} +caption a:link, caption a:hover, caption a:active, caption a:visited { + color:#FFFFFF; +} +.overviewSummary caption span, .packageSummary caption span, .contentContainer ul.blockList li.blockList caption span, .summary caption span, .classUseContainer caption span, .constantValuesContainer caption span { + white-space:nowrap; + padding-top:8px; + padding-left:8px; + display:block; + float:left; + background-image:url(resources/titlebar.gif); + height:18px; +} +.overviewSummary .tabEnd, .packageSummary .tabEnd, .contentContainer ul.blockList li.blockList .tabEnd, .summary .tabEnd, .classUseContainer .tabEnd, .constantValuesContainer .tabEnd { + width:10px; + background-image:url(resources/titlebar_end.gif); + background-repeat:no-repeat; + background-position:top right; + position:relative; + float:left; +} +ul.blockList ul.blockList li.blockList table { + margin:0 0 12px 0px; + width:100%; +} +.tableSubHeadingColor { + background-color: #EEEEFF; +} +.altColor { + background-color:#eeeeef; +} +.rowColor { + background-color:#ffffff; +} +.overviewSummary td, .packageSummary td, .contentContainer ul.blockList li.blockList td, .summary td, .classUseContainer td, .constantValuesContainer td { + text-align:left; + padding:3px 3px 3px 7px; +} +th.colFirst, th.colLast, th.colOne, .constantValuesContainer th { + background:#dee3e9; + border-top:1px solid #9eadc0; + border-bottom:1px solid #9eadc0; + text-align:left; + padding:3px 3px 3px 7px; +} +td.colOne a:link, td.colOne a:active, td.colOne a:visited, td.colOne a:hover, td.colFirst a:link, td.colFirst a:active, td.colFirst a:visited, td.colFirst a:hover, td.colLast a:link, td.colLast a:active, td.colLast a:visited, td.colLast a:hover, .constantValuesContainer td a:link, .constantValuesContainer td a:active, .constantValuesContainer td a:visited, .constantValuesContainer td a:hover { + font-weight:bold; +} +td.colFirst, th.colFirst { + border-left:1px solid #9eadc0; + white-space:nowrap; +} +td.colLast, th.colLast { + border-right:1px solid #9eadc0; +} +td.colOne, th.colOne { + border-right:1px solid #9eadc0; + border-left:1px solid #9eadc0; +} +table.overviewSummary { + padding:0px; + margin-left:0px; +} +table.overviewSummary td.colFirst, table.overviewSummary th.colFirst, +table.overviewSummary td.colOne, table.overviewSummary th.colOne { + width:25%; + vertical-align:middle; +} +table.packageSummary td.colFirst, table.overviewSummary th.colFirst { + width:25%; + vertical-align:middle; +} +/* +Content styles +*/ +.description pre { + margin-top:0; +} +.deprecatedContent { + margin:0; + padding:10px 0; +} +.docSummary { + padding:0; +} +/* +Formatting effect styles +*/ +.sourceLineNo { + color:green; + padding:0 30px 0 0; +} +h1.hidden { + visibility:hidden; + overflow:hidden; + font-size:.9em; +} +.block { + display:block; + margin:3px 0 0 0; +} +.strong { + font-weight:bold; +} diff --git a/lib/jgraph-5.13.0.0.jar b/lib/jgraph-5.13.0.0.jar new file mode 100644 index 0000000..a853740 Binary files /dev/null and b/lib/jgraph-5.13.0.0.jar differ diff --git a/lib/jgrapht-core-0.9.2.jar b/lib/jgrapht-core-0.9.2.jar new file mode 100644 index 0000000..82dba34 Binary files /dev/null and b/lib/jgrapht-core-0.9.2.jar differ diff --git a/lib/jgrapht-demo-0.9.2.jar b/lib/jgrapht-demo-0.9.2.jar new file mode 100644 index 0000000..fbd2d23 Binary files /dev/null and b/lib/jgrapht-demo-0.9.2.jar differ diff --git a/lib/jgrapht-ext-0.9.2-uber.jar b/lib/jgrapht-ext-0.9.2-uber.jar new file mode 100644 index 0000000..03a2d24 Binary files /dev/null and b/lib/jgrapht-ext-0.9.2-uber.jar differ diff --git a/lib/jgrapht-ext-0.9.2.jar b/lib/jgrapht-ext-0.9.2.jar new file mode 100644 index 0000000..8710fb9 Binary files /dev/null and b/lib/jgrapht-ext-0.9.2.jar differ diff --git a/lib/jgraphx-2.0.0.1.jar b/lib/jgraphx-2.0.0.1.jar new file mode 100644 index 0000000..7b36c99 Binary files /dev/null and b/lib/jgraphx-2.0.0.1.jar differ diff --git a/manifest.mf b/manifest.mf new file mode 100644 index 0000000..328e8e5 --- /dev/null +++ b/manifest.mf @@ -0,0 +1,3 @@ +Manifest-Version: 1.0 +X-COMMENT: Main-Class will be added automatically by build + diff --git a/nbproject/build-impl.xml b/nbproject/build-impl.xml new file mode 100644 index 0000000..8db778d --- /dev/null +++ b/nbproject/build-impl.xml @@ -0,0 +1,1419 @@ + + +