IOConsole
+ * class.
+ */
+
+public class TwoConsoleDemo extends Program {
+
+ public void init() {
+ TCModel model = new TCModel();
+ c1 = new TCView(model, 1);
+ c2 = new TCView(model, 2);
+ add(c1);
+ add(c2);
+ }
+
+ public void run() {
+ new Thread(c1).start();
+ new Thread(c2).start();
+ }
+
+ private TCView c1;
+ private TCView c2;
+
+/* Standard Java entry point */
+/* This method can be eliminated in most Java environments */
+ public static void main(String[] args) {
+ new TwoConsoleDemo().start(args);
+ }
+}
+
+class TCView extends IOConsole implements Runnable {
+
+ public TCView(TCModel model, int index) {
+ consoleIndex = index;
+ consoleModel = model;
+ consoleModel.addView(this);
+ Color inputColor = (index % 2 == 0) ? Color.MAGENTA : Color.BLUE;
+ Color errorColor = (index % 2 == 1) ? Color.MAGENTA : Color.BLUE;
+ String inputColorName = (index % 2 == 0) ? "magenta" : "blue";
+ String errorColorName = (index % 2 == 1) ? "magenta" : "blue";
+ setInputColor(inputColor);
+ setErrorColor(errorColor);
+ int r = Math.max(0xCC, inputColor.getRed());
+ int g = Math.max(0xCC, inputColor.getGreen());
+ int b = Math.max(0xCC, inputColor.getBlue());
+ setBackground(new Color(r, g, b));
+ println("Console " + index);
+ print("On this console, input appears in ");
+ setInputScript(new BufferedReader(new StringReader(inputColorName + "\n")));
+ readLine();
+ print("Output from other consoles appears in ");
+ showErrorMessage(errorColorName);
+ }
+
+ public void run() {
+ while (true) {
+ String line = readLine();
+ consoleModel.inputReceived(this, line);
+ }
+ }
+
+ public int getIndex() {
+ return consoleIndex;
+ }
+
+ public void inputReceived(String line) {
+ showErrorMessage(line);
+ }
+
+ private TCModel consoleModel;
+ private int consoleIndex;
+}
+
+class TCModel {
+
+ public TCModel() {
+ views = new ArrayList();
+ }
+
+ public void addView(TCView view) {
+ views.add(view);
+ }
+
+ public void inputReceived(TCView source, String line) {
+ int nViews = views.size();
+ for (int i = 0; i < nViews; i++) {
+ TCView view = (TCView) views.get(i);
+ if (view != source) view.inputReceived(line);
+ }
+ }
+
+ private ArrayList views;
+}
+
+
+
\ No newline at end of file
diff --git a/ss2010/gdi2/java/libs/acm/demo/USFlag.java b/ss2010/gdi2/java/libs/acm/demo/USFlag.java
new file mode 100644
index 00000000..b6b17d1d
--- /dev/null
+++ b/ss2010/gdi2/java/libs/acm/demo/USFlag.java
@@ -0,0 +1,80 @@
+/*
+ * File: USFlag.java
+ * ---------------------
+ * This program demonstrates the acm.graphics package by drawing a US flag.
+ */
+
+import acm.graphics.*;
+import acm.program.*;
+import java.awt.*;
+
+/* Class: USFlag */
+/**
+ * GraphicsProgram to draw a US flag. It uses a subsidiary
+ * GStar class to simplify the drawing.
+ */
+public class USFlag extends GraphicsProgram {
+
+/** Runs the program */
+ public void run() {
+ getGCanvas().setAutoRepaintFlag(false);
+ addStripes(getWidth(), getHeight());
+ addField(FIELD_FRACTION * getWidth(), getHeight() * 7.0 / 13);
+ repaint();
+ }
+
+/* Adds the stripes */
+ private void addStripes(double width, double height) {
+ double sHeight = height / 13;
+ for (int i = 12; i >= 0; i--) {
+ GRect stripe = new GRect(0, i * sHeight, width, sHeight);
+ stripe.setFilled(true);
+ stripe.setColor((i % 2 == 0) ? Color.RED : Color.WHITE);
+ add(stripe);
+ }
+ }
+
+/* Adds the star field */
+ private void addField(double width, double height) {
+ GRect field = new GRect(0, 0, width, height);
+ field.setColor(Color.BLUE);
+ field.setFilled(true);
+ add(field);
+ double dx = width / 6;
+ double dy = height / 5;
+ double starSize = STAR_FRACTION * Math.min(dx, dy);
+ for (int row = 0; row < 5; row++) {
+ double y = (row + 0.5) * dy;
+ for (int col = 0; col < 6; col++) {
+ double x = (col + 0.5) * dx;
+ GStar star = new GStar(starSize);
+ star.setColor(Color.WHITE);
+ star.setFilled(true);
+ star.setLocation(x, y);
+ add(star);
+ }
+ }
+ for (int row = 0; row < 4; row++) {
+ double y = (row + 1) * dy;
+ for (int col = 0; col < 5; col++) {
+ double x = (col + 1) * dx;
+ GStar star = new GStar(starSize);
+ star.setColor(Color.WHITE);
+ star.setFilled(true);
+ star.setLocation(x, y);
+ add(star);
+ }
+ }
+ }
+
+/* Private constants */
+
+ private static final double FIELD_FRACTION = 0.40;
+ private static final double STAR_FRACTION = 0.40;
+
+/* Standard Java entry point */
+/* This method can be eliminated in most Java environments */
+ public static void main(String[] args) {
+ new USFlag().start(args);
+ }
+}
diff --git a/ss2010/gdi2/java/libs/acm/demo/YarnPattern.java b/ss2010/gdi2/java/libs/acm/demo/YarnPattern.java
new file mode 100644
index 00000000..d22ef95b
--- /dev/null
+++ b/ss2010/gdi2/java/libs/acm/demo/YarnPattern.java
@@ -0,0 +1,67 @@
+/*
+ * File: YarnPattern.java
+ * ----------------------
+ * This program illustrates the use of the GLine class to simulate
+ * winding a piece of colored yarn around a set of pegs equally
+ * spaced along the edges of the canvas. At each step, the yarn is
+ * stretched from its current peg to the one DELTA pegs further on.
+ */
+
+import acm.graphics.*;
+import acm.program.*;
+import java.awt.*;
+import java.util.*;
+
+public class YarnPattern extends GraphicsProgram {
+
+/** Runs the program */
+ public void run() {
+ ArrayList pegs = createPegList();
+ int thisPeg = 0;
+ int nextPeg = -1;
+ while (thisPeg != 0 || nextPeg == -1) {
+ nextPeg = (thisPeg + DELTA) % pegs.size();
+ GPoint p0 = (GPoint) pegs.get(thisPeg);
+ GPoint p1 = (GPoint) pegs.get(nextPeg);
+ GLine line = new GLine(p0.getX(), p0.getY(),
+ p1.getX(), p1.getY());
+ line.setColor(Color.MAGENTA);
+ add(line);
+ thisPeg = nextPeg;
+ }
+ }
+
+/* Create an array list containing the locations of the pegs */
+ private ArrayList createPegList() {
+ ArrayList pegs = new ArrayList();
+ for (int i = 0; i < N_ACROSS; i++) {
+ pegs.add(new GPoint(i * PEG_SEP, 0));
+ }
+ for (int i = 0; i < N_DOWN; i++) {
+ pegs.add(new GPoint(N_ACROSS * PEG_SEP, i * PEG_SEP));
+ }
+ for (int i = N_ACROSS; i > 0; i--) {
+ pegs.add(new GPoint(i * PEG_SEP, N_DOWN * PEG_SEP));
+ }
+ for (int i = N_DOWN; i > 0; i--) {
+ pegs.add(new GPoint(0, i * PEG_SEP));
+ }
+ return pegs;
+ }
+
+/* Private constants */
+ private static final int N_ACROSS = 50;
+ private static final int N_DOWN = 30;
+ private static final int PEG_SEP = 10;
+ private static final int DELTA = 67;
+
+/* Make sure that the application has the right dimensions */
+ public static final int APPLICATION_WIDTH = N_ACROSS * PEG_SEP;
+ public static final int APPLICATION_HEIGHT = N_DOWN * PEG_SEP;
+
+/* Standard Java entry point */
+/* This method can be eliminated in most Java environments */
+ public static void main(String[] args) {
+ new YarnPattern().start(args);
+ }
+}
diff --git a/ss2010/gdi2/java/libs/acm/demo/YinYang.java b/ss2010/gdi2/java/libs/acm/demo/YinYang.java
new file mode 100644
index 00000000..0b1c0436
--- /dev/null
+++ b/ss2010/gdi2/java/libs/acm/demo/YinYang.java
@@ -0,0 +1,43 @@
+/*
+ * File: YinYang.java
+ * ------------------
+ * This program draws the Taoist yin-yang symbol at the center of
+ * the graphics window. The height and width of the entire figure
+ * are both specified by the constant FIGURE_SIZE.
+ */
+
+import acm.graphics.*;
+import acm.program.*;
+import java.awt.*;
+
+public class YinYang extends GraphicsProgram {
+
+/** Runs the program */
+ public void run() {
+ double x = getWidth() / 2;
+ double y = getHeight() / 2;
+ double r = FIGURE_SIZE / 2;
+ GArc bigBlack = new GArc(x - r, y - r, 2 * r, 2 * r, -90, 180);
+ bigBlack.setFilled(true);
+ add(bigBlack);
+ GArc smallWhite = new GArc(x - r / 2, y - r, r, r, 0, 360);
+ smallWhite.setFilled(true);
+ smallWhite.setColor(Color.WHITE);
+ add(smallWhite);
+ GArc smallBlack = new GArc(x - r / 2, y, r, r, 0, 360);
+ smallBlack.setFilled(true);
+ add(smallBlack);
+ GArc outerCircle = new GArc(x - r, y - r, 2 * r, 2 * r, 0, 360);
+ add(outerCircle);
+ }
+
+/* Private constants */
+ private static final double FIGURE_SIZE = 150;
+
+/* Standard Java entry point */
+/* This method can be eliminated in most Java environments */
+ public static void main(String[] args) {
+ new YinYang().start(args);
+ }
+}
+
diff --git a/ss2010/gdi2/java/libs/jgrapht/README.html b/ss2010/gdi2/java/libs/jgrapht/README.html
new file mode 100644
index 00000000..a160669a
--- /dev/null
+++ b/ss2010/gdi2/java/libs/jgrapht/README.html
@@ -0,0 +1,612 @@
+
+
+
+
+
+
+
+
+
+
+
JGraphT 0.7.3
+
+
+ Released: September, 2008
+ +Written by Barak Naveh (barak_naveh@users.sourceforge.net) + and Contributors.
+ +(C) Copyright 2003-2008, by Barak Naveh and Contributors. All rights + reserved.
+ +Please address all contributions, suggestions, and inquiries to the + current project administrator, John Sichi.
+ +Sponsorship
+ +JGraphT is now part of The Eigenbase Project, an umbrella + organization which helps to support it. If you use JGraphT in your + application, please consider making a donation. Either visit the Eigenbase website and click + the donation link, or use the + Sourceforge donation page for JGraphT. + +
Introduction
+ +JGraphT is a free Java class library that provides mathematical + graph-theory objects and algorithms. It runs on Java 2 Platform + (requires JDK 1.6 or later).
+ +JGraphT is licensed under the terms of the GNU Lesser General Public + License (LGPL). A copy of the license is + included in the download.
+ +Please note that JGraphT is distributed WITHOUT ANY WARRANTY; without even + the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. + Please refer to the license for details.
+ +Contents
+ +jgrapht-jdk1.6.jar |
+
+ the compiled JGraphT library for JRE 1.6 | +
README.html |
+
+ this file | +
licence-LGPL.txt |
+
+ GNU Lesser General Public License | +
javadoc/ |
+
+ Javadoc documentation | +
lib/ |
+
+
+ libraries required for build:
+
+
|
+
src/ |
+
+ source code | +
testsrc/ |
+
+ source code of unit tests | +
META-INF/MANIFEST.MF |
+ meta information for use as an OSGi plug-in (e.g. within an Eclipse RCP application) | +
build.properties |
+ describes content of OSGi plug-in export | +
build.xml |
+
+ ant buildfile | +
Getting Started
+ +The package org.jgrapht.demo includes small demo
+ applications to help you get started. If you spawn your own demo app and
+ think others can use it, please send it to us and we will add it to that
+ package.
Upgrading Versions
+ +To help upgrading, JGraphT maintains a one-version-backwards + compatibility. While this compatibility is not a hard promise, it is generally + respected. (This policy was not followed for the jump from 0.6.0 to 0.7.0 + due to the pervasive changes required for generics.) You can upgrade via:
+ +-
+
-
+
The safe way : compile your app with the JGraphT + version that immediately follows your existing version and + follow the deprecation notes, if they exist, and modify your + application accordingly. Then move to the next version, and on, + until you're current.
+
+
+ -
+
The fast way : go to the latest JGraphT right away - if it + works, you're done.
+
+
Reading the change history is always + recommended.
+ +Documentation
+ +A local copy of the Javadoc HTML files is included in this distribution. + The latest version of these files is also available on-line at http://www.jgrapht.org/javadoc.
+ +Dependencies
+ +-
+
- JGraphT requires JDK 1.6 or later to build.
+
+
+ - JUnit is a unit testing framework. You need JUnit only if you want to
+ run the unit tests. The
junit.jarruntime file is included in + this distribution. JUnit is licensed under the terms of the IBM Common + Public License. You can find out more about JUnit and/or download the + latest version from http://www.junit.org. The JUnit tests included + with JGraphT have been created using JUnit 3.8.1.
+
+
+ - XMLUnit extends JUnit with XML capabilities. You need XMLUnit
+ only if you want to run the unit tests. The
+
xmlunit-1.0.jarruntime file is included in this + distribution. XMLUnit is licensed under the terms of the BSD + License. You can find out more about XMLUnit and/or download the + latest version from http://xmlunit.sourceforge.net.
+
+ - JGraph is a graph visualization and editing component. You
+ need JGraph only if you want to create graph visualizations using
+ the JGraphT-to-JGraph adapter. The
jgraph.jarruntime + file of JGraph is included in this distribution (file + lib/lib-readme.txt has version information). JGraph is licensed + under the terms of the GNU Lesser General Public License + (LGPL). You can find more about JGraph and/or download the latest + version from http://www.sourceforge.net/projects/jgraph.
+
+ - Touchgraph is a graph visualization and layout component. You
+ need Touchgraph only if you want to create graph visualizations
+ using the JGraphT-to-Touchgraph converter. The
+
TGGraphLayout.jarruntime file of Touchgraph is included + in this distribution (file lib/lib-readme.txt has version + information). Touchgraph is licensed under the terms of an Apache-style + License. You can find more about Touchgraph + and/or download the latest version from http://sourceforge.net/projects/touchgraph.
+
Online Resources
+ +The JGraphT website is at: http://www.jgrapht.org. You can + use this site to:
+ +-
+
- Obtain the latest version : latest version and all previous + versions of JGraphT are available online. + +
- Report bugs : if you have any comments, suggestions or bugs you + want to report. + +
- Get support : if you have questions or need help with + JGraphT. +
There is also a wiki set up + for everyone in the JGraphT community to share information about the + project.
+ +Your Improvements
+ +If you add improvements to JGraphT please send them to us. We will add them + to the next release so that everyone can enjoy them. You might also benefit + from it: others may fix bugs in your source files or may continue to enhance + them.
+ +History
+ +Changes to JGraphT in each version:
+ +-
+
- version 0.8.1 (3-Jul-2009): Enhanced GmlExporter with + customized labels and ID's, contributed by Trevor Harmon. Added + new algorithms HamiltonianCycle, ChromaticNumber and + EulerianCircuit, plus new generators HyperCubeGraphGenerator, + StarGraphGenerator, and CompleteBipartiteGraphGenerator, all + contributed by Andrew Newell. Fix bug with vertices which are + equals but not identity-same in graphs allowing loops, spotted by + Michael Michaud. Fix bug in EquivalenceIsomorphismInspector, + reported by Tim Engler. Add toString for shortest paths wrapper, + spotted by Achim Beutel. Add FloydWarshallShortestPaths, + contributed by Tom Larkworthy. Enhance DijskstraShortestPath to + support GraphPath interface. + +
- version 0.8.0 (Sept-2008): Moved to JDK 1.6. Fixed + problem with RandomGraphGenerator reported by Mario Rossi. Added + CompleteGraphGenerator, contributed by Tim Shearouse. Fixed + FibonacciHeap performance problem reported by Jason Lenderman. + Made DotExporter reject illegal vertex ID's, contributed by Holger + Brandl. Fixed bogus assertion for topological sort over empty + graph, spotted by Harris Lin. Added scale-free graph generator + and EdmondsKarpMaximumFlow, contributed by Ilya Razenshteyn. + Added DirectedAcyclicGraph, contributed by Peter Giles. Added + protected getWeight accessor to DefaultWeightedEdge, likewise + getSource and getTarget on DefaultEdge. Optimized iterators to + skip calling event firing routines when there are no listeners, + and used ArrayDeque in a number of places, per suggestion from + Ross Judson. Improvements to StrongConnectivityInspector and OSGi + bundle support contributed by Christian Soltenborn. + +
- version 0.7.3 (Jan-2008): Patch to + JGraphModelAdapter.removeVertex provided by Hookahey. Added + ParanoidGraph. Removed obsolete ArrayUtil (spotted by Boente). + Added GraphPath, and used it to fix mistake in 0.7.2 + (k-shortest-paths was returning a private data structure, + as discovered by numerous users). Fixed + EdgeReversedGraph.getAllEdges (spotted by + neumanns@users.sf.net). Fixed incorrect assertion in + TopologicalOrderIterator constructor. Enabled assertions + in JUnit tests. Fixed NPE in BellmanFordShortestPath.getCost. + Fixed a few problems spotted by findbugs. + +
- version 0.7.2 (Sept-2007): Added + TransitiveClosure, contributed by Vinayak Borkar. Added + biconnectivity/cutpoint inspection, k-shortest-paths, and masked + subgraphs, all contributed by Guillaume Boulmier. Made some + Graphs helper methods even more generic, as suggested by JongSoo. + Test and fixes for (Directed)NeighborIndex submitted by Andrew + Berman. Added AsUnweighted(Directed)Graph and AsWeightedGraph, + contributed by Lucas Scharenbroich. Dropped support for retroweaver. + +
- version 0.7.1 (March-2007): Fixed some bugs in + CycleDetector reported by Khanh Vu, and added more testcases for + it. Fixed bugs in DepthFirstIterator reported by Welson Sun, and + added WHITE/GRAY/BLACK states and vertexFinished listener event. + Exposed Subgraph.getBase(), and parameterized Subgraph on graph + type (per suggestion from Aaron Harnly). Added EdgeReversedView. + Added GmlExporter (contributed by Dimitrios Michail), plus + DOTExporter and GraphMLExporter (both contributed by Trevor + Harmon). Enhanced TopologicalOrderIterator to take an optional + Queue parameter for tie-breaking (per suggestion from JongSoo + Park). Fixed some documentation errors reported by Guillaume + Boulmier. + +
- version 0.7.0 (July-2006) : Upgraded to JDK 1.5 + (generics support added by Christian Hammer with help from Hartmut + Benz and John Sichi). Added (Directed)NeighborIndex and + MatrixExporter, contributed by Charles Fry. Added BellmanFord, + contributed by Guillaume Boulmier of France Telecom. Removed + never-used LabeledElement. Renamed package from org._3pq.jgrapht + to org.jgrapht. Made various breaking change to interfaces; edge + collections are now Sets, not Lists. Added Touchgraph converter, + contributed by Carl Anderson + +
- version 0.6.0 (July-2005) : Upgraded to JDK 1.4, taking
+ advantage of its new linked hash set/map containers to make
+ edge/vertex set order-deterministic. Added support for custom edge
+ lists. Fixed various serialization and Subgraph issues. Added to
+
JGraphModelAdaptersupport for JGraph's "dangling" + edges; its constructors have slightly changed and now forbid +nullvalues. Improved interface to +DijskstraShortestPath, and added radius support to +ClosestFirstIterator. Added new +StrongConnectivityInspectoralgorithm (contributed by + Christian Soltenborn) andTopologicalOrderIterator+ (contributed by Marden Neubert). Deleted deprecated +TraverseUtils. Upgraded to JGraph 5.6.1.1.
+
+ - version 0.5.3 (June-2004) : Removed Subgraph verification of + element's identity to base graph, upgraded to JGraph 4.0, Added the + VisioExporter which was contributed by Avner Linder, minor bug fixes and + improvements. + +
- version 0.5.2 (March-2004) : Serialization improvements, fixes + to subgraphs and listenable graphs, added support for JGraph->JGraphT + change propagation for JGraph adapter (contributed by Erik Postma), + upgraded to JGraph 3.1, various bug fixes and improvements. + +
- version 0.5.1 (November-2003) : Semantics of Graph.clone() has + changed, please check the documentation if you're using it. Added + Dijkstra's shortest path, vertex cover approximations, new graph generation + framework, upgraded to JGraph 3.0, various bug fixes and API + improvements. + +
- version 0.5.0 (14-Aug-2003) : a new connectivity inspector + added, edge API refactored to be simpler, an improved ant build, an + improved event model, all known bugs were fixed, documentation + clarifications, other small improvements. API of 0.5.0 is not 100% backward + compatible with 0.4.1 but upgrade is simple and straightforward. + +
- version 0.4.1 (05-Aug-2003) : A new adapter to JGraph that + provides graph visualizations, new depth-first and breadth-first iteration + algorithms, various bug fixes and refactoring, moved unit-tests to a + separate folder hierarchy and added more unit-tests. + +
- version 0.4.0 (July-2003) : Initial public release. +
Contributors
+ +JGraphT wouldn't be the library it is today without the source + contributions and suggestions made by the authors:
+ +-
+
- Barak Naveh + (project founder) + +
- John V + Sichi (current project administrator) + +
- Liviu + Rau + +
- Nathan + Fiedler + +
- Michael + Behrisch + +
- Linda + Buisman + +
- Erik Postma + +
- Mikael Hansen + +
- Avner Linder + +
- Marden Neubert + +
- Christian + Soltenborn + +
- Christian + Hammer + +
- Ewgenij Proschak + +
- Hartmut + Benz + +
- Charles + Fry + +
- Guillaume Boulmier + +
- Carl Anderson + +
- Khanh Vu + +
- Aaron Harnly + +
- Dimitrios Michail + +
- Welson Sun + +
- Trevor Harmon + +
- David Black-Schaffer + +
- Vinayak Borkar + +
- Andrew Berman + +
- Lucas Scharenbroich + +
- Hookahey + +
- Tim Shearouse + +
- Holger Brandl + +
- Ilya Razenshteyn + +
- Peter Giles + +
- Andrew Newell + +
- Tim Engler + +
- Tom Larkworthy + +
(if we have missed your name on this list, please email us to get it + fixed).
+ +Other people have also helped in different ways: reporting bugs, + requesting features, commenting, and by merely asking very good questions. + Many thanks to all of you.
+ +Regards,
+ Barak Naveh
+ JGraphT Project Creator
+ John Sichi
+ JGraphT Project Administrator
+
+ +
| © Copyright 2003-2008, by Barak + Naveh and Contributors. All rights reserved. | + +
+ |
+
+ + diff --git a/ss2010/gdi2/java/libs/jgrapht/build.xml b/ss2010/gdi2/java/libs/jgrapht/build.xml new file mode 100644 index 00000000..802e1f54 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/build.xml @@ -0,0 +1,559 @@ + + + + +
+ +
+ +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Constant Field Values
++Contents + + +
| +org.jgrapht.* | +
|---|
+ +
| org.jgrapht.WeightedGraph<V,E> | +||
|---|---|---|
+public static final double |
+DEFAULT_EDGE_WEIGHT |
+1.0 |
+
+ +
+ +
| org.jgrapht.alg.EdmondsKarpMaximumFlow<V,E> | +||
|---|---|---|
+public static final double |
+DEFAULT_EPSILON |
+1.0E-9 |
+
+ +
+ +
| org.jgrapht.event.ConnectedComponentTraversalEvent | +||
|---|---|---|
+public static final int |
+CONNECTED_COMPONENT_FINISHED |
+32 |
+
+public static final int |
+CONNECTED_COMPONENT_STARTED |
+31 |
+
+ +
+ +
| org.jgrapht.event.GraphEdgeChangeEvent<V,E> | +||
|---|---|---|
+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 |
+
+ +
+ +
| org.jgrapht.event.GraphVertexChangeEvent<V> | +||
|---|---|---|
+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 |
+
+ +
+ +
| org.jgrapht.generate.LinearGraphGenerator<V,E> | +||
|---|---|---|
+public static final java.lang.String |
+END_VERTEX |
+"End Vertex" |
+
+public static final java.lang.String |
+START_VERTEX |
+"Start Vertex" |
+
+ +
+ +
| org.jgrapht.generate.StarGraphGenerator<V,E> | +||
|---|---|---|
+public static final java.lang.String |
+CENTER_VERTEX |
+"Center Vertex" |
+
+ +
+ +
| org.jgrapht.generate.WheelGraphGenerator<V,E> | +||
|---|---|---|
+public static final java.lang.String |
+HUB_VERTEX |
+"Hub Vertex" |
+
+ +
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/deprecated-list.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/deprecated-list.html new file mode 100644 index 00000000..fdfb3ae8 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/deprecated-list.html @@ -0,0 +1,174 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Deprecated API
++Contents + + +
| +Deprecated Classes | +|
|---|---|
| org.jgrapht.GraphHelper
+ + Use Graphs instead. |
+|
| +Deprecated Constructors | +|
|---|---|
| org.jgrapht.util.ModifiableInteger()
+ + not really deprecated, just marked so to avoid mistaken use. |
+|
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/help-doc.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/help-doc.html new file mode 100644 index 00000000..c9abec52 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/help-doc.html @@ -0,0 +1,217 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+How This API Document Is Organized
++Overview
++ +++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.
+Package
++ +++Each package has a page that contains a list of its classes and interfaces, with a summary for each. This page can contain four categories:
+
+- Interfaces (italic)
- Classes
- Enums
- Exceptions
- Errors
- Annotation Types
+Class/Interface
++ ++ ++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.- Class inheritance diagram
- Direct Subclasses
- All Known Subinterfaces
- All Known Implementing Classes
- Class/interface declaration
- Class/interface description +
+
- Nested Class Summary
- Field Summary
- Constructor Summary
- Method Summary +
+
- Field Detail
- Constructor Detail
- Method Detail
+Annotation Type
++ ++ ++Each annotation type has its own separate page with the following sections:
+
+- Annotation Type declaration
- Annotation Type description
- Required Element Summary
- Optional Element Summary
- Element Detail
+Enum
++ +++Each enum has its own separate page with the following sections:
+
+- Enum declaration
- Enum description
- Enum Constant Summary
- Enum Constant Detail
+Tree (Class Hierarchy)
++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 fromjava.lang.Object.+
+- When viewing the Overview page, clicking on "Tree" displays the hierarchy for all packages.
- When viewing a particular package, class or interface page, clicking "Tree" displays the hierarchy for only that package.
+Deprecated API
++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.+
+Index
++The Index contains an alphabetic list of all classes, interfaces, constructors, methods, and fields.+
+Prev/Next
+These links take you to the next or previous class, interface, package, or related page.+Frames/No Frames
+These links show and hide the HTML frames. All pages are available with or without frames. ++
+Serialized Form
+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. ++
+Constant Field Values
+The Constant Field Values page lists the static final fields and their values. +
+
+
+This help file applies to API documentation generated using the standard doclet.
+
+
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/index-all.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/index-all.html new file mode 100644 index 00000000..f891f098 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/index-all.html @@ -0,0 +1,2485 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+A
+-
+
- AbstractBaseGraph<V,E> - Class in org.jgrapht.graph
- The most general implementation of the
Graphinterface. - AbstractBaseGraph(EdgeFactory<V, E>, boolean, boolean) - +Constructor for class org.jgrapht.graph.AbstractBaseGraph +
- Construct a new pseudograph. +
- AbstractGraph<V,E> - Class in org.jgrapht.graph
- A skeletal implementation of the Graph interface, to minimize the + effort required to implement graph interfaces.
- AbstractGraph() - +Constructor for class org.jgrapht.graph.AbstractGraph +
- Construct a new empty graph object. +
- AbstractGraphIterator<V,E> - Class in org.jgrapht.traverse
- An empty implementation of a graph iterator to minimize the effort required + to implement graph iterators.
- AbstractGraphIterator() - +Constructor for class org.jgrapht.traverse.AbstractGraphIterator +
- +
- addAllEdges(Graph<? super V, ? super E>, Graph<V, E>, Collection<? extends E>) - +Static method in class org.jgrapht.Graphs +
- Adds a subset of the edges of the specified source graph to the specified + destination graph. +
- addAllVertices(Graph<? super V, ? super E>, Collection<? extends V>) - +Static method in class org.jgrapht.Graphs +
- Adds all of the specified vertices to the destination graph. +
- addEdge(V, V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- addEdge(V, V) - +Method in interface org.jgrapht.Graph +
- Creates a new edge in this graph, going from the source vertex to the + target vertex, and returns the created edge. +
- addEdge(V, V, E) - +Method in interface org.jgrapht.Graph +
- Adds the specified edge to this graph, going from the source vertex to + the target vertex. +
- addEdge(V, V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- addEdge(V, V) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- addEdge(V, V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- addEdge(V, V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- addEdge(V, V) - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- addEdge(V, V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.ParanoidGraph +
- +
- addEdge(V, V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.Subgraph +
- +
- addEdge(V, V) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- addEdge(V, V, E) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- addEdge(Graph<V, E>, V, V, double) - +Static method in class org.jgrapht.Graphs +
- Creates a new edge and adds it to the specified graph similarly to the
+
Graph.addEdge(Object, Object)method. + - addEdgeWithVertices(Graph<V, E>, V, V) - +Static method in class org.jgrapht.Graphs +
- 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. + - addEdgeWithVertices(Graph<V, E>, Graph<V, E>, E) - +Static method in class org.jgrapht.Graphs +
- Adds the specified edge to the graph, including its vertices if not + already included. +
- addEdgeWithVertices(Graph<V, E>, V, V, double) - +Static method in class org.jgrapht.Graphs +
- 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. + - addGraph(Graph<? super V, ? super E>, Graph<V, E>) - +Static method in class org.jgrapht.Graphs +
- Adds all the vertices and all the edges of the specified source graph to + the specified destination graph. +
- addGraphListener(GraphListener<V, E>) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- addGraphListener(GraphListener<V, E>) - +Method in interface org.jgrapht.ListenableGraph +
- Adds the specified graph listener to this graph, if not already present. +
- addGraphReversed(DirectedGraph<? super V, ? super E>, DirectedGraph<V, E>) - +Static method in class org.jgrapht.Graphs +
- Adds all the vertices and all the edges of the specified source digraph + to the specified destination digraph, reversing all of the edges. +
- addTraversalListener(TraversalListener<V, E>) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Adds the specified traversal listener to this iterator. +
- addTraversalListener(TraversalListener<V, E>) - +Method in interface org.jgrapht.traverse.GraphIterator +
- Adds the specified traversal listener to this iterator. +
- addVertex(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- addVertex(V) - +Method in interface org.jgrapht.Graph +
- Adds the specified vertex to this graph if not already present. +
- addVertex(V) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- addVertex(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- addVertex(V) - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- addVertex(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- addVertex(V) - +Method in class org.jgrapht.graph.ParanoidGraph +
- +
- addVertex(V) - +Method in class org.jgrapht.graph.Subgraph +
- Adds the specified vertex to this subgraph. +
- addVertex(V) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- addVertexSetListener(VertexSetListener<V>) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- addVertexSetListener(VertexSetListener<V>) - +Method in interface org.jgrapht.ListenableGraph +
- Adds the specified vertex set listener to this graph, if not already + present. +
- ArrayUnenforcedSet<E> - Class in org.jgrapht.util
- 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.
- ArrayUnenforcedSet() - +Constructor for class org.jgrapht.util.ArrayUnenforcedSet +
- +
- ArrayUnenforcedSet(Collection<? extends E>) - +Constructor for class org.jgrapht.util.ArrayUnenforcedSet +
- +
- ArrayUnenforcedSet(int) - +Constructor for class org.jgrapht.util.ArrayUnenforcedSet +
- +
- assertVertexExist(V) - +Method in class org.jgrapht.graph.AbstractGraph +
- Ensures that the specified vertex exists in this graph, or else throws + exception. +
- AsUndirectedGraph<V,E> - Class in org.jgrapht.graph
- An undirected view of the backing directed graph specified in the + constructor.
- AsUndirectedGraph(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.AsUndirectedGraph +
- Constructor for AsUndirectedGraph. +
- AsUnweightedDirectedGraph<V,E> - Class in org.jgrapht.graph
- An unweighted view of the backing weighted graph specified in the + constructor.
- AsUnweightedDirectedGraph(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.AsUnweightedDirectedGraph +
- Constructor for AsUnweightedGraph. +
- AsUnweightedGraph<V,E> - Class in org.jgrapht.graph
- An unweighted view of the backing weighted graph specified in the + constructor.
- AsUnweightedGraph(Graph<V, E>) - +Constructor for class org.jgrapht.graph.AsUnweightedGraph +
- Constructor for AsUnweightedGraph. +
- AsWeightedGraph<V,E> - Class in org.jgrapht.graph
- A weighted view of the backing graph specified in the constructor.
- AsWeightedGraph(Graph<V, E>, Map<E, Double>) - +Constructor for class org.jgrapht.graph.AsWeightedGraph +
- Constructor for AsWeightedGraph. +
+
+B
+-
+
- BEFORE_EDGE_ADDED - +Static variable in class org.jgrapht.event.GraphEdgeChangeEvent +
- Before edge added event. +
- BEFORE_EDGE_REMOVED - +Static variable in class org.jgrapht.event.GraphEdgeChangeEvent +
- Before edge removed event. +
- BEFORE_VERTEX_ADDED - +Static variable in class org.jgrapht.event.GraphVertexChangeEvent +
- Before vertex added event. +
- BEFORE_VERTEX_REMOVED - +Static variable in class org.jgrapht.event.GraphVertexChangeEvent +
- Before vertex removed event. +
- BellmanFordShortestPath<V,E> - Class in org.jgrapht.alg
- Bellman-Ford + algorithm: weights could be negative, paths could be constrained by a + maximum number of edges.
- BellmanFordShortestPath(Graph<V, E>, V) - +Constructor for class org.jgrapht.alg.BellmanFordShortestPath +
- Creates an object to calculate shortest paths between the start vertex + and others vertices using the Bellman-Ford algorithm. +
- BellmanFordShortestPath(Graph<V, E>, V, int) - +Constructor for class org.jgrapht.alg.BellmanFordShortestPath +
- Creates an object to calculate shortest paths between the start vertex + and others vertices using the Bellman-Ford algorithm. +
- BellmanFordShortestPath(Graph<V, E>, V, int, double) - +Constructor for class org.jgrapht.alg.BellmanFordShortestPath +
- Creates an object to calculate shortest paths between the start vertex + and others vertices using the Bellman-Ford algorithm. +
- BiconnectivityInspector<V,E> - Class in org.jgrapht.alg
- Inspects a graph for the biconnectivity property.
- BiconnectivityInspector(UndirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.BiconnectivityInspector +
- Running time = O(m) where m is the number of edges. +
- BlockCutpointGraph<V,E> - Class in org.jgrapht.alg
- 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. - BlockCutpointGraph(UndirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.BlockCutpointGraph +
- Running time = O(m) where m is the number of edges. +
- BreadthFirstIterator<V,E> - Class in org.jgrapht.traverse
- A breadth-first iterator for a directed and an undirected graph.
- BreadthFirstIterator(Graph<V, E>) - +Constructor for class org.jgrapht.traverse.BreadthFirstIterator +
- Creates a new breadth-first iterator for the specified graph. +
- BreadthFirstIterator(Graph<V, E>, V) - +Constructor for class org.jgrapht.traverse.BreadthFirstIterator +
- Creates a new breadth-first iterator for the specified graph. +
- BronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg
- 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.
- BronKerboschCliqueFinder(Graph<V, E>) - +Constructor for class org.jgrapht.alg.BronKerboschCliqueFinder +
- Creates a new clique finder. +
+
+C
+-
+
- calculateMaximumFlow(V, V) - +Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Sets current source to source, current sink to sink, + then calculates maximum flow from source to sink. +
- cascadingCut(FibonacciHeapNode<T>) - +Method in class org.jgrapht.util.FibonacciHeap +
- Performs a cascading cut operation. +
- CENTER_VERTEX - +Static variable in class org.jgrapht.generate.StarGraphGenerator +
- +
- ChromaticNumber - Class in org.jgrapht.alg
- Allows the + chromatic number of a graph to be calculated.
- ChromaticNumber() - +Constructor for class org.jgrapht.alg.ChromaticNumber +
- +
- ClassBasedEdgeFactory<V,E> - Class in org.jgrapht.graph
- An
EdgeFactoryfor producing edges by using a class as a factory. - ClassBasedEdgeFactory(Class<? extends E>) - +Constructor for class org.jgrapht.graph.ClassBasedEdgeFactory +
- +
- ClassBasedVertexFactory<V> - Class in org.jgrapht.graph
- A
VertexFactoryfor producing vertices by using a class as a factory. - ClassBasedVertexFactory(Class<? extends V>) - +Constructor for class org.jgrapht.graph.ClassBasedVertexFactory +
- +
- clear() - +Method in class org.jgrapht.ext.IntegerEdgeNameProvider +
- Clears all cached identifiers, and resets the unique identifier counter. +
- clear() - +Method in class org.jgrapht.ext.IntegerNameProvider +
- Clears all cached identifiers, and resets the unique identifier counter. +
- clear() - +Method in class org.jgrapht.util.FibonacciHeap +
- Removes all elements from this heap. +
- clone() - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- Returns a shallow copy of this graph instance. +
- clone() - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- closeSimpleDirectedGraph(SimpleDirectedGraph<V, E>) - +Method in class org.jgrapht.alg.TransitiveClosure +
- Computes the transitive closure of the given graph. +
- ClosestFirstIterator<V,E> - Class in org.jgrapht.traverse
- A closest-first iterator for a directed or undirected graph.
- ClosestFirstIterator(Graph<V, E>) - +Constructor for class org.jgrapht.traverse.ClosestFirstIterator +
- Creates a new closest-first iterator for the specified graph. +
- ClosestFirstIterator(Graph<V, E>, V) - +Constructor for class org.jgrapht.traverse.ClosestFirstIterator +
- Creates a new closest-first iterator for the specified graph. +
- ClosestFirstIterator(Graph<V, E>, V, double) - +Constructor for class org.jgrapht.traverse.ClosestFirstIterator +
- Creates a new radius-bounded closest-first iterator for the specified + graph. +
- combine(double, double) - +Method in interface org.jgrapht.util.WeightCombiner +
- Combines two weights. +
- compare(V, V) - +Method in class org.jgrapht.alg.util.VertexDegreeComparator +
- Compare the degrees of
v1andv2, taking into + account whether ascending or descending order is used. + - compareTo(ModifiableInteger) - +Method in class org.jgrapht.util.ModifiableInteger +
- Compares two
ModifiableIntegerobjects numerically. + - compareTo(Object) - +Method in class org.jgrapht.util.ModifiableInteger +
- Compares this
ModifiableIntegerobject to another object. + - CompleteBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a complete + bipartite graph of any size.
- CompleteBipartiteGraphGenerator(int, int) - +Constructor for class org.jgrapht.generate.CompleteBipartiteGraphGenerator +
- Creates a new CompleteBipartiteGraphGenerator object. +
- CompleteGraphDemo - Class in org.jgrapht.demo
- CompleteGraphDemo() - +Constructor for class org.jgrapht.demo.CompleteGraphDemo +
- +
- CompleteGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a complete graph of any size.
- CompleteGraphGenerator(int) - +Constructor for class org.jgrapht.generate.CompleteGraphGenerator +
- Construct a new CompleteGraphGenerator. +
- CONNECTED_COMPONENT_FINISHED - +Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent +
- Connected component traversal finished event. +
- CONNECTED_COMPONENT_STARTED - +Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent +
- Connected component traversal started event. +
- connectedComponentFinished(ConnectedComponentTraversalEvent) - +Method in interface org.jgrapht.event.TraversalListener +
- Called to inform listeners that the traversal of the current connected + component has finished. +
- connectedComponentFinished(ConnectedComponentTraversalEvent) - +Method in class org.jgrapht.event.TraversalListenerAdapter +
- +
- connectedComponentStarted(ConnectedComponentTraversalEvent) - +Method in interface org.jgrapht.event.TraversalListener +
- Called to inform listeners that a traversal of a new connected component + has started. +
- connectedComponentStarted(ConnectedComponentTraversalEvent) - +Method in class org.jgrapht.event.TraversalListenerAdapter +
- +
- ConnectedComponentTraversalEvent - Class in org.jgrapht.event
- A traversal event with respect to a connected component.
- ConnectedComponentTraversalEvent(Object, int) - +Constructor for class org.jgrapht.event.ConnectedComponentTraversalEvent +
- Creates a new ConnectedComponentTraversalEvent. +
- connectedSetOf(V) - +Method in class org.jgrapht.alg.ConnectivityInspector +
- Returns a set of all vertices that are in the maximally connected + component together with the specified vertex. +
- connectedSets() - +Method in class org.jgrapht.alg.ConnectivityInspector +
- Returns a list of
Sets, where each set contains all + vertices that are in the same maximally connected component. + - ConnectivityInspector<V,E> - Class in org.jgrapht.alg
- Allows obtaining various connectivity aspects of a graph.
- ConnectivityInspector(UndirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.ConnectivityInspector +
- Creates a connectivity inspector for the specified undirected graph. +
- ConnectivityInspector(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.ConnectivityInspector +
- Creates a connectivity inspector for the specified directed graph. +
- consolidate() - +Method in class org.jgrapht.util.FibonacciHeap +
- +
- containsEdge(E) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- containsEdge(V, V) - +Method in class org.jgrapht.graph.AbstractGraph +
- +
- containsEdge(V, V) - +Method in interface org.jgrapht.Graph +
- Returns true if and only if this graph contains an edge going + from the source vertex to the target vertex. +
- containsEdge(E) - +Method in interface org.jgrapht.Graph +
- Returns true if this graph contains the specified edge. +
- containsEdge(E) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- containsEdge(E) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- containsEdge(E) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- containsEdge(E) - +Method in class org.jgrapht.graph.Subgraph +
- +
- containsVertex(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- containsVertex(V) - +Method in interface org.jgrapht.Graph +
- Returns true if this graph contains the specified vertex. +
- containsVertex(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- containsVertex(V) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- containsVertex(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- containsVertex(V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- createDefaultEdgeAttributes(Graph<V, E>) - +Static method in class org.jgrapht.ext.JGraphModelAdapter +
- Creates and returns a map of attributes to be used as defaults for edge + attributes, depending on the specified graph. +
- createDefaultVertexAttributes() - +Static method in class org.jgrapht.ext.JGraphModelAdapter +
- Creates and returns a map of attributes to be used as defaults for vertex + attributes. +
- createEdge(V, V) - +Method in interface org.jgrapht.EdgeFactory +
- Creates a new edge whose endpoints are the specified source and target + vertices. +
- createEdge(V, V) - +Method in class org.jgrapht.graph.ClassBasedEdgeFactory +
- +
- createEdgeCell(EE) - +Method in interface org.jgrapht.ext.JGraphModelAdapter.CellFactory +
- Creates an edge cell that contains its respective JGraphT edge. +
- createEdgeCell(EE) - +Method in class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory +
- +
- createEdges(Graph<VV, EE>, Map<Integer, VV>, int, Random) - +Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory +
- +
- createEdges(Graph<VV, EE>, Map<Integer, VV>, int, Random) - +Method in interface org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory +
- Two different calls to the createEdges() with the same parameters + must result in the generation of the same. +
- createEdgeSet(V) - +Method in interface org.jgrapht.graph.EdgeSetFactory +
- Create a new edge set for a particular vertex. +
- createVertex() - +Method in class org.jgrapht.graph.ClassBasedVertexFactory +
- +
- createVertex() - +Method in interface org.jgrapht.VertexFactory +
- Creates a new vertex. +
- createVertexCell(VV) - +Method in interface org.jgrapht.ext.JGraphModelAdapter.CellFactory +
- Creates a vertex cell that contains its respective JGraphT vertex. +
- createVertexCell(VV) - +Method in class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory +
- +
- CrossComponentIterator<V,E,D> - Class in org.jgrapht.traverse
- Provides a cross-connected-component traversal functionality for iterator + subclasses.
- CrossComponentIterator(Graph<V, E>, V) - +Constructor for class org.jgrapht.traverse.CrossComponentIterator +
- Creates a new iterator for the specified graph. +
- CrossComponentIterator.VisitColor - Enum in org.jgrapht.traverse
- Standard vertex visit state enumeration.
- cut(FibonacciHeapNode<T>, FibonacciHeapNode<T>) - +Method in class org.jgrapht.util.FibonacciHeap +
- The reverse of the link operation: removes x from the child list of y. +
- CycleDetector<V,E> - Class in org.jgrapht.alg
- Performs cycle detection on a graph.
- CycleDetector(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.CycleDetector +
- Creates a cycle detector for the specified graph. +
+
+D
+-
+
- decreaseKey(FibonacciHeapNode<T>, double) - +Method in class org.jgrapht.util.FibonacciHeap +
- Decreases the key value for a heap node, given the new value to take on. +
- decrement() - +Method in class org.jgrapht.util.ModifiableInteger +
- Subtracts one from the value of this modifiable integer. +
- DEFAULT_EDGE_WEIGHT - +Static variable in interface org.jgrapht.WeightedGraph +
- The default weight for an edge. +
- DEFAULT_EPSILON - +Static variable in class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Default tolerance. +
- DefaultDirectedGraph<V,E> - Class in org.jgrapht.graph
- A directed graph.
- DefaultDirectedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.DefaultDirectedGraph +
- Creates a new directed graph. +
- DefaultDirectedGraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.DefaultDirectedGraph +
- Creates a new directed graph with the specified edge factory. +
- DefaultDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
- A directed weighted graph.
- DefaultDirectedWeightedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph +
- Creates a new directed weighted graph. +
- DefaultDirectedWeightedGraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph +
- Creates a new directed weighted graph with the specified edge factory. +
- DefaultEdge - Class in org.jgrapht.graph
- A default implementation for edges in a
Graph. - DefaultEdge() - +Constructor for class org.jgrapht.graph.DefaultEdge +
- +
- DefaultGraphMapping<V,E> - Class in org.jgrapht.graph
- Implementation of the GraphMapping interface.
- DefaultGraphMapping(Map<V, V>, Map<V, V>, Graph<V, E>, Graph<V, E>) - +Constructor for class org.jgrapht.graph.DefaultGraphMapping +
- The maps themselves are used. +
- DefaultListenableGraph<V,E> - Class in org.jgrapht.graph
- A graph backed by the the graph specified at the constructor, which can be
+ listened by
GraphListeners and by+ VertexSetListeners. - DefaultListenableGraph(Graph<V, E>) - +Constructor for class org.jgrapht.graph.DefaultListenableGraph +
- Creates a new listenable graph. +
- DefaultListenableGraph(Graph<V, E>, boolean) - +Constructor for class org.jgrapht.graph.DefaultListenableGraph +
- Creates a new listenable graph. +
- DefaultWeightedEdge - Class in org.jgrapht.graph
- A default implementation for edges in a
WeightedGraph. - DefaultWeightedEdge() - +Constructor for class org.jgrapht.graph.DefaultWeightedEdge +
- +
- degreeOf(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- degreeOf(V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- degreeOf(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- degreeOf(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- degreeOf(V) - +Method in class org.jgrapht.graph.UndirectedGraphUnion +
- +
- degreeOf(V) - +Method in class org.jgrapht.graph.UndirectedSubgraph +
- +
- degreeOf(V) - +Method in interface org.jgrapht.UndirectedGraph +
- Returns the degree of the specified vertex. +
- delete(FibonacciHeapNode<T>) - +Method in class org.jgrapht.util.FibonacciHeap +
- Deletes a node from the heap given the reference to the node. +
- DepthFirstIterator<V,E> - Class in org.jgrapht.traverse
- A depth-first iterator for a directed and an undirected graph.
- DepthFirstIterator(Graph<V, E>) - +Constructor for class org.jgrapht.traverse.DepthFirstIterator +
- Creates a new depth-first iterator for the specified graph. +
- DepthFirstIterator(Graph<V, E>, V) - +Constructor for class org.jgrapht.traverse.DepthFirstIterator +
- Creates a new depth-first iterator for the specified graph. +
- detectCycles() - +Method in class org.jgrapht.alg.CycleDetector +
- Performs yes/no cycle detection on the entire graph. +
- detectCyclesContainingVertex(V) - +Method in class org.jgrapht.alg.CycleDetector +
- Performs yes/no cycle detection on an individual vertex. +
- DijkstraShortestPath<V,E> - Class in org.jgrapht.alg
- An implementation of Dijkstra's
+ shortest path algorithm using
ClosestFirstIterator. - DijkstraShortestPath(Graph<V, E>, V, V) - +Constructor for class org.jgrapht.alg.DijkstraShortestPath +
- Creates and executes a new DijkstraShortestPath algorithm instance. +
- DijkstraShortestPath(Graph<V, E>, V, V, double) - +Constructor for class org.jgrapht.alg.DijkstraShortestPath +
- Creates and executes a new DijkstraShortestPath algorithm instance. +
- DirectedGraph<V,E> - Interface in org.jgrapht
- A graph whose all edges are directed.
- DirectedGraphUnion<V,E> - Class in org.jgrapht.graph
- DirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph
- A directed graph that is a
MaskSubgraphon another graph. - DirectedMaskSubgraph(DirectedGraph<V, E>, MaskFunctor<V, E>) - +Constructor for class org.jgrapht.graph.DirectedMaskSubgraph +
- +
- DirectedMultigraph<V,E> - Class in org.jgrapht.graph
- A directed multigraph.
- DirectedMultigraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.DirectedMultigraph +
- Creates a new directed multigraph. +
- DirectedMultigraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.DirectedMultigraph +
- Creates a new directed multigraph with the specified edge factory. +
- DirectedNeighborIndex<V,E> - Class in org.jgrapht.alg
- Maintains a cache of each vertex's neighbors.
- DirectedNeighborIndex(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.DirectedNeighborIndex +
- Creates a neighbor index for the specified directed graph. +
- DirectedPseudograph<V,E> - Class in org.jgrapht.graph
- A directed pseudograph.
- DirectedPseudograph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.DirectedPseudograph +
- +
- DirectedPseudograph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.DirectedPseudograph +
- +
- DirectedSubgraph<V,E> - Class in org.jgrapht.graph
- A directed graph that is a subgraph on other graph.
- DirectedSubgraph(DirectedGraph<V, E>, Set<V>, Set<E>) - +Constructor for class org.jgrapht.graph.DirectedSubgraph +
- Creates a new directed subgraph. +
- DirectedWeightedMultigraph<V,E> - Class in org.jgrapht.graph
- A directed weighted multigraph.
- DirectedWeightedMultigraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph +
- Creates a new directed weighted multigraph. +
- DirectedWeightedMultigraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph +
- Creates a new directed weighted multigraph with the specified edge + factory. +
- DirectedWeightedSubgraph<V,E> - Class in org.jgrapht.graph
- A directed weighted graph that is a subgraph on other graph.
- DirectedWeightedSubgraph(WeightedGraph<V, E>, Set<V>, Set<E>) - +Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph +
- Creates a new weighted directed subgraph. +
- DOTExporter<V,E> - Class in org.jgrapht.ext
- Exports a graph into a DOT file.
- DOTExporter() - +Constructor for class org.jgrapht.ext.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>, VertexNameProvider<V>, EdgeNameProvider<E>) - +Constructor for class org.jgrapht.ext.DOTExporter +
- Constructs a new DOTExporter object with the given ID and label + providers. +
- doubleValue() - +Method in class org.jgrapht.util.ModifiableInteger +
- +
+
+E
+-
+
- edge - +Variable in class org.jgrapht.event.EdgeTraversalEvent +
- The traversed edge. +
- edge - +Variable in class org.jgrapht.event.GraphEdgeChangeEvent +
- The edge that this event is related to. +
- EDGE_ADDED - +Static variable in class org.jgrapht.event.GraphEdgeChangeEvent +
- Edge added event. +
- EDGE_REMOVED - +Static variable in class org.jgrapht.event.GraphEdgeChangeEvent +
- Edge removed event. +
- edgeAdded(GraphEdgeChangeEvent<V, E>) - +Method in class org.jgrapht.alg.ConnectivityInspector +
- +
- edgeAdded(GraphEdgeChangeEvent<V, E>) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- +
- edgeAdded(GraphEdgeChangeEvent<V, E>) - +Method in class org.jgrapht.alg.NeighborIndex +
- +
- edgeAdded(GraphEdgeChangeEvent<V, E>) - +Method in interface org.jgrapht.event.GraphListener +
- Notifies that an edge has been added to the graph. +
- EdgeFactory<V,E> - Interface in org.jgrapht
- An edge factory used by graphs for creating new edges.
- EdgeNameProvider<E> - Interface in org.jgrapht.ext
- Assigns a display name for each of the graph edes.
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - +Method in class org.jgrapht.alg.ConnectivityInspector +
- +
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- +
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - +Method in class org.jgrapht.alg.NeighborIndex +
- +
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - +Method in interface org.jgrapht.event.GraphListener +
- Notifies that an edge has been removed from the graph. +
- EdgeReversedGraph<V,E> - Class in org.jgrapht.graph
- Provides an edge-reversed view g' of a directed graph g.
- EdgeReversedGraph(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.EdgeReversedGraph +
- Creates a new EdgeReversedGraph. +
- edgeSet() - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- edgeSet() - +Method in interface org.jgrapht.Graph +
- Returns a set of the edges contained in this graph. +
- edgeSet() - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- edgeSet() - +Method in class org.jgrapht.graph.GraphUnion +
- +
- edgeSet() - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- edgeSet() - +Method in class org.jgrapht.graph.Subgraph +
- +
- EdgeSetFactory<V,E> - Interface in org.jgrapht.graph
- A factory for edge sets.
- edgesOf(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- edgesOf(V) - +Method in interface org.jgrapht.Graph +
- Returns a set of all edges touching the specified vertex. +
- edgesOf(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- edgesOf(V) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- edgesOf(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- edgesOf(V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- EdgeTraversalEvent<V,E> - Class in org.jgrapht.event
- A traversal event for a graph edge.
- EdgeTraversalEvent(Object, E) - +Constructor for class org.jgrapht.event.EdgeTraversalEvent +
- Creates a new EdgeTraversalEvent. +
- edgeTraversed(EdgeTraversalEvent<V, E>) - +Method in interface org.jgrapht.event.TraversalListener +
- Called to inform the listener that the specified edge have been visited + during the graph traversal. +
- edgeTraversed(EdgeTraversalEvent<V, E>) - +Method in class org.jgrapht.event.TraversalListenerAdapter +
- +
- EdmondsKarpMaximumFlow<V,E> - Class in org.jgrapht.alg
- A flow network is a + directed graph where each edge has a capacity and each edge receives a flow.
- EdmondsKarpMaximumFlow(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Constructs MaximumFlow instance to work with a copy of + network. +
- EdmondsKarpMaximumFlow(DirectedGraph<V, E>, double) - +Constructor for class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Constructs MaximumFlow instance to work with a copy of + network. +
- EmptyGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates an empty + graph of any size.
- EmptyGraphGenerator(int) - +Constructor for class org.jgrapht.generate.EmptyGraphGenerator +
- Construct a new EmptyGraphGenerator. +
- encounterVertex(V, E) - +Method in class org.jgrapht.traverse.BreadthFirstIterator +
- +
- encounterVertex(V, E) - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- +
- encounterVertex(V, E) - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Update data structures the first time we see a vertex. +
- encounterVertex(V, E) - +Method in class org.jgrapht.traverse.DepthFirstIterator +
- +
- encounterVertex(V, E) - +Method in class org.jgrapht.traverse.TopologicalOrderIterator +
- +
- encounterVertexAgain(V, E) - +Method in class org.jgrapht.traverse.BreadthFirstIterator +
- +
- encounterVertexAgain(V, E) - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- Override superclass. +
- encounterVertexAgain(V, E) - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Called whenever we re-encounter a vertex. +
- encounterVertexAgain(V, E) - +Method in class org.jgrapht.traverse.DepthFirstIterator +
- +
- encounterVertexAgain(V, E) - +Method in class org.jgrapht.traverse.TopologicalOrderIterator +
- +
- END_VERTEX - +Static variable in class org.jgrapht.generate.LinearGraphGenerator +
- Role for the last vertex generated. +
- equals(Object) - +Method in class org.jgrapht.util.ArrayUnenforcedSet +
- +
- equals(Object) - +Method in class org.jgrapht.util.ModifiableInteger +
- Compares this object to the specified object. +
- EulerianCircuit - Class in org.jgrapht.alg
- This algorithm will check whether a graph is Eulerian (hence it contains an + Eulerian + circuit).
- EulerianCircuit() - +Constructor for class org.jgrapht.alg.EulerianCircuit +
- +
- export(Writer, Graph<V, E>) - +Method in class org.jgrapht.ext.DOTExporter +
- Exports a graph into a plain text file in DOT format. +
- export(Writer, UndirectedGraph<V, E>) - +Method in class org.jgrapht.ext.GmlExporter +
- Exports an undirected graph into a plain text file in GML format. +
- export(Writer, DirectedGraph<V, E>) - +Method in class org.jgrapht.ext.GmlExporter +
- Exports a directed graph into a plain text file in GML format. +
- export(Writer, Graph<V, E>) - +Method in class org.jgrapht.ext.GraphMLExporter +
- Exports a graph into a plain text file in GraphML format. +
- export(OutputStream, Graph<V, E>) - +Method in class org.jgrapht.ext.VisioExporter +
- Exports the specified graph into a Visio csv file format. +
- exportAdjacencyMatrix(Writer, UndirectedGraph<V, E>) - +Method in class org.jgrapht.ext.MatrixExporter +
- Exports the specified graph into a plain text file format containing a + sparse representation of the graph's adjacency matrix. +
- exportAdjacencyMatrix(Writer, DirectedGraph<V, E>) - +Method in class org.jgrapht.ext.MatrixExporter +
- Exports the specified graph into a plain text file format containing a + sparse representation of the graph's adjacency matrix. +
- exportLaplacianMatrix(Writer, UndirectedGraph<V, E>) - +Method in class org.jgrapht.ext.MatrixExporter +
- Exports the specified graph into a plain text file format containing a + sparse representation of the graph's Laplacian matrix. +
- exportNormalizedLaplacianMatrix(Writer, UndirectedGraph<V, E>) - +Method in class org.jgrapht.ext.MatrixExporter +
- Exports the specified graph into a plain text file format containing a + sparse representation of the graph's normalized Laplacian matrix. +
+
+F
+-
+
- factorial(int) - +Static method in class org.jgrapht.util.MathUtil +
- +
- FibonacciHeap<T> - Class in org.jgrapht.util
- This class implements a Fibonacci heap data structure.
- FibonacciHeap() - +Constructor for class org.jgrapht.util.FibonacciHeap +
- Constructs a FibonacciHeap object that contains no elements. +
- FibonacciHeapNode<T> - Class in org.jgrapht.util
- Implements a node of the Fibonacci heap.
- FibonacciHeapNode(T, double) - +Constructor for class org.jgrapht.util.FibonacciHeapNode +
- Default constructor. +
- find2ApproximationCover(Graph<V, E>) - +Static method in class org.jgrapht.alg.VertexCovers +
- Finds a 2-approximation for a minimal vertex cover of the specified + graph. +
- findCycles() - +Method in class org.jgrapht.alg.CycleDetector +
- Finds the vertex set for the subgraph of all cycles. +
- findCyclesContainingVertex(V) - +Method in class org.jgrapht.alg.CycleDetector +
- Finds the vertex set for the subgraph of all cycles which contain a + particular vertex. +
- findGreedyChromaticNumber(UndirectedGraph<V, E>) - +Static method in class org.jgrapht.alg.ChromaticNumber +
- Finds the number of colors required for a greedy coloring of the graph. +
- findGreedyCover(UndirectedGraph<V, E>) - +Static method in class org.jgrapht.alg.VertexCovers +
- Finds a greedy approximation for a minimal vertex cover of a specified + graph. +
- findPathBetween(Graph<V, E>, V, V) - +Static method in class org.jgrapht.alg.BellmanFordShortestPath +
- Convenience method to find the shortest path via a single static method + call. +
- findPathBetween(Graph<V, E>, V, V) - +Static method in class org.jgrapht.alg.DijkstraShortestPath +
- Convenience method to find the shortest path via a single static method + call. +
- finishVertex(V) - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Called when a vertex has been finished (meaning is dependent on traversal + represented by subclass). +
- fireConnectedComponentFinished(ConnectedComponentTraversalEvent) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Informs all listeners that the traversal of the current connected + component finished. +
- fireConnectedComponentStarted(ConnectedComponentTraversalEvent) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Informs all listeners that a traversal of a new connected component has + started. +
- fireEdgeAdded(E) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- Notify listeners that the specified edge was added. +
- fireEdgeRemoved(E) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- Notify listeners that the specified edge was removed. +
- fireEdgeTraversed(EdgeTraversalEvent<V, E>) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Informs all listeners that a the specified edge was visited. +
- fireVertexAdded(V) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- Notify listeners that the specified vertex was added. +
- fireVertexFinished(VertexTraversalEvent<V>) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Informs all listeners that a the specified vertex was finished. +
- fireVertexRemoved(V) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- Notify listeners that the specified vertex was removed. +
- fireVertexTraversed(VertexTraversalEvent<V>) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Informs all listeners that a the specified vertex was visited. +
- FIRST - +Static variable in interface org.jgrapht.util.WeightCombiner +
- First weight. +
- floatValue() - +Method in class org.jgrapht.util.ModifiableInteger +
- +
- FloydWarshallShortestPaths<V,E> - Class in org.jgrapht.alg
- The + Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in + O(n^3) time.
- FloydWarshallShortestPaths(Graph<V, E>) - +Constructor for class org.jgrapht.alg.FloydWarshallShortestPaths +
- Constructs the shortest path array for the given graph. +
+
+G
+-
+
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.CompleteBipartiteGraphGenerator +
- Construct a complete bipartite graph +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.CompleteGraphGenerator +
- Generate a graph structure. +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.EmptyGraphGenerator +
- Generate a graph structure. +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, T>) - +Method in interface org.jgrapht.generate.GraphGenerator +
- Generate a graph structure. +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.HyperCubeGraphGenerator +
- This will generate the hypercube graph +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.LinearGraphGenerator +
- Generate a graph structure. +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.RandomGraphGenerator +
- (non-Javadoc) +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.RingGraphGenerator +
- Generate a graph structure. +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.ScaleFreeGraphGenerator +
- Generates scale-free network with size passed to the + constructor. +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.StarGraphGenerator +
- Generates a star graph with the designated order from the constructor +
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - +Method in class org.jgrapht.generate.WheelGraphGenerator +
- Generate a graph structure. +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- getAllEdges(V, V) - +Method in interface org.jgrapht.Graph +
- Returns a set of all edges connecting source vertex to target vertex if + such vertices exist in this graph. +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- getAllEdges(V, V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- getAllMaximalCliques() - +Method in class org.jgrapht.alg.BronKerboschCliqueFinder +
- Finds all maximal cliques of the graph. +
- getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V, E>) - +Static method in class org.jgrapht.alg.HamiltonianCycle +
- This method will return an approximate minimal traveling salesman tour + (hamiltonian cycle). +
- getBase() - +Method in class org.jgrapht.graph.Subgraph +
- +
- getBiconnectedVertexComponents() - +Method in class org.jgrapht.alg.BiconnectivityInspector +
- Returns the biconnected vertex-components of the graph. +
- getBiconnectedVertexComponents(V) - +Method in class org.jgrapht.alg.BiconnectivityInspector +
- Returns the biconnected vertex-components containing the vertex. +
- getBiggestMaximalCliques() - +Method in class org.jgrapht.alg.BronKerboschCliqueFinder +
- Finds the biggest maximal cliques of the graph. +
- getBlock(V) - +Method in class org.jgrapht.alg.BlockCutpointGraph +
- Returns the vertex if vertex is a cutpoint, and otherwise returns the + block (biconnected component) containing the vertex. +
- getCellFactory() - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Returns the cell factory used to create the JGraph cells. +
- getCost(V) - +Method in class org.jgrapht.alg.BellmanFordShortestPath +
- +
- getCurrentSink() - +Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Returns current sink vertex, or null if there was no + calculateMaximumFlow calls. +
- getCurrentSource() - +Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Returns current source vertex, or null if there was no + calculateMaximumFlow calls. +
- getCutpoints() - +Method in class org.jgrapht.alg.BiconnectivityInspector +
- Returns the cutpoints of the graph. +
- getCutpoints() - +Method in class org.jgrapht.alg.BlockCutpointGraph +
- Returns the cutpoints of the initial graph. +
- getData() - +Method in class org.jgrapht.util.FibonacciHeapNode +
- Obtain the data for this node. +
- getDefaultEdgeAttributes() - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Returns the default edge attributes used for creating new JGraph edges. +
- getDefaultVertexAttributes() - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Returns the default vertex attributes used for creating new JGraph + vertices. +
- getDiameter() - +Method in class org.jgrapht.alg.FloydWarshallShortestPaths +
- +
- getEdge() - +Method in class org.jgrapht.event.EdgeTraversalEvent +
- Returns the traversed edge. +
- getEdge() - +Method in class org.jgrapht.event.GraphEdgeChangeEvent +
- Returns the edge that this event is related to. +
- getEdge(V, V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- getEdge(V, V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- getEdge(V, V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- getEdge(V, V) - +Method in interface org.jgrapht.Graph +
- Returns an edge connecting source vertex to target vertex if such + vertices and such edge exist in this graph. +
- getEdge(V, V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- getEdge(V, V) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getEdge(V, V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- getEdge(V, V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- getEdgeCell(E) - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Returns the JGraph edge cell that corresponds to the specified JGraphT + edge. +
- getEdgeCorrespondence(E, boolean) - +Method in class org.jgrapht.graph.DefaultGraphMapping +
- +
- getEdgeCorrespondence(E, boolean) - +Method in interface org.jgrapht.GraphMapping +
- Gets the mapped value where the key is
edge+ - getEdgeFactory() - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- getEdgeFactory() - +Method in interface org.jgrapht.Graph +
- Returns the edge factory using which this graph creates new edges. +
- getEdgeFactory() - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- getEdgeFactory() - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- getEdgeFactory() - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- getEdgeFactory() - +Method in class org.jgrapht.graph.Subgraph +
- +
- getEdgeList() - +Method in class org.jgrapht.graph.GraphPathImpl +
- +
- getEdgeList() - +Method in interface org.jgrapht.GraphPath +
- Returns the edges making up the path. +
- getEdgeName(E) - +Method in interface org.jgrapht.ext.EdgeNameProvider +
- Returns a unique name for an edge. +
- getEdgeName(E) - +Method in class org.jgrapht.ext.IntegerEdgeNameProvider +
- Returns the String representation of an edge. +
- getEdgeName(E) - +Method in class org.jgrapht.ext.StringEdgeNameProvider +
- Returns the String representation an edge. +
- getEdgeSource(E) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- getEdgeSource(E) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- getEdgeSource(E) - +Method in interface org.jgrapht.Graph +
- Returns the source vertex of an edge. +
- getEdgeSource(E) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- getEdgeSource(E) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getEdgeSource(E) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- getEdgeSource(E) - +Method in class org.jgrapht.graph.Subgraph +
- +
- getEdgeTarget(E) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- getEdgeTarget(E) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- getEdgeTarget(E) - +Method in interface org.jgrapht.Graph +
- Returns the target vertex of an edge. +
- getEdgeTarget(E) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- getEdgeTarget(E) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getEdgeTarget(E) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- getEdgeTarget(E) - +Method in class org.jgrapht.graph.Subgraph +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.AsUnweightedDirectedGraph +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.AsUnweightedGraph +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.AsWeightedGraph +
- +
- getEdgeWeight(E) - +Method in interface org.jgrapht.Graph +
- Returns the weight assigned to a given edge. +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- getEdgeWeight(E) - +Method in class org.jgrapht.graph.Subgraph +
- +
- getEndVertex() - +Method in class org.jgrapht.graph.GraphPathImpl +
- +
- getEndVertex() - +Method in interface org.jgrapht.GraphPath +
- Returns the end vertex in the path. +
- getEulerianCircuitVertices(UndirectedGraph<V, E>) - +Static method in class org.jgrapht.alg.EulerianCircuit +
- This method will return a list of vertices which represents the Eulerian + circuit of the graph. +
- getG1() - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getG2() - +Method in class org.jgrapht.graph.GraphUnion +
- +
- getGraph() - +Method in class org.jgrapht.alg.StrongConnectivityInspector +
- Returns the graph inspected by the StrongConnectivityInspector. +
- getGraph() - +Method in class org.jgrapht.graph.GraphPathImpl +
- +
- getGraph() - +Method in interface org.jgrapht.GraphPath +
- Returns the graph over which this path is defined. +
- getGraph() - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- +
- getKey() - +Method in class org.jgrapht.util.FibonacciHeapNode +
- Obtain the key for this node. +
- getMaxEdgesForVertexNum(Graph<VV, EE>) - +Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory +
- Return max edges for that graph. +
- getMaximumFlow() - +Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Returns maximum flow, that was calculated during last + calculateMaximumFlow call, or null, if there was no + calculateMaximumFlow calls. +
- getMaximumFlowValue() - +Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow +
- Returns maximum flow value, that was calculated during last + calculateMaximumFlow call, or null, if there was no + calculateMaximumFlow calls. +
- getOppositeVertex(Graph<V, E>, E, V) - +Static method in class org.jgrapht.Graphs +
- Gets the vertex opposite another vertex across an edge. +
- getPath() - +Method in class org.jgrapht.alg.DijkstraShortestPath +
- Return the path found. +
- getPathEdgeList(V) - +Method in class org.jgrapht.alg.BellmanFordShortestPath +
- +
- getPathEdgeList() - +Method in class org.jgrapht.alg.DijkstraShortestPath +
- Return the edges making up the path found. +
- getPathLength() - +Method in class org.jgrapht.alg.DijkstraShortestPath +
- Return the length of the path found. +
- getPaths(V) - +Method in class org.jgrapht.alg.KShortestPaths +
- Returns the k shortest simple paths in increasing order of weight. +
- getPathVertexList(GraphPath<V, E>) - +Static method in class org.jgrapht.Graphs +
- Gets the list of vertices visited by a path. +
- getPrintLabels() - +Method in class org.jgrapht.ext.GmlExporter +
- Get whether to export the vertex and edge labels. +
- getSeenData(V) - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Access the data stored for a seen vertex. +
- getShortestPathLength(V) - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- Get the length of the shortest path known to the given vertex. +
- getSource() - +Method in class org.jgrapht.graph.DefaultEdge +
- Retrieves the source of this edge. +
- getSpanningTreeEdge(V) - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- Get the spanning tree edge reaching a vertex which has been seen already + in this traversal. +
- getStack() - +Method in class org.jgrapht.traverse.DepthFirstIterator +
- Retrieves the LIFO stack of vertices which have been encountered but not + yet visited (WHITE). +
- getStartVertex() - +Method in class org.jgrapht.graph.GraphPathImpl +
- +
- getStartVertex() - +Method in interface org.jgrapht.GraphPath +
- Returns the start vertex in the path. +
- getTarget() - +Method in class org.jgrapht.graph.DefaultEdge +
- Retrieves the target of this edge. +
- getType() - +Method in class org.jgrapht.event.ConnectedComponentTraversalEvent +
- Returns the event type. +
- getType() - +Method in class org.jgrapht.event.GraphChangeEvent +
- Returns the event type. +
- getValue() - +Method in class org.jgrapht.util.ModifiableInteger +
- Returns the value of this object, similarly to
ModifiableInteger.intValue(). + - getVertex() - +Method in class org.jgrapht.event.GraphVertexChangeEvent +
- Returns the vertex that this event is related to. +
- getVertex() - +Method in class org.jgrapht.event.VertexTraversalEvent +
- Returns the traversed vertex. +
- getVertexCell(Object) - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Returns the JGraph vertex cell that corresponds to the specified JGraphT + vertex. +
- getVertexCorrespondence(V, boolean) - +Method in class org.jgrapht.graph.DefaultGraphMapping +
- +
- getVertexCorrespondence(V, boolean) - +Method in interface org.jgrapht.GraphMapping +
- Gets the mapped value where the key is
vertex+ - getVertexName(V) - +Method in class org.jgrapht.ext.IntegerNameProvider +
- Returns the String representation of the unique integer representing a + vertex. +
- getVertexName(V) - +Method in class org.jgrapht.ext.StringNameProvider +
- Returns the String representation of the unique integer representing a + vertex. +
- getVertexName(V) - +Method in interface org.jgrapht.ext.VertexNameProvider +
- Returns a unique name for a vertex. +
- getVertexPort(Object) - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Returns the JGraph port cell that corresponds to the specified JGraphT + vertex. +
- getWeight() - +Method in class org.jgrapht.graph.DefaultWeightedEdge +
- Retrieves the weight of this edge. +
- getWeight() - +Method in class org.jgrapht.graph.GraphPathImpl +
- +
- getWeight() - +Method in interface org.jgrapht.GraphPath +
- Returns the weight assigned to the path. +
- GmlExporter<V,E> - Class in org.jgrapht.ext
- Exports a graph into a GML file (Graph Modelling Language).
- GmlExporter() - +Constructor for class org.jgrapht.ext.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>, VertexNameProvider<V>, EdgeNameProvider<E>, EdgeNameProvider<E>) - +Constructor for class org.jgrapht.ext.GmlExporter +
- Constructs a new GmlExporter object with the given ID and label + providers. +
- graph - +Variable in class org.jgrapht.alg.BellmanFordShortestPath +
- Graph on which shortest paths are searched. +
- Graph<V,E> - Interface in org.jgrapht
- The root interface in the graph hierarchy.
- GraphChangeEvent - Class in org.jgrapht.event
- An event which indicates that a graph has changed.
- GraphChangeEvent(Object, int) - +Constructor for class org.jgrapht.event.GraphChangeEvent +
- Creates a new graph change event. +
- GraphDelegator<V,E> - Class in org.jgrapht.graph
- A graph backed by the the graph specified at the constructor, which delegates + all its methods to the backing graph.
- GraphDelegator(Graph<V, E>) - +Constructor for class org.jgrapht.graph.GraphDelegator +
- Constructor for GraphDelegator. +
- GraphEdgeChangeEvent<V,E> - Class in org.jgrapht.event
- An event which indicates that a graph edge has changed, or is about to + change.
- GraphEdgeChangeEvent(Object, int, E) - +Constructor for class org.jgrapht.event.GraphEdgeChangeEvent +
- Constructor for GraphEdgeChangeEvent. +
- GraphGenerator<V,E,T> - Interface in org.jgrapht.generate
- GraphGenerator defines an interface for generating new graph structures.
- GraphHelper - Class in org.jgrapht
- Deprecated. Use
Graphsinstead. - GraphHelper() - +Constructor for class org.jgrapht.GraphHelper +
- Deprecated. +
- GraphIterator<V,E> - Interface in org.jgrapht.traverse
- A graph iterator.
- GraphListener<V,E> - Interface in org.jgrapht.event
- A listener that is notified when the graph changes.
- GraphMapping<V,E> - Interface in org.jgrapht
- 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.
- GraphMLExporter<V,E> - Class in org.jgrapht.ext
- Exports a graph into a GraphML file.
- GraphMLExporter() - +Constructor for class org.jgrapht.ext.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>, VertexNameProvider<V>, EdgeNameProvider<E>, EdgeNameProvider<E>) - +Constructor for class org.jgrapht.ext.GraphMLExporter +
- Constructs a new GraphMLExporter object with the given ID and label + providers. +
- GraphPath<V,E> - Interface in org.jgrapht
- A GraphPath represents a
+ path in a
Graph. - GraphPathImpl<V,E> - Class in org.jgrapht.graph
- GraphPathImpl is a default implementation of
GraphPath. - GraphPathImpl(Graph<V, E>, V, V, List<E>, double) - +Constructor for class org.jgrapht.graph.GraphPathImpl +
- +
- Graphs - Class in org.jgrapht
- A collection of utilities to assist with graph manipulation.
- Graphs() - +Constructor for class org.jgrapht.Graphs +
- +
- GraphUnion<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph
- Read-only union of two graphs: G1 and G2.
- GraphUnion(G, G, WeightCombiner) - +Constructor for class org.jgrapht.graph.GraphUnion +
- +
- GraphUnion(G, G) - +Constructor for class org.jgrapht.graph.GraphUnion +
- +
- GraphVertexChangeEvent<V> - Class in org.jgrapht.event
- An event which indicates that a graph vertex has changed, or is about to + change.
- GraphVertexChangeEvent(Object, int, V) - +Constructor for class org.jgrapht.event.GraphVertexChangeEvent +
- Creates a new GraphVertexChangeEvent object. +
+
+H
+-
+
- HamiltonianCycle - Class in org.jgrapht.alg
- This class will deal with finding the optimal or approximately optimal + minimum tour (hamiltonian cycle) or commonly known as the Traveling + Salesman Problem.
- HamiltonianCycle() - +Constructor for class org.jgrapht.alg.HamiltonianCycle +
- +
- hashCode() - +Method in class org.jgrapht.util.ArrayUnenforcedSet +
- +
- hashCode() - +Method in class org.jgrapht.util.ModifiableInteger +
- Returns a hash code for this
ModifiableInteger. + - hasMoreElements() - +Method in class org.jgrapht.util.PrefetchIterator +
- If (isGetNextLastResultUpToDate==true) returns true else 1. +
- hasNext() - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- +
- hasNext() - +Method in class org.jgrapht.util.PrefetchIterator +
- +
- HelloJGraphT - Class in org.jgrapht.demo
- A simple introduction to using JGraphT.
- HUB_VERTEX - +Static variable in class org.jgrapht.generate.WheelGraphGenerator +
- Role for the hub vertex. +
- HyperCubeGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a hyper + cube graph of any size.
- HyperCubeGraphGenerator(int) - +Constructor for class org.jgrapht.generate.HyperCubeGraphGenerator +
- Creates a new HyperCubeGraphGenerator object. +
+
+I
+-
+
- incomingEdgesOf(V) - +Method in interface org.jgrapht.DirectedGraph +
- Returns a set of all edges incoming into the specified vertex. +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.DirectedGraphUnion +
- +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.DirectedSubgraph +
- +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- incomingEdgesOf(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- increment() - +Method in class org.jgrapht.util.ModifiableInteger +
- Adds one to the value of this modifiable integer. +
- inDegreeOf(V) - +Method in interface org.jgrapht.DirectedGraph +
- Returns the "in degree" of the specified vertex. +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.DirectedGraphUnion +
- +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.DirectedSubgraph +
- +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- inDegreeOf(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- init() - +Method in class org.jgrapht.demo.JGraphAdapterDemo +
- +
- insert(FibonacciHeapNode<T>, double) - +Method in class org.jgrapht.util.FibonacciHeap +
- Inserts a new data element into the heap. +
- INSTANCE - +Static variable in class org.jgrapht.alg.TransitiveClosure +
- Singleton instance. +
- IntegerEdgeNameProvider<E> - Class in org.jgrapht.ext
- Assigns a unique integer to represent each edge.
- IntegerEdgeNameProvider() - +Constructor for class org.jgrapht.ext.IntegerEdgeNameProvider +
- +
- IntegerNameProvider<V> - Class in org.jgrapht.ext
- Assigns a unique integer to represent each vertex.
- IntegerNameProvider() - +Constructor for class org.jgrapht.ext.IntegerNameProvider +
- +
- intValue() - +Method in class org.jgrapht.util.ModifiableInteger +
- +
- isAllowingLoops() - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- Returns
trueif and only if self-loops are allowed in this + graph. + - isAllowingMultipleEdges() - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- Returns
trueif and only if multiple edges are allowed in + this graph. + - isBiconnected() - +Method in class org.jgrapht.alg.BiconnectivityInspector +
- Returns
trueif the graph is biconnected (no cutpoint), +falseotherwise. + - isConnectedComponentExhausted() - +Method in class org.jgrapht.traverse.BreadthFirstIterator +
- +
- isConnectedComponentExhausted() - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- +
- isConnectedComponentExhausted() - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Returns true if there are no more uniterated vertices in the + currently iterated connected component; false otherwise. +
- isConnectedComponentExhausted() - +Method in class org.jgrapht.traverse.DepthFirstIterator +
- +
- isConnectedComponentExhausted() - +Method in class org.jgrapht.traverse.TopologicalOrderIterator +
- +
- isCrossComponentTraversal() - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Test whether this iterator is set to traverse the graph across connected + components. +
- isCrossComponentTraversal() - +Method in interface org.jgrapht.traverse.GraphIterator +
- Test whether this iterator is set to traverse the grpah across connected + components. +
- isCutpoint(V) - +Method in class org.jgrapht.alg.BlockCutpointGraph +
- Returns
trueif the vertex is a cutpoint,false+ otherwise. + - isEdgeMasked(E) - +Method in interface org.jgrapht.graph.MaskFunctor +
- Returns
trueif the edge is masked,false+ otherwise. + - isEmpty() - +Method in class org.jgrapht.util.FibonacciHeap +
- Tests if the Fibonacci heap is empty or not. +
- isEnumerationStartedEmpty() - +Method in class org.jgrapht.util.PrefetchIterator +
- Tests whether the enumeration started as an empty one. +
- isEulerian(UndirectedGraph<V, E>) - +Static method in class org.jgrapht.alg.EulerianCircuit +
- This method will check whether the graph passed in is Eulerian or not. +
- isGraphConnected() - +Method in class org.jgrapht.alg.ConnectivityInspector +
- Test if the inspected graph is connected. +
- isNumberOfEdgesValid(Graph<VV, EE>, int) - +Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory +
- checks if the numOfEdges is smaller than the Max edges according to + the following table: +
- isNumberOfEdgesValid(Graph<VV, EE>, int) - +Method in interface org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory +
- Checks if the graph can contain the givven numberOfEdges according to + the graph type restrictions. +
- isReuseEvents() - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- Tests whether the
reuseEventsflag is set. + - isReuseEvents() - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- +
- isReuseEvents() - +Method in interface org.jgrapht.traverse.GraphIterator +
- Tests whether the
reuseEventsflag is set. + - isSeenVertex(Object) - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Determines whether a vertex has been seen yet by this traversal. +
- isStronglyConnected() - +Method in class org.jgrapht.alg.StrongConnectivityInspector +
- Returns true if the graph of this
+ StronglyConnectivityInspectorinstance is strongly connected. + - isVertexMasked(V) - +Method in interface org.jgrapht.graph.MaskFunctor +
- Returns
trueif the vertex is masked,false+ otherwise. +
+
+J
+-
+
- JGraphAdapterDemo - Class in org.jgrapht.demo
- A demo applet that shows how to use JGraph to visualize JGraphT graphs.
- JGraphAdapterDemo() - +Constructor for class org.jgrapht.demo.JGraphAdapterDemo +
- +
- JGraphModelAdapter<V,E> - Class in org.jgrapht.ext
- An adapter that reflects a JGraphT graph as a JGraph graph.
- JGraphModelAdapter(Graph<V, E>) - +Constructor for class org.jgrapht.ext.JGraphModelAdapter +
- Constructs a new JGraph model adapter for the specified JGraphT graph. +
- JGraphModelAdapter(Graph<V, E>, AttributeMap, AttributeMap) - +Constructor for class org.jgrapht.ext.JGraphModelAdapter +
- Constructs a new JGraph model adapter for the specified JGraphT graph. +
- JGraphModelAdapter(Graph<V, E>, AttributeMap, AttributeMap, JGraphModelAdapter.CellFactory<V, E>) - +Constructor for class org.jgrapht.ext.JGraphModelAdapter +
- Constructs a new JGraph model adapter for the specified JGraphT graph. +
- JGraphModelAdapter.CellFactory<VV,EE> - Interface in org.jgrapht.ext
- Creates the JGraph cells that reflect the respective JGraphT elements.
- JGraphModelAdapter.DefaultCellFactory<VV,EE> - Class in org.jgrapht.ext
- A simple default cell factory.
- JGraphModelAdapter.DefaultCellFactory() - +Constructor for class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory +
- +
+
+K
+-
+
- KShortestPaths<V,E> - Class in org.jgrapht.alg
- The algorithm determines the k shortest simple paths in increasing order of + weight.
- KShortestPaths(Graph<V, E>, V, int) - +Constructor for class org.jgrapht.alg.KShortestPaths +
- Creates an object to compute ranking shortest paths between the start + vertex and others vertices. +
- KShortestPaths(Graph<V, E>, V, int, int) - +Constructor for class org.jgrapht.alg.KShortestPaths +
- Creates an object to calculate ranking shortest paths between the start + vertex and others vertices. +
+
+L
+-
+
- LinearGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a linear graph of any size.
- LinearGraphGenerator(int) - +Constructor for class org.jgrapht.generate.LinearGraphGenerator +
- Construct a new LinearGraphGenerator. +
- link(FibonacciHeapNode<T>, FibonacciHeapNode<T>) - +Method in class org.jgrapht.util.FibonacciHeap +
- Make node y a child of node x. +
- ListenableDirectedGraph<V,E> - Class in org.jgrapht.graph
- A directed graph which is also
ListenableGraph. - ListenableDirectedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.ListenableDirectedGraph +
- Creates a new listenable directed graph. +
- ListenableDirectedGraph(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.ListenableDirectedGraph +
- Creates a new listenable directed graph. +
- ListenableDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
- A directed weighted graph which is also
ListenableGraph. - ListenableDirectedWeightedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.ListenableDirectedWeightedGraph +
- Creates a new listenable directed weighted graph. +
- ListenableDirectedWeightedGraph(WeightedGraph<V, E>) - +Constructor for class org.jgrapht.graph.ListenableDirectedWeightedGraph +
- Creates a new listenable directed weighted graph. +
- ListenableGraph<V,E> - Interface in org.jgrapht
- A graph that supports listeners on structural change events.
- ListenableUndirectedGraph<V,E> - Class in org.jgrapht.graph
- An undirected graph which is also
ListenableGraph. - ListenableUndirectedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.ListenableUndirectedGraph +
- Creates a new listenable undirected simple graph. +
- ListenableUndirectedGraph(UndirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.ListenableUndirectedGraph +
- Creates a new listenable undirected graph. +
- ListenableUndirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
- An undirected weighted graph which is also
ListenableGraph. - ListenableUndirectedWeightedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.ListenableUndirectedWeightedGraph +
- Creates a new listenable undirected weighted graph. +
- ListenableUndirectedWeightedGraph(WeightedGraph<V, E>) - +Constructor for class org.jgrapht.graph.ListenableUndirectedWeightedGraph +
- Creates a new listenable undirected weighted graph. +
- longValue() - +Method in class org.jgrapht.util.ModifiableInteger +
- +
+
+M
+-
+
- main(String[]) - +Static method in class org.jgrapht.demo.CompleteGraphDemo +
- +
- main(String[]) - +Static method in class org.jgrapht.demo.HelloJGraphT +
- The starting point for the demo. +
- main(String[]) - +Static method in class org.jgrapht.demo.JGraphAdapterDemo +
- An alternative starting point for this demo, to also allow running this + applet as an application. +
- main(String[]) - +Static method in class org.jgrapht.demo.PerformanceDemo +
- The starting point for the demo. +
- MaskFunctor<V,E> - Interface in org.jgrapht.graph
- A functor interface for masking out vertices and edges of a graph.
- MaskSubgraph<V,E> - Class in org.jgrapht.graph
- An unmodifiable subgraph induced by a vertex/edge masking function.
- MaskSubgraph(Graph<V, E>, MaskFunctor<V, E>) - +Constructor for class org.jgrapht.graph.MaskSubgraph +
- Creates a new induced subgraph. +
- MathUtil - Class in org.jgrapht.util
- Math Utilities.
- MathUtil() - +Constructor for class org.jgrapht.util.MathUtil +
- +
- MatrixExporter<V,E> - Class in org.jgrapht.ext
- Exports a graph to a plain text matrix format, which can be processed by + matrix manipulation software, such as + MTJ or MATLAB.
- MatrixExporter() - +Constructor for class org.jgrapht.ext.MatrixExporter +
- Creates a new MatrixExporter object. +
- MAX - +Static variable in interface org.jgrapht.util.WeightCombiner +
- Maximum weight. +
- min() - +Method in class org.jgrapht.util.FibonacciHeap +
- Returns the smallest element in the heap. +
- MIN - +Static variable in interface org.jgrapht.util.WeightCombiner +
- Minimum weight. +
- ModifiableInteger - Class in org.jgrapht.util
- The
ModifiableIntegerclass wraps a value of the primitive type +intin an object, similarly toInteger. - ModifiableInteger() - +Constructor for class org.jgrapht.util.ModifiableInteger +
- Deprecated. not really deprecated, just marked so to avoid mistaken use. +
- ModifiableInteger(int) - +Constructor for class org.jgrapht.util.ModifiableInteger +
- Constructs a newly allocated
ModifiableIntegerobject that + represents the specifiedintvalue. + - Multigraph<V,E> - Class in org.jgrapht.graph
- A multigraph.
- Multigraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.Multigraph +
- Creates a new multigraph. +
- Multigraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.Multigraph +
- Creates a new multigraph with the specified edge factory. +
+
+N
+-
+
- NeighborIndex<V,E> - Class in org.jgrapht.alg
- Maintains a cache of each vertex's neighbors.
- NeighborIndex(Graph<V, E>) - +Constructor for class org.jgrapht.alg.NeighborIndex +
- Creates a neighbor index for the specified undirected graph. +
- neighborListOf(V) - +Method in class org.jgrapht.alg.NeighborIndex +
- Returns a list of vertices which are adjacent to a specified vertex. +
- neighborListOf(Graph<V, E>, V) - +Static method in class org.jgrapht.Graphs +
- Returns a list of vertices that are the neighbors of a specified vertex. +
- neighborsOf(V) - +Method in class org.jgrapht.alg.NeighborIndex +
- Returns the set of vertices which are adjacent to a specified vertex. +
- next() - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- +
- next() - +Method in class org.jgrapht.util.PrefetchIterator +
- +
- nextElement() - +Method in class org.jgrapht.util.PrefetchIterator +
- 1. +
- nextElement() - +Method in interface org.jgrapht.util.PrefetchIterator.NextElementFunctor +
- You must implement that NoSuchElementException is thrown on + nextElement() if it is out of bound. +
- nListeners - +Variable in class org.jgrapht.traverse.AbstractGraphIterator +
- +
- numOfEdges - +Variable in class org.jgrapht.generate.RandomGraphGenerator +
- +
- numOfVertexes - +Variable in class org.jgrapht.generate.RandomGraphGenerator +
- +
+
+O
+-
+
- org.jgrapht - package org.jgrapht
- The front-end API's interfaces and classes, including
Graph, +DirectedGraphandUndirectedGraph. - org.jgrapht.alg - package org.jgrapht.alg
- Algorithms provided with JGraphT.
- org.jgrapht.alg.util - package org.jgrapht.alg.util
- Utilities used by JGraphT algorithms.
- org.jgrapht.demo - package org.jgrapht.demo
- Demo programs that help to get started with JGraphT.
- org.jgrapht.event - package org.jgrapht.event
- Event classes and listener interfaces, used to provide a change +notification mechanism on graph modification events.
- org.jgrapht.ext - package org.jgrapht.ext
- +Extensions and integration means to other products.
- org.jgrapht.generate - package org.jgrapht.generate
- Generators for graphs of various topologies.
- org.jgrapht.graph - package org.jgrapht.graph
- Implementations of various graphs.
- org.jgrapht.traverse - package org.jgrapht.traverse
- Graph traversal means.
- org.jgrapht.util - package org.jgrapht.util
- Non-graph-specific data structures, algorithms, and utilities used by +JGraphT.
- outDegreeOf(V) - +Method in interface org.jgrapht.DirectedGraph +
- Returns the "out degree" of the specified vertex. +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.DirectedGraphUnion +
- +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.DirectedSubgraph +
- +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- outDegreeOf(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- outgoingEdgesOf(V) - +Method in interface org.jgrapht.DirectedGraph +
- Returns a set of all edges outgoing from the specified vertex. +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.DirectedGraphUnion +
- +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.DirectedSubgraph +
- +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- outgoingEdgesOf(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
+
+P
+-
+
- ParanoidGraph<V,E> - Class in org.jgrapht.graph
- ParanoidGraph provides a way to verify that objects added to a graph obey the + standard equals/hashCode contract.
- ParanoidGraph(Graph<V, E>) - +Constructor for class org.jgrapht.graph.ParanoidGraph +
- +
- pathExists(V, V) - +Method in class org.jgrapht.alg.ConnectivityInspector +
- Tests if there is a path from the specified source vertex to the + specified target vertices. +
- PerformanceDemo - Class in org.jgrapht.demo
- A simple demo to test memory and CPU consumption on a graph with 3 million + elements.
- PerformanceDemo() - +Constructor for class org.jgrapht.demo.PerformanceDemo +
- +
- predecessorListOf(V) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- Returns the set of vertices which are the predecessors of a specified + vertex. +
- predecessorListOf(DirectedGraph<V, E>, V) - +Static method in class org.jgrapht.Graphs +
- Returns a list of vertices that are the direct predecessors of a + specified vertex. +
- predecessorsOf(V) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- Returns the set of vertices which are the predecessors of a specified + vertex. +
- PrefetchIterator<E> - Class in org.jgrapht.util
- Utility class to help implement an iterator/enumerator in which the hasNext() + method needs to calculate the next elements ahead of time.
- PrefetchIterator(PrefetchIterator.NextElementFunctor<E>) - +Constructor for class org.jgrapht.util.PrefetchIterator +
- +
- PrefetchIterator.NextElementFunctor<EE> - Interface in org.jgrapht.util
- PRINT_EDGE_LABELS - +Static variable in class org.jgrapht.ext.GmlExporter +
- Option to export only the edge labels. +
- PRINT_EDGE_VERTEX_LABELS - +Static variable in class org.jgrapht.ext.GmlExporter +
- Option to export both edge and vertex labels. +
- PRINT_NO_LABELS - +Static variable in class org.jgrapht.ext.GmlExporter +
- Option to export no vertex or edge labels. +
- PRINT_VERTEX_LABELS - +Static variable in class org.jgrapht.ext.GmlExporter +
- Option to export only the vertex labels. +
- provideNextVertex() - +Method in class org.jgrapht.traverse.BreadthFirstIterator +
- +
- provideNextVertex() - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- +
- provideNextVertex() - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Returns the vertex to be returned in the following call to the iterator
+
nextmethod. + - provideNextVertex() - +Method in class org.jgrapht.traverse.DepthFirstIterator +
- +
- provideNextVertex() - +Method in class org.jgrapht.traverse.TopologicalOrderIterator +
- +
- Pseudograph<V,E> - Class in org.jgrapht.graph
- A pseudograph.
- Pseudograph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.Pseudograph +
- Creates a new pseudograph. +
- Pseudograph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.Pseudograph +
- Creates a new pseudograph with the specified edge factory. +
- putSeenData(V, D) - +Method in class org.jgrapht.traverse.CrossComponentIterator +
- Stores iterator-dependent data for a vertex that has been seen. +
+
+R
+-
+
- RandomGraphGenerator<V,E> - Class in org.jgrapht.generate
- This Generator creates a random-topology graph of a specified number of + vertexes and edges.
- RandomGraphGenerator(int, int) - +Constructor for class org.jgrapht.generate.RandomGraphGenerator +
- +
- RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE> - Class in org.jgrapht.generate
- Default implementation of the EdgeTopologyFactory interface.
- RandomGraphGenerator.DefaultEdgeTopologyFactory() - +Constructor for class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory +
- +
- RandomGraphGenerator.EdgeTopologyFactory<VV,EE> - Interface in org.jgrapht.generate
- This class is used to generate the edge topology for a graph.
- randomizer - +Variable in class org.jgrapht.generate.RandomGraphGenerator +
- +
- remove() - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Unsupported. +
- remove() - +Method in interface org.jgrapht.traverse.GraphIterator +
- Unsupported. +
- remove() - +Method in class org.jgrapht.util.PrefetchIterator +
- Always throws UnsupportedOperationException. +
- removeAllEdges(Collection<? extends E>) - +Method in class org.jgrapht.graph.AbstractGraph +
- +
- removeAllEdges(V, V) - +Method in class org.jgrapht.graph.AbstractGraph +
- +
- removeAllEdges(E[]) - +Method in class org.jgrapht.graph.AbstractGraph +
- Removes all the edges in this graph that are also contained in the + specified edge array. +
- removeAllEdges(Collection<? extends E>) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- removeAllEdges(V, V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- removeAllEdges(Collection<? extends E>) - +Method in interface org.jgrapht.Graph +
- Removes all the edges in this graph that are also contained in the + specified edge collection. +
- removeAllEdges(V, V) - +Method in interface org.jgrapht.Graph +
- Removes all the edges going from the specified source vertex to the + specified target vertex, and returns a set of all removed edges. +
- removeAllEdges(Collection<? extends E>) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- removeAllEdges(V, V) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- removeAllVertices(Collection<? extends V>) - +Method in class org.jgrapht.graph.AbstractGraph +
- +
- removeAllVertices(Collection<? extends V>) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- removeAllVertices(Collection<? extends V>) - +Method in interface org.jgrapht.Graph +
- Removes all the vertices in this graph that are also contained in the + specified vertex collection. +
- removeAllVertices(Collection<? extends V>) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- removeEdge(E) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- removeEdge(E) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- removeEdge(E) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- removeEdge(E) - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- removeEdge(E) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- removeEdge(V, V) - +Method in interface org.jgrapht.Graph +
- Removes an edge going from source vertex to target vertex, if such + vertices and such edge exist in this graph. +
- removeEdge(E) - +Method in interface org.jgrapht.Graph +
- Removes the specified edge from the graph. +
- removeEdge(E) - +Method in class org.jgrapht.graph.Subgraph +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- removeEdge(E) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- removeEdge(V, V) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- removeGraphListener(GraphListener<V, E>) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- removeGraphListener(GraphListener<V, E>) - +Method in interface org.jgrapht.ListenableGraph +
- Removes the specified graph listener from this graph, if present. +
- removeMin() - +Method in class org.jgrapht.util.FibonacciHeap +
- Removes the smallest element from the heap. +
- removeTraversalListener(TraversalListener<V, E>) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Removes the specified traversal listener from this iterator. +
- removeTraversalListener(TraversalListener<V, E>) - +Method in interface org.jgrapht.traverse.GraphIterator +
- Removes the specified traversal listener from this iterator. +
- removeVertex(V) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- removeVertex(V) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- removeVertex(V) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- removeVertex(V) - +Method in class org.jgrapht.graph.GraphUnion +
- Throws UnsupportedOperationException, because + GraphUnion is read-only. +
- removeVertex(V) - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- removeVertex(V) - +Method in interface org.jgrapht.Graph +
- Removes the specified vertex from this graph including all its touching + edges if present. +
- removeVertex(V) - +Method in class org.jgrapht.graph.Subgraph +
- +
- removeVertex(V) - +Method in class org.jgrapht.graph.UnmodifiableGraph +
- +
- removeVertexSetListener(VertexSetListener<V>) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- +
- removeVertexSetListener(VertexSetListener<V>) - +Method in interface org.jgrapht.ListenableGraph +
- Removes the specified vertex set listener from this graph, if present. +
- replaceVertex(Object, Object) - +Static method in class org.jgrapht.demo.CompleteGraphDemo +
- +
- RingGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a ring graph of any size.
- RingGraphGenerator(int) - +Constructor for class org.jgrapht.generate.RingGraphGenerator +
- Construct a new RingGraphGenerator. +
+
+S
+-
+
- ScaleFreeGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates directed or undirected scale-free network + of any size.
- ScaleFreeGraphGenerator(int) - +Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator +
- Constructs a new ScaleFreeGraphGenerator. +
- ScaleFreeGraphGenerator(int, long) - +Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator +
- Constructs a new ScaleFreeGraphGenerator using fixed + seed for the random generator. +
- SECOND - +Static variable in interface org.jgrapht.util.WeightCombiner +
- Second weight. +
- SENTINEL - +Static variable in class org.jgrapht.traverse.DepthFirstIterator +
- Sentinel object. +
- setCrossComponentTraversal(boolean) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- Sets the cross component traversal flag - indicates whether to traverse + the graph across connected components. +
- setCrossComponentTraversal(boolean) - +Method in class org.jgrapht.traverse.ClosestFirstIterator +
- +
- setDefaultEdgeAttributes(AttributeMap) - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Sets the default edge attributes used for creating new JGraph edges. +
- setDefaultVertexAttributes(AttributeMap) - +Method in class org.jgrapht.ext.JGraphModelAdapter +
- Sets the default vertex attributes used for creating new JGraph vertices. +
- setEdgeSetFactory(EdgeSetFactory<V, E>) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- Set the
EdgeSetFactoryto use for this graph. + - setEdgeWeight(E, double) - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- setEdgeWeight(E, double) - +Method in class org.jgrapht.graph.AsWeightedGraph +
- +
- setEdgeWeight(E, double) - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- setEdgeWeight(E, double) - +Method in class org.jgrapht.graph.Subgraph +
- +
- setEdgeWeight(E, double) - +Method in interface org.jgrapht.WeightedGraph +
- Assigns a weight to an edge. +
- setPrintLabels(Integer) - +Method in class org.jgrapht.ext.GmlExporter +
- Set whether to export the vertex and edge labels. +
- setReuseEvents(boolean) - +Method in class org.jgrapht.graph.DefaultListenableGraph +
- If the
reuseEventsflag is set totruethis + class will reuse previously fired events and will not create a new object + for each event. + - setReuseEvents(boolean) - +Method in class org.jgrapht.traverse.AbstractGraphIterator +
- +
- setReuseEvents(boolean) - +Method in interface org.jgrapht.traverse.GraphIterator +
- Sets a value the
reuseEventsflag. + - setValue(int) - +Method in class org.jgrapht.util.ModifiableInteger +
- Sets a new value for this modifiable integer. +
- shortestDistance(V, V) - +Method in class org.jgrapht.alg.FloydWarshallShortestPaths +
- Retrieves the shortest distance between two vertices. +
- SimpleDirectedGraph<V,E> - Class in org.jgrapht.graph
- A simple directed graph.
- SimpleDirectedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.SimpleDirectedGraph +
- Creates a new simple directed graph. +
- SimpleDirectedGraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.SimpleDirectedGraph +
- Creates a new simple directed graph with the specified edge factory. +
- SimpleDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
- A simple directed weighted graph.
- SimpleDirectedWeightedGraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph +
- Creates a new simple directed weighted graph with the specified edge + factory. +
- SimpleDirectedWeightedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph +
- Creates a new simple directed weighted graph. +
- SimpleGraph<V,E> - Class in org.jgrapht.graph
- A simple graph.
- SimpleGraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.SimpleGraph +
- Creates a new simple graph with the specified edge factory. +
- SimpleGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.SimpleGraph +
- Creates a new simple graph. +
- SimpleWeightedGraph<V,E> - Class in org.jgrapht.graph
- A simple weighted graph.
- SimpleWeightedGraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.SimpleWeightedGraph +
- Creates a new simple weighted graph with the specified edge factory. +
- SimpleWeightedGraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.SimpleWeightedGraph +
- Creates a new simple weighted graph. +
- size() - +Method in class org.jgrapht.util.FibonacciHeap +
- Returns the size of the heap which is measured in the number of elements + contained in the heap. +
- StarGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a star + graph of any size.
- StarGraphGenerator(int) - +Constructor for class org.jgrapht.generate.StarGraphGenerator +
- Creates a new StarGraphGenerator object. +
- START_VERTEX - +Static variable in class org.jgrapht.generate.LinearGraphGenerator +
- Role for the first vertex generated. +
- startVertex - +Variable in class org.jgrapht.alg.BellmanFordShortestPath +
- Start vertex. +
- StringEdgeNameProvider<E> - Class in org.jgrapht.ext
- Generates edge names by invoking
Object.toString()on them. - StringEdgeNameProvider() - +Constructor for class org.jgrapht.ext.StringEdgeNameProvider +
- +
- StringNameProvider<V> - Class in org.jgrapht.ext
- Generates vertex names by invoking
Object.toString()on them. - StringNameProvider() - +Constructor for class org.jgrapht.ext.StringNameProvider +
- +
- StrongConnectivityInspector<V,E> - Class in org.jgrapht.alg
- Complements the
ConnectivityInspectorclass with + the capability to compute the strongly connected components of a directed + graph. - StrongConnectivityInspector(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.StrongConnectivityInspector +
- The constructor of the StrongConnectivityInspector class. +
- stronglyConnectedSets() - +Method in class org.jgrapht.alg.StrongConnectivityInspector +
- Computes a
ListofSets, where each set contains vertices + which together form a strongly connected component within the given + graph. + - stronglyConnectedSubgraphs() - +Method in class org.jgrapht.alg.StrongConnectivityInspector +
- Computes a list of
DirectedSubgraphs of the given graph. + - Subgraph<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph
- A subgraph is a graph that has a subset of vertices and a subset of edges + with respect to some base graph.
- Subgraph(G, Set<V>, Set<E>) - +Constructor for class org.jgrapht.graph.Subgraph +
- Creates a new Subgraph. +
- Subgraph(G, Set<V>) - +Constructor for class org.jgrapht.graph.Subgraph +
- Creates a new induced Subgraph. +
- successorListOf(V) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- Returns the set of vertices which are the successors of a specified + vertex. +
- successorListOf(DirectedGraph<V, E>, V) - +Static method in class org.jgrapht.Graphs +
- Returns a list of vertices that are the direct successors of a specified + vertex. +
- successorsOf(V) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- Returns the set of vertices which are the successors of a specified + vertex. +
- SUM - +Static variable in interface org.jgrapht.util.WeightCombiner +
- Sum of weights. +
+
+T
+-
+
- testIncidence(Graph<V, E>, E, V) - +Static method in class org.jgrapht.Graphs +
- Tests whether an edge is incident to a vertex. +
- toInteger() - +Method in class org.jgrapht.util.ModifiableInteger +
- Returns an
Integerobject representing this+ ModifiableInteger's value. + - TopologicalOrderIterator<V,E> - Class in org.jgrapht.traverse
- Implements topological order traversal for a directed acyclic graph.
- TopologicalOrderIterator(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.traverse.TopologicalOrderIterator +
- Creates a new topological order iterator over the directed graph + specified, with arbitrary tie-breaking in case of partial order. +
- TopologicalOrderIterator(DirectedGraph<V, E>, Queue<V>) - +Constructor for class org.jgrapht.traverse.TopologicalOrderIterator +
- 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. +
- toString() - +Method in class org.jgrapht.graph.AbstractGraph +
- Returns a string of the parenthesized pair (V, E) representing this + G=(V,E) graph. +
- toString() - +Method in class org.jgrapht.graph.AsUndirectedGraph +
- +
- toString() - +Method in class org.jgrapht.graph.DefaultEdge +
- +
- toString() - +Method in class org.jgrapht.graph.EdgeReversedGraph +
- +
- toString() - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- toString() - +Method in class org.jgrapht.graph.GraphPathImpl +
- +
- toString() - +Method in class org.jgrapht.util.FibonacciHeap +
- Creates a String representation of this Fibonacci heap. +
- toString() - +Method in class org.jgrapht.util.FibonacciHeapNode +
- Return the string representation of this object. +
- toString() - +Method in class org.jgrapht.util.ModifiableInteger +
- Returns a
Stringobject representing this+ ModifiableInteger's value. + - toStringFromSets(Collection<? extends V>, Collection<? extends E>, boolean) - +Method in class org.jgrapht.graph.AbstractGraph +
- Helper for subclass implementations of toString( ). +
- TransitiveClosure - Class in org.jgrapht.alg
- Constructs the transitive closure of the input graph.
- TraversalListener<V,E> - Interface in org.jgrapht.event
- A listener on graph iterator or on a graph traverser.
- TraversalListenerAdapter<V,E> - Class in org.jgrapht.event
- An empty do-nothing implementation of the
TraversalListenerinterface + used for subclasses. - TraversalListenerAdapter() - +Constructor for class org.jgrapht.event.TraversalListenerAdapter +
- +
- type - +Variable in class org.jgrapht.event.GraphChangeEvent +
- The type of graph change this event indicates. +
- TypeUtil<T> - Class in org.jgrapht.util
- TypeUtil isolates type-unsafety so that code that which uses it for + legitimate reasons can stay warning-free.
- TypeUtil() - +Constructor for class org.jgrapht.util.TypeUtil +
- +
+
+U
+-
+
- uncheckedCast(Object, TypeUtil<T>) - +Static method in class org.jgrapht.util.TypeUtil +
- Casts an object to a type. +
- undirectedGraph(Graph<V, E>) - +Static method in class org.jgrapht.Graphs +
- Returns an undirected view of the specified graph. +
- UndirectedGraph<V,E> - Interface in org.jgrapht
- A graph whose all edges are undirected.
- UndirectedGraphUnion<V,E> - Class in org.jgrapht.graph
- UndirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph
- An undirected graph that is a
MaskSubgraphon another graph. - UndirectedMaskSubgraph(UndirectedGraph<V, E>, MaskFunctor<V, E>) - +Constructor for class org.jgrapht.graph.UndirectedMaskSubgraph +
- +
- UndirectedSubgraph<V,E> - Class in org.jgrapht.graph
- An undirected graph that is a subgraph on other graph.
- UndirectedSubgraph(UndirectedGraph<V, E>, Set<V>, Set<E>) - +Constructor for class org.jgrapht.graph.UndirectedSubgraph +
- Creates a new undirected subgraph. +
- UndirectedWeightedSubgraph<V,E> - Class in org.jgrapht.graph
- An undirected weighted graph that is a subgraph on other graph.
- UndirectedWeightedSubgraph(WeightedGraph<V, E>, Set<V>, Set<E>) - +Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph +
- Creates a new undirected weighted subgraph. +
- union(FibonacciHeap<T>, FibonacciHeap<T>) - +Static method in class org.jgrapht.util.FibonacciHeap +
- Joins two Fibonacci heaps into a new one. +
- UnmodifiableDirectedGraph<V,E> - Class in org.jgrapht.graph
- A directed graph that cannot be modified.
- UnmodifiableDirectedGraph(DirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.UnmodifiableDirectedGraph +
- Creates a new unmodifiable directed graph based on the specified backing + graph. +
- UnmodifiableGraph<V,E> - Class in org.jgrapht.graph
- An unmodifiable view of the backing graph specified in the constructor.
- UnmodifiableGraph(Graph<V, E>) - +Constructor for class org.jgrapht.graph.UnmodifiableGraph +
- Creates a new unmodifiable graph based on the specified backing graph. +
- UnmodifiableUndirectedGraph<V,E> - Class in org.jgrapht.graph
- An undirected graph that cannot be modified.
- UnmodifiableUndirectedGraph(UndirectedGraph<V, E>) - +Constructor for class org.jgrapht.graph.UnmodifiableUndirectedGraph +
- Creates a new unmodifiable undirected graph based on the specified + backing graph. +
+
+V
+-
+
- value - +Variable in class org.jgrapht.util.ModifiableInteger +
- The int value represented by this
ModifiableInteger. + - valueOf(String) - +Static method in enum org.jgrapht.traverse.CrossComponentIterator.VisitColor +
- Returns the enum constant of this type with the specified name. +
- values() - +Static method in enum org.jgrapht.traverse.CrossComponentIterator.VisitColor +
- Returns an array containing the constants of this enum type, in +the order they are declared. +
- vertex - +Variable in class org.jgrapht.event.GraphVertexChangeEvent +
- The vertex that this event is related to. +
- vertex - +Variable in class org.jgrapht.event.VertexTraversalEvent +
- The traversed vertex. +
- VERTEX_ADDED - +Static variable in class org.jgrapht.event.GraphVertexChangeEvent +
- Vertex added event. +
- VERTEX_REMOVED - +Static variable in class org.jgrapht.event.GraphVertexChangeEvent +
- Vertex removed event. +
- vertexAdded(GraphVertexChangeEvent<V>) - +Method in class org.jgrapht.alg.ConnectivityInspector +
- +
- vertexAdded(GraphVertexChangeEvent<V>) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- +
- vertexAdded(GraphVertexChangeEvent<V>) - +Method in class org.jgrapht.alg.NeighborIndex +
- +
- vertexAdded(GraphVertexChangeEvent<V>) - +Method in interface org.jgrapht.event.VertexSetListener +
- Notifies that a vertex has been added to the graph. +
- VertexCovers - Class in org.jgrapht.alg
- Algorithms to find a vertex cover for a graph.
- VertexCovers() - +Constructor for class org.jgrapht.alg.VertexCovers +
- +
- VertexDegreeComparator<V,E> - Class in org.jgrapht.alg.util
- Compares two vertices based on their degree.
- VertexDegreeComparator(UndirectedGraph<V, E>) - +Constructor for class org.jgrapht.alg.util.VertexDegreeComparator +
- Creates a comparator for comparing the degrees of vertices in the + specified graph. +
- VertexDegreeComparator(UndirectedGraph<V, E>, boolean) - +Constructor for class org.jgrapht.alg.util.VertexDegreeComparator +
- Creates a comparator for comparing the degrees of vertices in the + specified graph. +
- VertexFactory<V> - Interface in org.jgrapht
- A vertex factory used by graph algorithms for creating new vertices.
- vertexFinished(VertexTraversalEvent<V>) - +Method in interface org.jgrapht.event.TraversalListener +
- Called to inform the listener that the specified vertex have been + finished during the graph traversal. +
- vertexFinished(VertexTraversalEvent<V>) - +Method in class org.jgrapht.event.TraversalListenerAdapter +
- +
- VertexNameProvider<V> - Interface in org.jgrapht.ext
- Assigns a display name for each of the graph vertices.
- vertexRemoved(GraphVertexChangeEvent<V>) - +Method in class org.jgrapht.alg.ConnectivityInspector +
- +
- vertexRemoved(GraphVertexChangeEvent<V>) - +Method in class org.jgrapht.alg.DirectedNeighborIndex +
- +
- vertexRemoved(GraphVertexChangeEvent<V>) - +Method in class org.jgrapht.alg.NeighborIndex +
- +
- vertexRemoved(GraphVertexChangeEvent<V>) - +Method in interface org.jgrapht.event.VertexSetListener +
- Notifies that a vertex has been removed from the graph. +
- vertexSet() - +Method in class org.jgrapht.graph.AbstractBaseGraph +
- +
- vertexSet() - +Method in class org.jgrapht.graph.GraphDelegator +
- +
- vertexSet() - +Method in class org.jgrapht.graph.GraphUnion +
- +
- vertexSet() - +Method in class org.jgrapht.graph.MaskSubgraph +
- +
- vertexSet() - +Method in class org.jgrapht.graph.Subgraph +
- +
- vertexSet() - +Method in interface org.jgrapht.Graph +
- Returns a set of the vertices contained in this graph. +
- VertexSetListener<V> - Interface in org.jgrapht.event
- A listener that is notified when the graph's vertex set changes.
- VertexTraversalEvent<V> - Class in org.jgrapht.event
- A traversal event for a graph vertex.
- VertexTraversalEvent(Object, V) - +Constructor for class org.jgrapht.event.VertexTraversalEvent +
- Creates a new VertexTraversalEvent. +
- vertexTraversed(VertexTraversalEvent<V>) - +Method in interface org.jgrapht.event.TraversalListener +
- Called to inform the listener that the specified vertex have been visited + during the graph traversal. +
- vertexTraversed(VertexTraversalEvent<V>) - +Method in class org.jgrapht.event.TraversalListenerAdapter +
- +
- VisioExporter<V,E> - Class in org.jgrapht.ext
- Exports a graph to a csv format that can be imported into MS Visio.
- VisioExporter(VertexNameProvider<V>) - +Constructor for class org.jgrapht.ext.VisioExporter +
- Creates a new VisioExporter object with the specified naming policy. +
- VisioExporter() - +Constructor for class org.jgrapht.ext.VisioExporter +
- Creates a new VisioExporter object. +
+
+W
+-
+
- WeightCombiner - Interface in org.jgrapht.util
- Binary operator for edge weights.
- WeightedGraph<V,E> - Interface in org.jgrapht
- An interface for a graph whose edges have non-uniform weights.
- WeightedMultigraph<V,E> - Class in org.jgrapht.graph
- A weighted multigraph.
- WeightedMultigraph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.WeightedMultigraph +
- Creates a new weighted multigraph with the specified edge factory. +
- WeightedMultigraph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.WeightedMultigraph +
- Creates a new weighted multigraph. +
- WeightedPseudograph<V,E> - Class in org.jgrapht.graph
- A weighted pseudograph.
- WeightedPseudograph(EdgeFactory<V, E>) - +Constructor for class org.jgrapht.graph.WeightedPseudograph +
- Creates a new weighted pseudograph with the specified edge factory. +
- WeightedPseudograph(Class<? extends E>) - +Constructor for class org.jgrapht.graph.WeightedPseudograph +
- Creates a new weighted pseudograph. +
- weightMap - +Variable in class org.jgrapht.graph.AsWeightedGraph +
- +
- WheelGraphGenerator<V,E> - Class in org.jgrapht.generate
- Generates a wheel + graph of any size.
- WheelGraphGenerator(int) - +Constructor for class org.jgrapht.generate.WheelGraphGenerator +
- Creates a new WheelGraphGenerator object. +
- WheelGraphGenerator(int, boolean) - +Constructor for class org.jgrapht.generate.WheelGraphGenerator +
- Construct a new WheelGraphGenerator. +
+A B C D E F G H I J K L M N O P R S T U V W + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/index.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/index.html new file mode 100644 index 00000000..e320901f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/index.html @@ -0,0 +1,39 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface DirectedGraph<V,E>
+-
+
- All Superinterfaces:
- Graph<V,E> +
-
+
- All Known Implementing Classes:
- AsUnweightedDirectedGraph, DefaultDirectedGraph, DefaultDirectedWeightedGraph, DirectedGraphUnion, DirectedMaskSubgraph, DirectedMultigraph, DirectedPseudograph, DirectedSubgraph, DirectedWeightedMultigraph, DirectedWeightedSubgraph, EdgeReversedGraph, ListenableDirectedGraph, ListenableDirectedWeightedGraph, SimpleDirectedGraph, SimpleDirectedWeightedGraph, UnmodifiableDirectedGraph +
+
-
+
public interface DirectedGraph<V,E>
- extends Graph<V,E>
+A graph whose all edges are directed. This is the root interface of all + directed graphs. + +
See + http://mathworld.wolfram.com/DirectedGraph.html for more on directed + graphs.
++ +
+
-
+
- Since: +
- Jul 14, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ java.util.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. |
+
+ java.util.Set<E> |
+outgoingEdgesOf(V vertex)
+
++ Returns a set of all edges outgoing from the specified vertex. |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Method Detail | +
|---|
+inDegreeOf
++int inDegreeOf(V vertex)+
-
+
- Returns the "in degree" of the specified vertex. An in degree of a vertex
+ in a directed graph is the number of inward directed edges from that
+ vertex. See
+ http://mathworld.wolfram.com/Indegree.html.
+
+
-
+
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
+ +
+incomingEdgesOf
++java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
- Returns a set of all edges incoming into the specified vertex.
+
+
-
+
-
+
- Parameters:
vertex- the vertex for which the list of incoming edges to be + returned. +- Returns:
- a set of all edges incoming into the specified vertex.
+ +
+outDegreeOf
++int outDegreeOf(V vertex)+
-
+
- Returns the "out degree" of the specified vertex. An out degree of a
+ vertex in a directed graph is the number of outward directed edges from
+ that vertex. See
+ http://mathworld.wolfram.com/Outdegree.html.
+
+
-
+
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
+ +
+outgoingEdgesOf
++java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
- Returns a set of all edges outgoing from the specified vertex.
+
+
-
+
-
+
- Parameters:
vertex- the vertex for which the list of outgoing edges to be + returned. +- Returns:
- a set of all edges outgoing from the specified vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/EdgeFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/EdgeFactory.html new file mode 100644 index 00000000..ab1d7288 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/EdgeFactory.html @@ -0,0 +1,225 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface EdgeFactory<V,E>
+-
+
- All Known Implementing Classes:
- ClassBasedEdgeFactory +
+
-
+
public interface EdgeFactory<V,E>
+An edge factory used by graphs for creating new edges. +
+ +
+
-
+
- Since: +
- Jul 14, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ E |
+createEdge(V sourceVertex,
+ V targetVertex)
+
++ Creates a new edge whose endpoints are the specified source and target + vertices. |
+
| +Method Detail | +
|---|
+createEdge
++E createEdge(V sourceVertex, + V targetVertex)+
-
+
- Creates a new edge whose endpoints are the specified source and target
+ vertices.
+
+
-
+
- Parameters:
sourceVertex- the source vertex.targetVertex- the target vertex. +- Returns:
- a new edge whose endpoints are the specified source and target + vertices.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/Graph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/Graph.html new file mode 100644 index 00000000..8c8a97b4 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/Graph.html @@ -0,0 +1,858 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface Graph<V,E>
+-
+
- All Known Subinterfaces:
- DirectedGraph<V,E>, ListenableGraph<V,E>, UndirectedGraph<V,E>, WeightedGraph<V,E> +
-
+
- All Known Implementing Classes:
- AbstractBaseGraph, AbstractGraph, AsUndirectedGraph, AsUnweightedDirectedGraph, AsUnweightedGraph, AsWeightedGraph, BlockCutpointGraph, DefaultDirectedGraph, DefaultDirectedWeightedGraph, DefaultListenableGraph, DirectedGraphUnion, DirectedMaskSubgraph, DirectedMultigraph, DirectedPseudograph, DirectedSubgraph, DirectedWeightedMultigraph, DirectedWeightedSubgraph, EdgeReversedGraph, GraphDelegator, GraphUnion, ListenableDirectedGraph, ListenableDirectedWeightedGraph, ListenableUndirectedGraph, ListenableUndirectedWeightedGraph, MaskSubgraph, Multigraph, ParanoidGraph, Pseudograph, SimpleDirectedGraph, SimpleDirectedWeightedGraph, SimpleGraph, SimpleWeightedGraph, Subgraph, UndirectedGraphUnion, UndirectedMaskSubgraph, UndirectedSubgraph, UndirectedWeightedSubgraph, UnmodifiableDirectedGraph, UnmodifiableGraph, UnmodifiableUndirectedGraph, WeightedMultigraph, WeightedPseudograph +
+
-
+
public interface Graph<V,E>
+The root interface in the graph hierarchy. A mathematical graph-theory graph + object G(V,E) contains a set V of vertices and a set + E of edges. Each edge e=(v1,v2) in E connects vertex v1 to vertex v2. + for more information about graphs and their related definitions see + http://mathworld.wolfram.com/Graph.html. + +
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.
++ +
+
-
+
- Since: +
- Jul 14, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.Set<E> |
+edgeSet()
+
++ Returns a set of the edges contained in this graph. |
+
+ java.util.Set<E> |
+edgesOf(V vertex)
+
++ Returns a set of all edges touching the specified vertex. |
+
+ java.util.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(java.util.Collection<? extends E> edges)
+
++ Removes all the edges in this graph that are also contained in the + specified edge collection. |
+
+ java.util.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(java.util.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. |
+
+ java.util.Set<V> |
+vertexSet()
+
++ Returns a set of the vertices contained in this graph. |
+
| +Method Detail | +
|---|
+getAllEdges
++java.util.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. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
+ +
+getEdge
++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. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
+ +
+getEdgeFactory
++EdgeFactory<V,E> getEdgeFactory()+
-
+
- Returns the edge factory using which this graph creates new edges. The
+ edge factory is defined when the graph is constructed and must not be
+ modified.
+
+
-
+
+
- Returns:
- the edge factory using which this graph creates new edges.
+ +
+addEdge
++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. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. + - Throws: +
java.lang.IllegalArgumentException- if source or target vertices are not + found in the graph. +java.lang.NullPointerException- if any of the specified vertices is+ null.- See Also:
getEdgeFactory()
+ +
+addEdge
++boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge. +
- Throws: +
java.lang.IllegalArgumentException- if source or target vertices are not + found in the graph. +java.lang.ClassCastException- if the specified edge is not assignment + compatible with the class of edges produced by the edge factory of this + graph. +java.lang.NullPointerException- if any of the specified vertices is+ null.- See Also:
addEdge(Object, Object), +getEdgeFactory()
+ +
+addVertex
++boolean addVertex(V v)+
-
+
- Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex. +
- Throws: +
java.lang.NullPointerException- if the specified vertex is+ null.
+ +
+containsEdge
++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. In undirected graphs the
+ same result is obtained when source and target are inverted. If any of
+ the specified vertices does not exist in the graph, or if is
+ null, returnsfalse. ++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- true if this graph contains the specified edge.
+ +
+containsEdge
++boolean containsEdge(E e)+
-
+
- Returns true if this graph contains the specified edge. More
+ formally, returns true if and only if this graph contains an
+ edge
e2such thate.equals(e2). If the + specified edge isnullreturnsfalse. ++
-
+
- Parameters:
e- edge whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified edge.
+ +
+containsVertex
++boolean containsVertex(V v)+
-
+
- Returns true if this graph contains the specified vertex. More
+ formally, returns true if and only if this graph contains a
+ vertex
usuch thatu.equals(v). If the + specified vertex isnullreturnsfalse. ++
-
+
- Parameters:
v- vertex whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified vertex.
+ +
+edgeSet
++java.util.Set<E> edgeSet()+
-
+
- Returns a set of the edges contained in this graph. The set is backed by
+ the graph, so changes to the graph are reflected in the set. If the graph
+ is modified while an iteration over the set is in progress, the results
+ of the iteration are undefined.
+
+
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.+
-
+
+
- Returns:
- a set of the edges contained in this graph.
+ +
+edgesOf
++java.util.Set<E> edgesOf(V vertex)+
-
+
- Returns a set of all edges touching the specified vertex. If no edges are
+ touching the specified vertex returns an empty set.
+
+
-
+
- Parameters:
vertex- the vertex for which a set of touching edges is to be + returned. +- Returns:
- a set of all edges touching the specified vertex. +
- Throws: +
java.lang.IllegalArgumentException- if vertex is not found in the graph. +java.lang.NullPointerException- if vertex isnull.
+ +
+removeAllEdges
++boolean removeAllEdges(java.util.Collection<? extends E> edges)+
-
+
- Removes all the edges in this graph that are also contained in the
+ specified edge collection. After this call returns, this graph will
+ contain no edges in common with the specified edges. This method will
+ invoke the
removeEdge(Object)method. ++
-
+
- Parameters:
edges- edges to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call +
- Throws: +
java.lang.NullPointerException- if the specified edge collection is + null.- See Also:
removeEdge(Object), +containsEdge(Object)
+ +
+removeAllEdges
++java.util.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. Returns
+
nullif 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 theremoveEdge(Object)method, or + theremoveEdge(Object, Object)method. ++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- the removed edges, or
nullif no either vertex not + part of graph
+ +
+removeAllVertices
++boolean removeAllVertices(java.util.Collection<? extends V> vertices)+
-
+
- Removes all the vertices in this graph that are also contained in the
+ specified vertex collection. After this call returns, this graph will
+ contain no vertices in common with the specified vertices. This method
+ will invoke the
removeVertex(Object)method. ++
-
+
- Parameters:
vertices- vertices to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call +
- Throws: +
java.lang.NullPointerException- if the specified vertex collection is + null.- See Also:
removeVertex(Object), +containsVertex(Object)
+ +
+removeEdge
++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. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed.
+ +
+removeEdge
++boolean removeEdge(E e)+
-
+
- Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.
+ +
+removeVertex
++boolean removeVertex(V v)+
-
+
- Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.
+ +
+vertexSet
++java.util.Set<V> vertexSet()+
-
+
- Returns a set of the vertices contained in this graph. The set is backed
+ by the graph, so changes to the graph are reflected in the set. If the
+ graph is modified while an iteration over the set is in progress, the
+ results of the iteration are undefined.
+
+
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.+
-
+
+
- Returns:
- a set view of the vertices contained in this graph.
+ +
+getEdgeSource
++V getEdgeSource(E e)+
-
+
- Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Parameters:
e- edge of interest +- Returns:
- source vertex
+ +
+getEdgeTarget
++V getEdgeTarget(E e)+
-
+
- Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Parameters:
e- edge of interest +- Returns:
- target vertex
+ +
+getEdgeWeight
++double getEdgeWeight(E e)+
-
+
- Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
WeightedGraph
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphHelper.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphHelper.html new file mode 100644 index 00000000..1dfb5d35 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphHelper.html @@ -0,0 +1,245 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Class GraphHelper
++java.lang.Object ++org.jgrapht.Graphs +
+Deprecated. Use
Graphs instead.
++
-
+
@Deprecated +public abstract class GraphHelper
- extends Graphs
+A collection of utilities to assist the working with graphs. +
+ +
+
-
+
- Since: +
- Jul 31, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Constructor Summary | +|
|---|---|
GraphHelper()
+
++ Deprecated. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.Graphs | +
|---|
addAllEdges, addAllVertices, addEdge, addEdgeWithVertices, addEdgeWithVertices, addEdgeWithVertices, addGraph, addGraphReversed, getOppositeVertex, getPathVertexList, neighborListOf, predecessorListOf, successorListOf, testIncidence, undirectedGraph |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+GraphHelper
++public GraphHelper()+
-
+
- Deprecated.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphMapping.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphMapping.html new file mode 100644 index 00000000..cc9ec134 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphMapping.html @@ -0,0 +1,252 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface GraphMapping<V,E>
+-
+
- All Known Implementing Classes:
- DefaultGraphMapping +
+
-
+
public interface 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. It + does not have to always be a complete bidirectional mapping (it could return + null for some lookups). +
+ +
+
-
+
- Since: +
- Jul 30, 2005 +
- Author: +
- Assaf Lehr +
+ +
| +Method Summary | +|
|---|---|
+ 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 |
+
| +Method Detail | +
|---|
+getVertexCorrespondence
++V getVertexCorrespondence(V vertex, + boolean forward)+
-
+
- Gets the mapped value where the key is
vertex++
-
+
- Parameters:
vertex- vertex in one of the graphsforward- if true, uses mapping from graph1 to graph2; if false, use + mapping from graph2 to graph1 +- Returns:
- corresponding vertex in other graph, or null if none
+ +
+getEdgeCorrespondence
++E getEdgeCorrespondence(E edge, + boolean forward)+
-
+
- Gets the mapped value where the key is
edge++
-
+
- Parameters:
edge- edge in one of the graphsforward- if true, uses mapping from graph1 to graph2; if false, use + mapping from graph2 to graph1 +- Returns:
- corresponding edge in other graph, or null if none
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphPath.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphPath.html new file mode 100644 index 00000000..498bf56a --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/GraphPath.html @@ -0,0 +1,321 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface GraphPath<V,E>
+-
+
- All Known Implementing Classes:
- GraphPathImpl +
+
-
+
public interface GraphPath<V,E>
+A GraphPath represents a
+ path in a 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.
+
+ +
+
-
+
- Since: +
- Jan 1, 2008 +
- Author: +
- John Sichi +
+ +
| +Method Summary | +|
|---|---|
+ java.util.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. |
+
| +Method Detail | +
|---|
+getGraph
++Graph<V,E> getGraph()+
-
+
- Returns the graph over which this path is defined. The path may also be
+ valid with respect to other graphs.
+
+
-
+
+
- Returns:
- the containing graph
+ +
+getStartVertex
++V getStartVertex()+
-
+
- Returns the start vertex in the path.
+
+
-
+
+
- Returns:
- the start vertex
+ +
+getEndVertex
++V getEndVertex()+
-
+
- Returns the end vertex in the path.
+
+
-
+
+
- Returns:
- the end vertex
+ +
+getEdgeList
++java.util.List<E> getEdgeList()+
-
+
- Returns the edges making up the path. The first edge in this path is
+ incident to the start vertex. The last edge is incident to the end
+ vertex. The vertices along the path can be obtained by traversing from
+ the start vertex, finding its opposite across the first edge, and then
+ doing the same successively across subsequent edges;
Graphs.getPathVertexList(org.jgrapht.GraphPathprovides a convenience method for this. + +Whether or not the returned edge list is modifiable depends on the + path implementation. +
+
-
+
+
- Returns:
- list of edges traversed by the path
+ +
+getWeight
++double getWeight()+
-
+
- Returns the weight assigned to the path. Typically, this will be the sum
+ of the weights of the edge list entries (as defined by the containing
+ graph), but some path implementations may use other definitions.
+
+
-
+
+
- Returns:
- the weight of the path
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/Graphs.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/Graphs.html new file mode 100644 index 00000000..30b463f0 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/Graphs.html @@ -0,0 +1,786 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Class Graphs
++java.lang.Object ++
-
+
- Direct Known Subclasses:
- GraphHelper +
+
-
+
public abstract class Graphs
- extends java.lang.Object
+A collection of utilities to assist with graph manipulation. +
+ +
+
-
+
- Since: +
- Jul 31, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Constructor Summary | +|
|---|---|
Graphs()
+
++ |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+addAllEdges(Graph<? super V,? super E> destination,
+ Graph<V,E> source,
+ java.util.Collection<? extends E> edges)
+
++ Adds a subset of the edges of the specified source graph to the specified + destination graph. |
+|
+static
+ |
+addAllVertices(Graph<? super V,? super E> destination,
+ java.util.Collection<? extends V> vertices)
+
++ Adds all of the specified vertices to the destination graph. |
+|
+static
+ |
+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
+ |
+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
+ |
+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
+ |
+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
+ |
+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
+ |
+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
+ |
+getOppositeVertex(Graph<V,E> g,
+ E e,
+ V v)
+
++ Gets the vertex opposite another vertex across an edge. |
+|
+static
+ |
+getPathVertexList(GraphPath<V,E> path)
+
++ Gets the list of vertices visited by a path. |
+|
+static
+ |
+neighborListOf(Graph<V,E> g,
+ V vertex)
+
++ Returns a list of vertices that are the neighbors of a specified vertex. |
+|
+static
+ |
+predecessorListOf(DirectedGraph<V,E> g,
+ V vertex)
+
++ Returns a list of vertices that are the direct predecessors of a + specified vertex. |
+|
+static
+ |
+successorListOf(DirectedGraph<V,E> g,
+ V vertex)
+
++ Returns a list of vertices that are the direct successors of a specified + vertex. |
+|
+static
+ |
+testIncidence(Graph<V,E> g,
+ E e,
+ V v)
+
++ Tests whether an edge is incident to a vertex. |
+|
+static
+ |
+undirectedGraph(Graph<V,E> g)
+
++ Returns an undirected view of the specified graph. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+Graphs
++public Graphs()+
-
+
| +Method Detail | +
|---|
+addEdge
++public 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. ++
-
+
- Parameters:
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. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdgeWithVertices
++public 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. ++
-
+
- Parameters:
g- the graph for which the specified edge to be added.sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null.
+ +
+addEdgeWithVertices
++public 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.
+
+
-
+
- Parameters:
targetGraph- the graph for which the specified edge to be added.sourceGraph- the graph in which the specified edge is already + presentedge- edge to add +- Returns:
- true if the target graph did not already contain the + specified edge.
+ +
+addEdgeWithVertices
++public 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. ++
-
+
- Parameters:
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. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null.
+ +
+addGraph
++public 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. First all vertices of the source graph
+ are added to the destination graph. Then every edge of the source graph
+ is added to the destination graph. This method returns
true+ if the destination graph has been modified as a result of this operation, + otherwise it returnsfalse. + +The behavior of this operation is undefined if any of the specified + graphs is modified while operation is in progress.
++
-
+
- Parameters:
destination- the graph to which vertices and edges are added.source- the graph used as source for vertices and edges to add. +- Returns:
trueif and only if the destination graph has been + changed as a result of this operation.
+ +
+addGraphReversed
++public 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. If you
+ want to do this as a linked view of the source graph (rather than by
+ copying to a destination graph), use
EdgeReversedGraphinstead. + +The behavior of this operation is undefined if any of the specified + graphs is modified while operation is in progress.
++
-
+
- Parameters:
destination- the graph to which vertices and edges are added.source- the graph used as source for vertices and edges to add.- See Also:
EdgeReversedGraph
+ +
+addAllEdges
++public static <V,E> boolean addAllEdges(Graph<? super V,? super E> destination, + Graph<V,E> source, + java.util.Collection<? extends E> edges)+
-
+
- Adds a subset of the edges of the specified source graph to the specified
+ destination graph. The behavior of this operation is undefined if either
+ of the graphs is modified while the operation is in progress.
addEdgeWithVertices(org.jgrapht.Graphis used for the transfer, so source vertexes will + be added automatically to the target graph. ++
-
+
- Parameters:
destination- the graph to which edges are to be addedsource- the graph used as a source for edges to addedges- the edges to be added +- Returns:
- true if this graph changed as a result of the call
+ +
+addAllVertices
++public static <V,E> boolean addAllVertices(Graph<? super V,? super E> destination, + java.util.Collection<? extends V> vertices)+
-
+
- Adds all of the specified vertices to the destination graph. The behavior
+ of this operation is undefined if the specified vertex collection is
+ modified while the operation is in progress. This method will invoke the
+
Graph.addVertex(Object)method. ++
-
+
- Parameters:
destination- the graph to which edges are to be addedvertices- the vertices to be added to the graph. +- Returns:
- true if graph changed as a result of the call +
- Throws: +
java.lang.NullPointerException- if the specified vertices contains one or + more null vertices, or if the specified vertex collection is + null.- See Also:
Graph.addVertex(Object)
+ +
+neighborListOf
++public static <V,E> java.util.List<V> neighborListOf(Graph<V,E> g, + V vertex)+
-
+
- Returns a list of vertices that are the neighbors of a specified vertex.
+ If the graph is a multigraph vertices may appear more than once in the
+ returned list.
+
+
-
+
- Parameters:
g- the graph to look for neighbors in.vertex- the vertex to get the neighbors of. +- Returns:
- a list of the vertices that are the neighbors of the specified + vertex.
+ +
+predecessorListOf
++public static <V,E> java.util.List<V> predecessorListOf(DirectedGraph<V,E> g, + V vertex)+
-
+
- Returns a list of vertices that are the direct predecessors of a
+ specified vertex. If the graph is a multigraph, vertices may appear more
+ than once in the returned list.
+
+
-
+
- Parameters:
g- the graph to look for predecessors in.vertex- the vertex to get the predecessors of. +- Returns:
- a list of the vertices that are the direct predecessors of the + specified vertex.
+ +
+successorListOf
++public static <V,E> java.util.List<V> successorListOf(DirectedGraph<V,E> g, + V vertex)+
-
+
- Returns a list of vertices that are the direct successors of a specified
+ vertex. If the graph is a multigraph vertices may appear more than once
+ in the returned list.
+
+
-
+
- Parameters:
g- the graph to look for successors in.vertex- the vertex to get the successors of. +- Returns:
- a list of the vertices that are the direct successors of the + specified vertex.
+ +
+undirectedGraph
++public static <V,E> UndirectedGraph<V,E> undirectedGraph(Graph<V,E> g)+
-
+
- Returns an undirected view of the specified graph. If the specified graph
+ is directed, returns an undirected view of it. If the specified graph is
+ already undirected, just returns it.
+
+
-
+
- Parameters:
g- the graph for which an undirected view is to be returned. +- Returns:
- an undirected view of the specified graph, if it is directed, or + or the specified graph itself if it is already undirected. +
- Throws: +
java.lang.IllegalArgumentException- if the graph is neither DirectedGraph + nor UndirectedGraph.- See Also:
AsUndirectedGraph
+ +
+testIncidence
++public static <V,E> boolean testIncidence(Graph<V,E> g, + E e, + V v)+
-
+
- Tests whether an edge is incident to a vertex.
+
+
-
+
- Parameters:
g- graph containing e and ve- edge in gv- vertex in g +- Returns:
- true iff e is incident on v
+ +
+getOppositeVertex
++public static <V,E> V getOppositeVertex(Graph<V,E> g, + E e, + V v)+
-
+
- Gets the vertex opposite another vertex across an edge.
+
+
-
+
- Parameters:
g- graph containing e and ve- edge in gv- vertex in g +- Returns:
- vertex opposite to v across e
+ +
+getPathVertexList
++public static <V,E> java.util.List<V> getPathVertexList(GraphPath<V,E> path)+
-
+
- Gets the list of vertices visited by a path.
+
+
-
+
- Parameters:
path- path of interest +- Returns:
- corresponding vertex list
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ListenableGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ListenableGraph.html new file mode 100644 index 00000000..151fe830 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ListenableGraph.html @@ -0,0 +1,309 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface ListenableGraph<V,E>
+-
+
- All Superinterfaces:
- Graph<V,E> +
-
+
- All Known Implementing Classes:
- DefaultListenableGraph, ListenableDirectedGraph, ListenableDirectedWeightedGraph, ListenableUndirectedGraph, ListenableUndirectedWeightedGraph +
+
-
+
public interface ListenableGraph<V,E>
- extends Graph<V,E>
+A graph that supports listeners on structural change events. +
+ +
+
-
+
- Since: +
- Jul 20, 2003 +
- Author: +
- Barak Naveh +
- See Also:
GraphListener, +VertexSetListener
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Method Detail | +
|---|
+addGraphListener
++void addGraphListener(GraphListener<V,E> l)+
-
+
- Adds the specified graph listener to this graph, if not already present.
+
+
-
+
-
+
- Parameters:
l- the listener to be added.
+ +
+addVertexSetListener
++void addVertexSetListener(VertexSetListener<V> l)+
-
+
- Adds the specified vertex set listener to this graph, if not already
+ present.
+
+
-
+
-
+
- Parameters:
l- the listener to be added.
+ +
+removeGraphListener
++void removeGraphListener(GraphListener<V,E> l)+
-
+
- Removes the specified graph listener from this graph, if present.
+
+
-
+
-
+
- Parameters:
l- the listener to be removed.
+ +
+removeVertexSetListener
++void removeVertexSetListener(VertexSetListener<V> l)+
-
+
- Removes the specified vertex set listener from this graph, if present.
+
+
-
+
-
+
- Parameters:
l- the listener to be removed.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/UndirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/UndirectedGraph.html new file mode 100644 index 00000000..7a801135 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/UndirectedGraph.html @@ -0,0 +1,241 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface UndirectedGraph<V,E>
+-
+
- All Superinterfaces:
- Graph<V,E> +
-
+
- All Known Implementing Classes:
- AsUndirectedGraph, BlockCutpointGraph, ListenableUndirectedGraph, ListenableUndirectedWeightedGraph, Multigraph, Pseudograph, SimpleGraph, SimpleWeightedGraph, UndirectedGraphUnion, UndirectedMaskSubgraph, UndirectedSubgraph, UndirectedWeightedSubgraph, UnmodifiableUndirectedGraph, WeightedMultigraph, WeightedPseudograph +
+
-
+
public interface UndirectedGraph<V,E>
- extends Graph<V,E>
+A graph whose all edges are undirected. This is the root interface of all + undirected graphs. + +
See + http://mathworld.wolfram.com/Graph.html for more on undirected and on + directed graphs.
++ +
+
-
+
- Since: +
- Jul 14, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ int |
+degreeOf(V vertex)
+
++ Returns the degree of the specified vertex. |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Method Detail | +
|---|
+degreeOf
++int degreeOf(V vertex)+
-
+
- Returns the degree of the specified vertex. A degree of a vertex in an
+ undirected graph is the number of edges touching that vertex.
+
+
-
+
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/VertexFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/VertexFactory.html new file mode 100644 index 00000000..c918cf77 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/VertexFactory.html @@ -0,0 +1,222 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface VertexFactory<V>
+-
+
- All Known Implementing Classes:
- ClassBasedVertexFactory +
+
-
+
public interface VertexFactory<V>
+A vertex factory used by graph algorithms for creating new vertices. + Normally, vertices are constructed by user code and added to a graph + explicitly, but algorithms which generate new vertices require a factory. +
+ +
+
-
+
- Since: +
- Sep 16, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Method Summary | +|
|---|---|
+ V |
+createVertex()
+
++ Creates a new vertex. |
+
| +Method Detail | +
|---|
+createVertex
++V createVertex()+
-
+
- Creates a new vertex.
+
+
-
+
+
- Returns:
- the new vertex
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/WeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/WeightedGraph.html new file mode 100644 index 00000000..8cc67c63 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/WeightedGraph.html @@ -0,0 +1,274 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht
+
+Interface WeightedGraph<V,E>
+-
+
- All Superinterfaces:
- Graph<V,E> +
-
+
- All Known Implementing Classes:
- AsWeightedGraph, DefaultDirectedWeightedGraph, DirectedWeightedMultigraph, DirectedWeightedSubgraph, ListenableDirectedWeightedGraph, ListenableUndirectedWeightedGraph, SimpleDirectedWeightedGraph, SimpleWeightedGraph, UndirectedWeightedSubgraph, WeightedMultigraph, WeightedPseudograph +
+
-
+
public interface WeightedGraph<V,E>
- extends Graph<V,E>
+An interface for a graph whose edges have non-uniform weights. +
+ +
+
-
+
- Since: +
- Jul 23, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Field Summary | +|
|---|---|
+static double |
+DEFAULT_EDGE_WEIGHT
+
++ The default weight for an edge. |
+
| +Method Summary | +|
|---|---|
+ void |
+setEdgeWeight(E e,
+ double weight)
+
++ Assigns a weight to an edge. |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Field Detail | +
|---|
+DEFAULT_EDGE_WEIGHT
++static final double DEFAULT_EDGE_WEIGHT+
-
+
- The default weight for an edge.
+
+
-
+
- See Also:
- Constant Field Values
| +Method Detail | +
|---|
+setEdgeWeight
++void setEdgeWeight(E e, + double weight)+
-
+
- Assigns a weight to an edge.
+
+
-
+
-
+
- Parameters:
e- edge on which to set weightweight- new weight for edge
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BellmanFordShortestPath.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BellmanFordShortestPath.html new file mode 100644 index 00000000..2124e778 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BellmanFordShortestPath.html @@ -0,0 +1,431 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class BellmanFordShortestPath<V,E>
++java.lang.Object ++org.jgrapht.alg.BellmanFordShortestPath<V,E> +
+
-
+
public class BellmanFordShortestPath<V,E>
- extends java.lang.Object
+Bellman-Ford + algorithm: weights could be negative, paths could be constrained by a + maximum number of edges. +
+ +
+
+ +
| +Field Summary | +|
|---|---|
+protected Graph<V,E> |
+graph
+
++ Graph on which shortest paths are searched. |
+
+protected V |
+startVertex
+
++ Start vertex. |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+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)
+
++ |
+|
+ java.util.List<E> |
+getPathEdgeList(V endVertex)
+
++ |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+graph
++protected Graph<V,E> graph+
-
+
- Graph on which shortest paths are searched.
+
+
-
+
+ +
+startVertex
++protected V startVertex+
-
+
- Start vertex.
+
+
-
+
| +Constructor Detail | +
|---|
+BellmanFordShortestPath
++public 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.
+
+
-
+
- Parameters:
graph-startVertex-
+ +
+BellmanFordShortestPath
++public 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.
+
+
-
+
- Parameters:
graph-startVertex-nMaxHops- maximum number of edges of the calculated paths.
+ +
+BellmanFordShortestPath
++public 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.
+
+
-
+
- Parameters:
graph-startVertex-nMaxHops- maximum number of edges of the calculated paths.epsilon- tolerance factor.
| +Method Detail | +
|---|
+getCost
++public double getCost(V endVertex)+
-
+
-
+
- Parameters:
endVertex- end vertex. +- Returns:
- the cost of the shortest path between the start vertex and the + end vertex.
+
+ +
+getPathEdgeList
++public java.util.List<E> getPathEdgeList(V endVertex)+
-
+
-
+
- Parameters:
endVertex- end vertex. +- Returns:
- list of
Edge, or null if no path exists between the + start vertex and the end vertex.
+
+ +
+findPathBetween
++public static <V,E> java.util.List<E> findPathBetween(Graph<V,E> graph, + V startVertex, + V endVertex)+
-
+
- Convenience method to find the shortest path via a single static method
+ call. If you need a more advanced search (e.g. limited by hops, or
+ computation of the path length), use the constructor instead.
+
+
-
+
- Parameters:
graph- the graph to be searchedstartVertex- the vertex at which the path should startendVertex- the vertex at which the path should end +- Returns:
- List of Edges, or null if no path exists
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BiconnectivityInspector.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BiconnectivityInspector.html new file mode 100644 index 00000000..87ad1328 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BiconnectivityInspector.html @@ -0,0 +1,334 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class BiconnectivityInspector<V,E>
++java.lang.Object ++
+
-
+
public class BiconnectivityInspector<V,E>
- extends java.lang.Object
+Inspects a graph for the biconnectivity property. See BlockCutpointGraph for more information. A biconnected graph has only one
+ block (i.e. no cutpoints).
+
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Constructor Summary | +|
|---|---|
BiconnectivityInspector(UndirectedGraph<V,E> graph)
+
++ Running time = O(m) where m is the number of edges. |
+|
| +Method Summary | +|
|---|---|
+ java.util.Set<java.util.Set<V>> |
+getBiconnectedVertexComponents()
+
++ Returns the biconnected vertex-components of the graph. |
+
+ java.util.Set<java.util.Set<V>> |
+getBiconnectedVertexComponents(V vertex)
+
++ Returns the biconnected vertex-components containing the vertex. |
+
+ java.util.Set<V> |
+getCutpoints()
+
++ Returns the cutpoints of the graph. |
+
+ boolean |
+isBiconnected()
+
++ Returns true if the graph is biconnected (no cutpoint),
+ false otherwise. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+BiconnectivityInspector
++public BiconnectivityInspector(UndirectedGraph<V,E> graph)+
-
+
- Running time = O(m) where m is the number of edges.
+
+
| +Method Detail | +
|---|
+getBiconnectedVertexComponents
++public java.util.Set<java.util.Set<V>> getBiconnectedVertexComponents()+
-
+
- Returns the biconnected vertex-components of the graph.
+
+
-
+
+ +
+getBiconnectedVertexComponents
++public java.util.Set<java.util.Set<V>> getBiconnectedVertexComponents(V vertex)+
-
+
- Returns the biconnected vertex-components containing the vertex. A
+ biconnected vertex-component contains all the vertices in the component.
+ A vertex which is not a cutpoint is contained in exactly one component. A
+ cutpoint is contained is at least 2 components.
+
+
-
+
- Parameters:
vertex- +- Returns:
- set of all biconnected vertex-components containing the vertex.
+ +
+getCutpoints
++public java.util.Set<V> getCutpoints()+
-
+
- Returns the cutpoints of the graph.
+
+
-
+
+ +
+isBiconnected
++public boolean isBiconnected()+
-
+
- Returns
trueif the graph is biconnected (no cutpoint), +falseotherwise. ++
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BlockCutpointGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BlockCutpointGraph.html new file mode 100644 index 00000000..a62e20e5 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BlockCutpointGraph.html @@ -0,0 +1,369 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class BlockCutpointGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<UndirectedGraph<V,E>,DefaultEdge>, UndirectedGraph<UndirectedGraph<V,E>,DefaultEdge> +
+
-
+
public class BlockCutpointGraph<V,E>
- extends SimpleGraph<UndirectedGraph<V,E>,DefaultEdge>
+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. The + block-cut point graph (BC graph) of G, denoted by GB(VB; EB), is the + bipartite graph defined as follows. (a) VB has one node corresponding to each + block and one node corresponding to each cut point of G. (b) Each edge fx; yg + in EB joins a block node x to a cut point y if the block corresponding to x + contains the cut point node corresponding to y. +
- Lemma 4.4 Let G(V; E) be a connected undirected graph. (a) Each + pair of blocks of G share at most one node, and that node is a cutpoint. (b) + The BC graph of G is a tree in which each leaf node corresponds to a block of + G. +
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
BlockCutpointGraph(UndirectedGraph<V,E> graph)
+
++ Running time = O(m) where m is the number of edges. |
+|
| +Method Summary | +|
|---|---|
+ UndirectedGraph<V,E> |
+getBlock(V vertex)
+
++ Returns the vertex if vertex is a cutpoint, and otherwise returns the + block (biconnected component) containing the vertex. |
+
+ java.util.Set<V> |
+getCutpoints()
+
++ Returns the cutpoints of the initial graph. |
+
+ boolean |
+isCutpoint(V vertex)
+
++ Returns true if the vertex is a cutpoint, false
+ otherwise. |
+
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+BlockCutpointGraph
++public BlockCutpointGraph(UndirectedGraph<V,E> graph)+
-
+
- Running time = O(m) where m is the number of edges.
+
+
| +Method Detail | +
|---|
+getBlock
++public UndirectedGraph<V,E> getBlock(V vertex)+
-
+
- Returns the vertex if vertex is a cutpoint, and otherwise returns the
+ block (biconnected component) containing the vertex.
+
+
-
+
- Parameters:
vertex- vertex in the initial graph.
+ +
+getCutpoints
++public java.util.Set<V> getCutpoints()+
-
+
- Returns the cutpoints of the initial graph.
+
+
-
+
+ +
+isCutpoint
++public boolean isCutpoint(V vertex)+
-
+
- Returns
trueif the vertex is a cutpoint,false+ otherwise. ++
-
+
- Parameters:
vertex- vertex in the initial graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html new file mode 100644 index 00000000..63b9aac3 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html @@ -0,0 +1,295 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class BronKerboschCliqueFinder<V,E>
++java.lang.Object ++
+
-
+
public class BronKerboschCliqueFinder<V,E>
- extends java.lang.Object
+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. Biol. (1998); vol 279; pp. + 287-302] +
+ +
+
-
+
- Author: +
- Ewgenij Proschak +
+ +
| +Constructor Summary | +|
|---|---|
BronKerboschCliqueFinder(Graph<V,E> graph)
+
++ Creates a new clique finder. |
+|
| +Method Summary | +|
|---|---|
+ java.util.Collection<java.util.Set<V>> |
+getAllMaximalCliques()
+
++ Finds all maximal cliques of the graph. |
+
+ java.util.Collection<java.util.Set<V>> |
+getBiggestMaximalCliques()
+
++ Finds the biggest maximal cliques of the graph. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+BronKerboschCliqueFinder
++public BronKerboschCliqueFinder(Graph<V,E> graph)+
-
+
- Creates a new clique finder.
+
+
-
+
- Parameters:
graph- the graph in which cliques are to be found; graph must be + simple
| +Method Detail | +
|---|
+getAllMaximalCliques
++public java.util.Collection<java.util.Set<V>> getAllMaximalCliques()+
-
+
- Finds all maximal cliques of the graph. A clique is maximal if it is
+ impossible to enlarge it by adding another vertex from the graph. Note
+ that a maximal clique is not necessarily the biggest clique in the graph.
+
+
-
+
+
- Returns:
- Collection of cliques (each of which is represented as a Set of + vertices)
+ +
+getBiggestMaximalCliques
++public java.util.Collection<java.util.Set<V>> getBiggestMaximalCliques()+
-
+
- Finds the biggest maximal cliques of the graph.
+
+
-
+
+
- Returns:
- Collection of cliques (each of which is represented as a Set of + vertices)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/ChromaticNumber.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/ChromaticNumber.html new file mode 100644 index 00000000..502e82c2 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/ChromaticNumber.html @@ -0,0 +1,276 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class ChromaticNumber
++java.lang.Object ++
+
-
+
public abstract class ChromaticNumber
- extends java.lang.Object
+Allows the + chromatic number of a graph to be calculated. This is the minimal number + of colors needed to color each vertex such that no two adjacent vertices + share the same color. This algorithm will not find the true chromatic number, + since this is an NP-complete problem. So, a greedy algorithm will find an + approximate chromatic number. +
+ +
+
-
+
- Since: +
- Dec 21, 2008 +
- Author: +
- Andrew Newell +
+ +
| +Constructor Summary | +|
|---|---|
ChromaticNumber()
+
++ |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+findGreedyChromaticNumber(UndirectedGraph<V,E> g)
+
++ Finds the number of colors required for a greedy coloring of the graph. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+ChromaticNumber
++public ChromaticNumber()+
-
+
| +Method Detail | +
|---|
+findGreedyChromaticNumber
++public static <V,E> int findGreedyChromaticNumber(UndirectedGraph<V,E> g)+
-
+
- Finds the number of colors required for a greedy coloring of the graph.
+
+
-
+
- Parameters:
g- an undirected graph to find the chromatic number of +- Returns:
- integer the approximate chromatic number from the greedy + algorithm
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/ConnectivityInspector.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/ConnectivityInspector.html new file mode 100644 index 00000000..47ea74e4 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/ConnectivityInspector.html @@ -0,0 +1,505 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class ConnectivityInspector<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.EventListener, GraphListener<V,E>, VertexSetListener<V> +
+
-
+
public class ConnectivityInspector<V,E>
- extends java.lang.Object
- implements GraphListener<V,E>
- extends java.lang.Object
+Allows obtaining various connectivity aspects of a graph. The inspected
+ graph is specified at construction time and cannot be modified.
+ Currently, the inspector supports connected components for an undirected
+ graph and weakly connected components for a directed graph. To find strongly
+ connected components, use StrongConnectivityInspector 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.
+ +
+
-
+
- Since: +
- Aug 6, 2003 +
- Author: +
- Barak Naveh, John V. Sichi +
+ +
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ java.util.Set<V> |
+connectedSetOf(V vertex)
+
++ Returns a set of all vertices that are in the maximally connected + component together with the specified vertex. |
+
+ java.util.List<java.util.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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+ConnectivityInspector
++public ConnectivityInspector(UndirectedGraph<V,E> g)+
-
+
- Creates a connectivity inspector for the specified undirected graph.
+
+
-
+
- Parameters:
g- the graph for which a connectivity inspector to be created.
+ +
+ConnectivityInspector
++public ConnectivityInspector(DirectedGraph<V,E> g)+
-
+
- Creates a connectivity inspector for the specified directed graph.
+
+
-
+
- Parameters:
g- the graph for which a connectivity inspector to be created.
| +Method Detail | +
|---|
+isGraphConnected
++public boolean isGraphConnected()+
-
+
- Test if the inspected graph is connected. An empty graph is not
+ considered connected.
+
+
-
+
-
+
+
- Returns:
trueif and only if inspected graph is connected.
+ +
+connectedSetOf
++public java.util.Set<V> connectedSetOf(V vertex)+
-
+
- Returns a set of all vertices that are in the maximally connected
+ component together with the specified vertex. For more on maximally
+ connected component, see
+ http://www.nist.gov/dads/HTML/maximallyConnectedComponent.html.
+
+
-
+
-
+
- Parameters:
vertex- the vertex for which the connected set to be returned. +- Returns:
- a set of all vertices that are in the maximally connected + component together with the specified vertex.
+ +
+connectedSets
++public java.util.List<java.util.Set<V>> connectedSets()+
-
+
- Returns a list of
Sets, 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. ++
-
+
-
+
+
- Returns:
- Returns a list of
Sets, where each set contains all + vertices that are in the same maximally connected component.
+ +
+edgeAdded
++public void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
-
+
- Description copied from interface:
GraphListener
+ - Notifies that an edge has been added to the graph.
+
+
-
+
- Specified by:
edgeAddedin interfaceGraphListener<V,E>
-
+
- Parameters:
e- the edge event.- See Also:
GraphListener.edgeAdded(GraphEdgeChangeEvent)
+ +
+edgeRemoved
++public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
-
+
- Description copied from interface:
GraphListener
+ - Notifies that an edge has been removed from the graph.
+
+
-
+
- Specified by:
edgeRemovedin interfaceGraphListener<V,E>
-
+
- Parameters:
e- the edge event.- See Also:
GraphListener.edgeRemoved(GraphEdgeChangeEvent)
+ +
+pathExists
++public boolean pathExists(V sourceVertex, + V targetVertex)+
-
+
- Tests if there is a path from the specified source vertex to the
+ specified target vertices. For a directed graph, direction is ignored for
+ this interpretation of path.
+
+
Note: Future versions of this method might not ignore edge directions + for directed graphs.
++
-
+
-
+
- Parameters:
sourceVertex- one end of the path.targetVertex- another end of the path. +- Returns:
trueif and only if there is a path from the source + vertex to the target vertex.
+ +
+vertexAdded
++public void vertexAdded(GraphVertexChangeEvent<V> e)+
-
+
- Description copied from interface:
VertexSetListener
+ - Notifies that a vertex has been added to the graph.
+
+
-
+
- Specified by:
vertexAddedin interfaceVertexSetListener<V>
-
+
- Parameters:
e- the vertex event.- See Also:
VertexSetListener.vertexAdded(GraphVertexChangeEvent)
+ +
+vertexRemoved
++public void vertexRemoved(GraphVertexChangeEvent<V> e)+
-
+
- Description copied from interface:
VertexSetListener
+ - Notifies that a vertex has been removed from the graph.
+
+
-
+
- Specified by:
vertexRemovedin interfaceVertexSetListener<V>
-
+
- Parameters:
e- the vertex event.- See Also:
VertexSetListener.vertexRemoved(GraphVertexChangeEvent)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/CycleDetector.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/CycleDetector.html new file mode 100644 index 00000000..fa926996 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/CycleDetector.html @@ -0,0 +1,345 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class CycleDetector<V,E>
++java.lang.Object ++
+
-
+
public class CycleDetector<V,E>
- extends java.lang.Object
+Performs cycle detection on a graph. The inspected graph is specified + at construction time and cannot be modified. Currently, the detector supports + only directed graphs. +
+ +
+
-
+
- Since: +
- Sept 16, 2004 +
- Author: +
- John V. Sichi +
+ +
| +Constructor Summary | +|
|---|---|
CycleDetector(DirectedGraph<V,E> graph)
+
++ Creates a cycle detector for the specified graph. |
+|
| +Method Summary | +|
|---|---|
+ boolean |
+detectCycles()
+
++ Performs yes/no cycle detection on the entire graph. |
+
+ boolean |
+detectCyclesContainingVertex(V v)
+
++ Performs yes/no cycle detection on an individual vertex. |
+
+ java.util.Set<V> |
+findCycles()
+
++ Finds the vertex set for the subgraph of all cycles. |
+
+ java.util.Set<V> |
+findCyclesContainingVertex(V v)
+
++ Finds the vertex set for the subgraph of all cycles which contain a + particular vertex. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+CycleDetector
++public CycleDetector(DirectedGraph<V,E> graph)+
-
+
- Creates a cycle detector for the specified graph. Currently only directed
+ graphs are supported.
+
+
-
+
- Parameters:
graph- the DirectedGraph in which to detect cycles
| +Method Detail | +
|---|
+detectCycles
++public boolean detectCycles()+
-
+
- Performs yes/no cycle detection on the entire graph.
+
+
-
+
+
- Returns:
- true iff the graph contains at least one cycle
+ +
+detectCyclesContainingVertex
++public boolean detectCyclesContainingVertex(V v)+
-
+
- Performs yes/no cycle detection on an individual vertex.
+
+
-
+
- Parameters:
v- the vertex to test +- Returns:
- true if v is on at least one cycle
+ +
+findCycles
++public java.util.Set<V> findCycles()+
-
+
- Finds the vertex set for the subgraph of all cycles.
+
+
-
+
+
- Returns:
- set of all vertices which participate in at least one cycle in + this graph
+ +
+findCyclesContainingVertex
++public java.util.Set<V> findCyclesContainingVertex(V v)+
-
+
- Finds the vertex set for the subgraph of all cycles which contain a
+ particular vertex.
+
+
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 + StrongConnectivityInspector instead and return the strongly connected + component containing v. +
+
-
+
- Parameters:
v- the vertex to test +- Returns:
- set of all vertices reachable from v via at least one cycle
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/DijkstraShortestPath.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/DijkstraShortestPath.html new file mode 100644 index 00000000..2be80ca1 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/DijkstraShortestPath.html @@ -0,0 +1,382 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class DijkstraShortestPath<V,E>
++java.lang.Object ++
+
-
+
public final class DijkstraShortestPath<V,E>
- extends java.lang.Object
+An implementation of Dijkstra's
+ shortest path algorithm using ClosestFirstIterator.
+
+ +
+
-
+
- Since: +
- Sep 2, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+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. |
+|
+ java.util.List<E> |
+getPathEdgeList()
+
++ Return the edges making up the path found. |
+|
+ double |
+getPathLength()
+
++ Return the length of the path found. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+DijkstraShortestPath
++public DijkstraShortestPath(Graph<V,E> graph, + V startVertex, + V endVertex)+
-
+
- Creates and executes a new DijkstraShortestPath algorithm instance. An
+ instance is only good for a single search; after construction, it can be
+ accessed to retrieve information about the path found.
+
+
-
+
- Parameters:
graph- the graph to be searchedstartVertex- the vertex at which the path should startendVertex- the vertex at which the path should end
+ +
+DijkstraShortestPath
++public DijkstraShortestPath(Graph<V,E> graph, + V startVertex, + V endVertex, + double radius)+
-
+
- Creates and executes a new DijkstraShortestPath algorithm instance. An
+ instance is only good for a single search; after construction, it can be
+ accessed to retrieve information about the path found.
+
+
-
+
- Parameters:
graph- the graph to be searchedstartVertex- the vertex at which the path should startendVertex- the vertex at which the path should endradius- limit on path length, or Double.POSITIVE_INFINITY for + unbounded search
| +Method Detail | +
|---|
+getPathEdgeList
++public java.util.List<E> getPathEdgeList()+
-
+
- Return the edges making up the path found.
+
+
-
+
+
- Returns:
- List of Edges, or null if no path exists
+ +
+getPath
++public GraphPath<V,E> getPath()+
-
+
- Return the path found.
+
+
-
+
+
- Returns:
- path representation, or null if no path exists
+ +
+getPathLength
++public double getPathLength()+
-
+
- Return the length of the path found.
+
+
-
+
+
- Returns:
- path length, or Double.POSITIVE_INFINITY if no path exists
+ +
+findPathBetween
++public static <V,E> java.util.List<E> findPathBetween(Graph<V,E> graph, + V startVertex, + V endVertex)+
-
+
- Convenience method to find the shortest path via a single static method
+ call. If you need a more advanced search (e.g. limited by radius, or
+ computation of the path length), use the constructor instead.
+
+
-
+
- Parameters:
graph- the graph to be searchedstartVertex- the vertex at which the path should startendVertex- the vertex at which the path should end +- Returns:
- List of Edges, or null if no path exists
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/DirectedNeighborIndex.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/DirectedNeighborIndex.html new file mode 100644 index 00000000..8bb8c2b9 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/DirectedNeighborIndex.html @@ -0,0 +1,475 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class DirectedNeighborIndex<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.EventListener, GraphListener<V,E>, VertexSetListener<V> +
+
-
+
public class DirectedNeighborIndex<V,E>
- extends java.lang.Object
- implements GraphListener<V,E>
- extends java.lang.Object
+Maintains a cache of each vertex's neighbors. While lists of neighbors can be
+ obtained from 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.
++ +
+
-
+
- Since: +
- Dec 13, 2005 +
- Author: +
- Charles Fry +
+ +
| +Constructor Summary | +|
|---|---|
DirectedNeighborIndex(DirectedGraph<V,E> g)
+
++ Creates a neighbor index for the specified directed graph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.List<V> |
+predecessorListOf(V v)
+
++ Returns the set of vertices which are the predecessors of a specified + vertex. |
+
+ java.util.Set<V> |
+predecessorsOf(V v)
+
++ Returns the set of vertices which are the predecessors of a specified + vertex. |
+
+ java.util.List<V> |
+successorListOf(V v)
+
++ Returns the set of vertices which are the successors of a specified + vertex. |
+
+ java.util.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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+DirectedNeighborIndex
++public DirectedNeighborIndex(DirectedGraph<V,E> g)+
-
+
- Creates a neighbor index for the specified directed graph.
+
+
-
+
- Parameters:
g- the graph for which a neighbor index is to be created.
| +Method Detail | +
|---|
+predecessorsOf
++public java.util.Set<V> predecessorsOf(V v)+
-
+
- Returns the set of vertices which are the predecessors of a specified
+ vertex. The returned set is backed by the index, and will be updated when
+ the graph changes as long as the index has been added as a listener to
+ the graph.
+
+
-
+
-
+
- Parameters:
v- the vertex whose predecessors are desired +- Returns:
- all unique predecessors of the specified vertex
+ +
+predecessorListOf
++public java.util.List<V> predecessorListOf(V v)+
-
+
- Returns the set of vertices which are the predecessors of a specified
+ vertex. If the graph is a multigraph, vertices may appear more than once
+ in the returned list. Because a list of predecessors can not be
+ efficiently maintained, it is reconstructed on every invocation by
+ duplicating entries in the neighbor set. It is thus more efficient to use
+
predecessorsOf(Object)unless duplicate neighbors are required. ++
-
+
-
+
- Parameters:
v- the vertex whose predecessors are desired +- Returns:
- all predecessors of the specified vertex
+ +
+successorsOf
++public java.util.Set<V> successorsOf(V v)+
-
+
- Returns the set of vertices which are the successors of a specified
+ vertex. The returned set is backed by the index, and will be updated when
+ the graph changes as long as the index has been added as a listener to
+ the graph.
+
+
-
+
-
+
- Parameters:
v- the vertex whose successors are desired +- Returns:
- all unique successors of the specified vertex
+ +
+successorListOf
++public java.util.List<V> successorListOf(V v)+
-
+
- Returns the set of vertices which are the successors of a specified
+ vertex. If the graph is a multigraph, vertices may appear more than once
+ in the returned list. Because a list of successors can not be efficiently
+ maintained, it is reconstructed on every invocation by duplicating
+ entries in the neighbor set. It is thus more efficient to use
successorsOf(Object)unless duplicate neighbors are required. ++
-
+
-
+
- Parameters:
v- the vertex whose successors are desired +- Returns:
- all successors of the specified vertex
+ +
+edgeAdded
++public void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
-
+
- Description copied from interface:
GraphListener
+ - Notifies that an edge has been added to the graph.
+
+
-
+
- Specified by:
edgeAddedin interfaceGraphListener<V,E>
-
+
- Parameters:
e- the edge event.- See Also:
GraphListener.edgeAdded(GraphEdgeChangeEvent)
+ +
+edgeRemoved
++public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
-
+
- Description copied from interface:
GraphListener
+ - Notifies that an edge has been removed from the graph.
+
+
-
+
- Specified by:
edgeRemovedin interfaceGraphListener<V,E>
-
+
- Parameters:
e- the edge event.- See Also:
GraphListener.edgeRemoved(GraphEdgeChangeEvent)
+ +
+vertexAdded
++public void vertexAdded(GraphVertexChangeEvent<V> e)+
-
+
- Description copied from interface:
VertexSetListener
+ - Notifies that a vertex has been added to the graph.
+
+
-
+
- Specified by:
vertexAddedin interfaceVertexSetListener<V>
-
+
- Parameters:
e- the vertex event.- See Also:
VertexSetListener.vertexAdded(GraphVertexChangeEvent)
+ +
+vertexRemoved
++public void vertexRemoved(GraphVertexChangeEvent<V> e)+
-
+
- Description copied from interface:
VertexSetListener
+ - Notifies that a vertex has been removed from the graph.
+
+
-
+
- Specified by:
vertexRemovedin interfaceVertexSetListener<V>
-
+
- Parameters:
e- the vertex event.- See Also:
VertexSetListener.vertexRemoved(GraphVertexChangeEvent)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/EdmondsKarpMaximumFlow.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/EdmondsKarpMaximumFlow.html new file mode 100644 index 00000000..357e230b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/EdmondsKarpMaximumFlow.html @@ -0,0 +1,448 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class EdmondsKarpMaximumFlow<V,E>
++java.lang.Object ++
+
-
+
public final class EdmondsKarpMaximumFlow<V,E>
- extends java.lang.Object
+A flow network is a + directed graph where each edge has a capacity and each edge receives a flow. + The amount of flow on an edge can not exceed the capacity of the edge (note, + that all capacities must be non-negative). A flow must satisfy the + restriction that the amount of flow into a vertex equals the amount of flow + out of it, except when it is a source, which "produces" flow, or sink, which + "consumes" flow. + +
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). +
+ +
+
+ +
| +Field Summary | +|
|---|---|
+static double |
+DEFAULT_EPSILON
+
++ Default tolerance. |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ void |
+calculateMaximumFlow(V source,
+ V sink)
+
++ Sets current source to source, current sink to sink, + then calculates maximum flow from source to sink. |
+
+ 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. |
+
+ java.util.Map<E,java.lang.Double> |
+getMaximumFlow()
+
++ Returns maximum flow, that was calculated during last + calculateMaximumFlow call, or null, if there was no + calculateMaximumFlow calls. |
+
+ java.lang.Double |
+getMaximumFlowValue()
+
++ Returns maximum flow value, that was calculated during last + calculateMaximumFlow call, or null, if there was no + calculateMaximumFlow calls. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+DEFAULT_EPSILON
++public static final double DEFAULT_EPSILON+
-
+
- Default tolerance.
+
+
-
+
- See Also:
- Constant Field Values
| +Constructor Detail | +
|---|
+EdmondsKarpMaximumFlow
++public EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)+
-
+
- Constructs MaximumFlow instance to work with a copy of
+ network. Current source and sink are set to null. If
+ network is weighted, then capacities are weights, otherwise all
+ capacities are equal to one. Doubles are compared using
+ DEFAULT_EPSILON tolerance.
+
+
-
+
- Parameters:
network- network, where maximum flow will be calculated
+ +
+EdmondsKarpMaximumFlow
++public EdmondsKarpMaximumFlow(DirectedGraph<V,E> network, + double epsilon)+
-
+
- Constructs MaximumFlow instance to work with a copy of
+ network. Current source and sink are set to null. If
+ network is weighted, then capacities are weights, otherwise all
+ capacities are equal to one.
+
+
-
+
- Parameters:
network- network, where maximum flow will be calculatedepsilon- tolerance for comparing doubles
| +Method Detail | +
|---|
+calculateMaximumFlow
++public void calculateMaximumFlow(V source, + V sink)+
-
+
- Sets current source to source, current sink to sink,
+ then calculates maximum flow from source to sink. Note,
+ that source and sink must be vertices of the
+ network passed to the constructor, and they must be different.
+
+
-
+
- Parameters:
source- source vertexsink- sink vertex
+ +
+getMaximumFlowValue
++public java.lang.Double getMaximumFlowValue()+
-
+
- Returns maximum flow value, that was calculated during last
+ calculateMaximumFlow call, or null, if there was no
+ calculateMaximumFlow calls.
+
+
-
+
+
- Returns:
- maximum flow value
+ +
+getMaximumFlow
++public java.util.Map<E,java.lang.Double> getMaximumFlow()+
-
+
- Returns maximum flow, that was calculated during last
+ calculateMaximumFlow call, or null, if there was no
+ calculateMaximumFlow calls.
+
+
-
+
+
- Returns:
- read-only mapping from edges to doubles - flow values
+ +
+getCurrentSource
++public V getCurrentSource()+
-
+
- Returns current source vertex, or null if there was no
+ calculateMaximumFlow calls.
+
+
-
+
+
- Returns:
- current source
+ +
+getCurrentSink
++public V getCurrentSink()+
-
+
- Returns current sink vertex, or null if there was no
+ calculateMaximumFlow calls.
+
+
-
+
+
- Returns:
- current sink
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/EulerianCircuit.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/EulerianCircuit.html new file mode 100644 index 00000000..3c1b70e5 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/EulerianCircuit.html @@ -0,0 +1,306 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class EulerianCircuit
++java.lang.Object ++
+
-
+
public abstract class EulerianCircuit
- extends java.lang.Object
+This algorithm will check whether a graph is Eulerian (hence it contains an + Eulerian + circuit). Also, if a graph is Eulerian, the caller can obtain a list of + vertices making up the Eulerian circuit. An Eulerian circuit is a circuit + which traverses each edge exactly once. +
+ +
+
-
+
- Since: +
- Dec 21, 2008 +
- Author: +
- Andrew Newell +
+ +
| +Constructor Summary | +|
|---|---|
EulerianCircuit()
+
++ |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+getEulerianCircuitVertices(UndirectedGraph<V,E> g)
+
++ This method will return a list of vertices which represents the Eulerian + circuit of the graph. |
+|
+static
+ |
+isEulerian(UndirectedGraph<V,E> g)
+
++ This method will check whether the graph passed in is Eulerian or not. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+EulerianCircuit
++public EulerianCircuit()+
-
+
| +Method Detail | +
|---|
+isEulerian
++public static <V,E> boolean isEulerian(UndirectedGraph<V,E> g)+
-
+
- This method will check whether the graph passed in is Eulerian or not.
+
+
-
+
- Parameters:
g- The graph to be checked +- Returns:
- true for Eulerian and false for non-Eulerian
+ +
+getEulerianCircuitVertices
++public static <V,E> java.util.List<V> getEulerianCircuitVertices(UndirectedGraph<V,E> g)+
-
+
- This method will return a list of vertices which represents the Eulerian
+ circuit of the graph.
+
+
-
+
- Parameters:
g- The graph to find an Eulerian circuit +- Returns:
- null if no Eulerian circuit exists, or a list of vertices + representing the Eulerian circuit if one does exist
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html new file mode 100644 index 00000000..b93ebbb0 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html @@ -0,0 +1,289 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class FloydWarshallShortestPaths<V,E>
++java.lang.Object ++
+
-
+
public class FloydWarshallShortestPaths<V,E>
- extends java.lang.Object
+The + Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in + O(n^3) time. This also works out the graph diameter during the process. +
+ +
+
-
+
- Author: +
- Tom Larkworthy +
+ +
| +Constructor Summary | +|
|---|---|
FloydWarshallShortestPaths(Graph<V,E> g)
+
++ Constructs the shortest path array for the given graph. |
+|
| +Method Summary | +|
|---|---|
+ double |
+getDiameter()
+
++ |
+
+ double |
+shortestDistance(V v1,
+ V v2)
+
++ Retrieves the shortest distance between two vertices. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+FloydWarshallShortestPaths
++public FloydWarshallShortestPaths(Graph<V,E> g)+
-
+
- Constructs the shortest path array for the given graph.
+
+
-
+
- Parameters:
g- input graph
| +Method Detail | +
|---|
+shortestDistance
++public double shortestDistance(V v1, + V v2)+
-
+
- Retrieves the shortest distance between two vertices.
+
+
-
+
- Parameters:
v1- first vertexv2- second vertex +- Returns:
- distance, or positive infinity if no path
+ +
+getDiameter
++public double getDiameter()+
-
+
-
+
+
- Returns:
- diameter computed for the graph
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/HamiltonianCycle.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/HamiltonianCycle.html new file mode 100644 index 00000000..4c2c9cb0 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/HamiltonianCycle.html @@ -0,0 +1,279 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class HamiltonianCycle
++java.lang.Object ++
+
-
+
public class HamiltonianCycle
- extends java.lang.Object
+This class will deal with finding the optimal or approximately optimal + minimum tour (hamiltonian cycle) or commonly known as the Traveling + Salesman Problem. +
+ +
+
-
+
- Author: +
- Andrew Newell +
+ +
| +Constructor Summary | +|
|---|---|
HamiltonianCycle()
+
++ |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)
+
++ This method will return an approximate minimal traveling salesman tour + (hamiltonian cycle). |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+HamiltonianCycle
++public HamiltonianCycle()+
-
+
| +Method Detail | +
|---|
+getApproximateOptimalForCompleteGraph
++public static <V,E> java.util.List<V> getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)+
-
+
- This method will return an approximate minimal traveling salesman tour
+ (hamiltonian cycle). This algorithm requires that the graph be complete
+ and the triangle inequality exists (if x,y,z are vertices then
+ d(x,y)+d(y,z)
-
+
- Type Parameters:
V-E-- Parameters:
g- is the graph to find the optimal tour for. +- Returns:
- The optimal tour as a list of vertices.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/KShortestPaths.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/KShortestPaths.html new file mode 100644 index 00000000..7a778e2a --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/KShortestPaths.html @@ -0,0 +1,313 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class KShortestPaths<V,E>
++java.lang.Object ++
+
-
+
public class KShortestPaths<V,E>
- extends java.lang.Object
+The algorithm determines the k shortest simple paths in increasing order of + weight. Weights could be negative (but no negative cycle is allowed), paths + could be constrained by a maximum number of edges. + +
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*m*n) where m is the number of edges and n is the + number of vertices. +
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ java.util.List<GraphPath<V,E>> |
+getPaths(V endVertex)
+
++ Returns the k shortest simple paths in increasing order of weight. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+KShortestPaths
++public KShortestPaths(Graph<V,E> graph, + V startVertex, + int k)+
-
+
- Creates an object to compute ranking shortest paths between the start
+ vertex and others vertices.
+
+
-
+
- Parameters:
graph-startVertex-k- number of paths to be computed.
+ +
+KShortestPaths
++public 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.
+
+
-
+
- Parameters:
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. +- Throws: +
java.lang.NullPointerException- if the specified graph or startVertex is +null. +java.lang.IllegalArgumentException- if nPaths is negative or 0. +java.lang.IllegalArgumentException- if nMaxHops is negative or 0.
| +Method Detail | +
|---|
+getPaths
++public java.util.List<GraphPath<V,E>> getPaths(V endVertex)+
-
+
- Returns the k shortest simple paths in increasing order of weight.
+
+
-
+
- Parameters:
endVertex- target vertex of the calculated paths. +- Returns:
- list of paths, or
nullif no path exists between the + start vertex and the end vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/NeighborIndex.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/NeighborIndex.html new file mode 100644 index 00000000..ea6fab0e --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/NeighborIndex.html @@ -0,0 +1,415 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class NeighborIndex<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.EventListener, GraphListener<V,E>, VertexSetListener<V> +
+
-
+
public class NeighborIndex<V,E>
- extends java.lang.Object
- implements GraphListener<V,E>
- extends java.lang.Object
+Maintains a cache of each vertex's neighbors. While lists of neighbors can be
+ obtained from 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.
++ +
+
-
+
- Since: +
- Dec 13, 2005 +
- Author: +
- Charles Fry +
+ +
| +Constructor Summary | +|
|---|---|
NeighborIndex(Graph<V,E> g)
+
++ Creates a neighbor index for the specified undirected graph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.List<V> |
+neighborListOf(V v)
+
++ Returns a list of vertices which are adjacent to a specified vertex. |
+
+ java.util.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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+NeighborIndex
++public NeighborIndex(Graph<V,E> g)+
-
+
- Creates a neighbor index for the specified undirected graph.
+
+
-
+
- Parameters:
g- the graph for which a neighbor index is to be created.
| +Method Detail | +
|---|
+neighborsOf
++public java.util.Set<V> neighborsOf(V v)+
-
+
- Returns the set of vertices which are adjacent to a specified vertex. The
+ returned set is backed by the index, and will be updated when the graph
+ changes as long as the index has been added as a listener to the graph.
+
+
-
+
-
+
- Parameters:
v- the vertex whose neighbors are desired +- Returns:
- all unique neighbors of the specified vertex
+ +
+neighborListOf
++public java.util.List<V> neighborListOf(V v)+
-
+
- Returns a list of vertices which are adjacent to a specified vertex. If
+ the graph is a multigraph, vertices may appear more than once in the
+ returned list. Because a list of neighbors can not be efficiently
+ maintained, it is reconstructed on every invocation, by duplicating
+ entries in the neighbor set. It is thus more efficient to use
neighborsOf(Object)unless duplicate neighbors are important. ++
-
+
-
+
- Parameters:
v- the vertex whose neighbors are desired +- Returns:
- all neighbors of the specified vertex
+ +
+edgeAdded
++public void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
-
+
- Description copied from interface:
GraphListener
+ - Notifies that an edge has been added to the graph.
+
+
-
+
- Specified by:
edgeAddedin interfaceGraphListener<V,E>
-
+
- Parameters:
e- the edge event.- See Also:
GraphListener.edgeAdded(GraphEdgeChangeEvent)
+ +
+edgeRemoved
++public void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
-
+
- Description copied from interface:
GraphListener
+ - Notifies that an edge has been removed from the graph.
+
+
-
+
- Specified by:
edgeRemovedin interfaceGraphListener<V,E>
-
+
- Parameters:
e- the edge event.- See Also:
GraphListener.edgeRemoved(GraphEdgeChangeEvent)
+ +
+vertexAdded
++public void vertexAdded(GraphVertexChangeEvent<V> e)+
-
+
- Description copied from interface:
VertexSetListener
+ - Notifies that a vertex has been added to the graph.
+
+
-
+
- Specified by:
vertexAddedin interfaceVertexSetListener<V>
-
+
- Parameters:
e- the vertex event.- See Also:
VertexSetListener.vertexAdded(GraphVertexChangeEvent)
+ +
+vertexRemoved
++public void vertexRemoved(GraphVertexChangeEvent<V> e)+
-
+
- Description copied from interface:
VertexSetListener
+ - Notifies that a vertex has been removed from the graph.
+
+
-
+
- Specified by:
vertexRemovedin interfaceVertexSetListener<V>
-
+
- Parameters:
e- the vertex event.- See Also:
VertexSetListener.vertexRemoved(GraphVertexChangeEvent)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/StrongConnectivityInspector.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/StrongConnectivityInspector.html new file mode 100644 index 00000000..8cb4ba35 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/StrongConnectivityInspector.html @@ -0,0 +1,356 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class StrongConnectivityInspector<V,E>
++java.lang.Object ++
+
-
+
public class StrongConnectivityInspector<V,E>
- extends java.lang.Object
+
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().
+ +
+
-
+
- Since: +
- Feb 2, 2005 +
- Author: +
- Christian Soltenborn, Christian Hammer +
+ +
| +Constructor Summary | +|
|---|---|
StrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
+
++ The constructor of the StrongConnectivityInspector class. |
+|
| +Method Summary | +|
|---|---|
+ DirectedGraph<V,E> |
+getGraph()
+
++ Returns the graph inspected by the StrongConnectivityInspector. |
+
+ boolean |
+isStronglyConnected()
+
++ Returns true if the graph of this
+ StronglyConnectivityInspector instance is strongly connected. |
+
+ java.util.List<java.util.Set<V>> |
+stronglyConnectedSets()
+
++ Computes a List of Sets, where each set contains vertices
+ which together form a strongly connected component within the given
+ graph. |
+
+ java.util.List<DirectedSubgraph<V,E>> |
+stronglyConnectedSubgraphs()
+
++ Computes a list of DirectedSubgraphs of the given graph. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+StrongConnectivityInspector
++public StrongConnectivityInspector(DirectedGraph<V,E> directedGraph)+
-
+
- The constructor of the StrongConnectivityInspector class.
+
+
-
+
- Parameters:
directedGraph- the graph to inspect +- Throws: +
java.lang.IllegalArgumentException
| +Method Detail | +
|---|
+getGraph
++public DirectedGraph<V,E> getGraph()+
-
+
- Returns the graph inspected by the StrongConnectivityInspector.
+
+
-
+
+
- Returns:
- the graph inspected by this StrongConnectivityInspector
+ +
+isStronglyConnected
++public boolean isStronglyConnected()+
-
+
- Returns true if the graph of this
+ StronglyConnectivityInspectorinstance is strongly connected. ++
-
+
+
- Returns:
- true if the graph is strongly connected, false otherwise
+ +
+stronglyConnectedSets
++public java.util.List<java.util.Set<V>> stronglyConnectedSets()+
-
+
- Computes a
ListofSets, where each set contains vertices + which together form a strongly connected component within the given + graph. ++
-
+
+
- Returns:
ListofSets containing the strongly + connected components
+ +
+stronglyConnectedSubgraphs
++public java.util.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.+
-
+
+
- Returns:
- a list of subgraphs representing the strongly connected + components
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/TransitiveClosure.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/TransitiveClosure.html new file mode 100644 index 00000000..a37adb43 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/TransitiveClosure.html @@ -0,0 +1,274 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class TransitiveClosure
++java.lang.Object ++
+
-
+
public class TransitiveClosure
- extends java.lang.Object
+Constructs the transitive closure of the input graph. +
+ +
+
-
+
- Since: +
- May 5, 2007 +
- Author: +
- Vinayak R. Borkar +
+ +
| +Field Summary | +|
|---|---|
+static TransitiveClosure |
+INSTANCE
+
++ Singleton instance. |
+
| +Method Summary | +||
|---|---|---|
+
+ |
+closeSimpleDirectedGraph(SimpleDirectedGraph<V,E> graph)
+
++ Computes the transitive closure of the given graph. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+INSTANCE
++public static final TransitiveClosure INSTANCE+
-
+
- Singleton instance.
+
+
-
+
| +Method Detail | +
|---|
+closeSimpleDirectedGraph
++public <V,E> void closeSimpleDirectedGraph(SimpleDirectedGraph<V,E> graph)+
-
+
- Computes the transitive closure of the given graph.
+
+
-
+
- Parameters:
graph- - Graph to compute transitive closure for.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/VertexCovers.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/VertexCovers.html new file mode 100644 index 00000000..412c7998 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/VertexCovers.html @@ -0,0 +1,324 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg
+
+Class VertexCovers
++java.lang.Object ++
+
-
+
public abstract class VertexCovers
- extends java.lang.Object
+Algorithms to find a vertex cover for a graph. A vertex cover is a set of + vertices that touches all the edges in the graph. The graph's vertex set is a + trivial cover. However, a minimal vertex set (or at least an + approximation for it) is usually desired. Finding a true minimal vertex cover + is an NP-Complete problem. For more on the vertex cover problem, see + http://mathworld.wolfram.com/VertexCover.html +
+ +
+
-
+
- Since: +
- Nov 6, 2003 +
- Author: +
- Linda Buisman +
+ +
| +Constructor Summary | +|
|---|---|
VertexCovers()
+
++ |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+find2ApproximationCover(Graph<V,E> g)
+
++ Finds a 2-approximation for a minimal vertex cover of the specified + graph. |
+|
+static
+ |
+findGreedyCover(UndirectedGraph<V,E> g)
+
++ Finds a greedy approximation for a minimal vertex cover of a specified + graph. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+VertexCovers
++public VertexCovers()+
-
+
| +Method Detail | +
|---|
+find2ApproximationCover
++public static <V,E> java.util.Set<V> find2ApproximationCover(Graph<V,E> g)+
-
+
- Finds a 2-approximation for a minimal vertex cover of the specified
+ graph. The algorithm promises a cover that is at most double the size of
+ a minimal cover. The algorithm takes O(|E|) time.
+
+
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. +
++
-
+
- Parameters:
g- the graph for which vertex cover approximation is to be found. +- Returns:
- a set of vertices which is a vertex cover for the specified + graph.
+ +
+findGreedyCover
++public static <V,E> java.util.Set<V> findGreedyCover(UndirectedGraph<V,E> g)+
-
+
- Finds a greedy approximation for a minimal vertex cover of a specified
+ graph. At each iteration, the algorithm picks the vertex with the highest
+ degree and adds it to the cover, until all edges are covered.
+
+
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)+ orAsUndirectedGraph.+
-
+
- Parameters:
g- the graph for which vertex cover approximation is to be found. +- Returns:
- a set of vertices which is a vertex cover for the specified + graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/package-frame.html new file mode 100644 index 00000000..2aec5db2 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/package-frame.html @@ -0,0 +1,66 @@ + + + + + +
|
+Classes
+
+ +BellmanFordShortestPath + +BiconnectivityInspector + +BlockCutpointGraph + +BronKerboschCliqueFinder + +ChromaticNumber + +ConnectivityInspector + +CycleDetector + +DijkstraShortestPath + +DirectedNeighborIndex + +EdmondsKarpMaximumFlow + +EulerianCircuit + +FloydWarshallShortestPaths + +HamiltonianCycle + +KShortestPaths + +NeighborIndex + +StrongConnectivityInspector + +TransitiveClosure + +VertexCovers |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.alg +
+Algorithms provided with JGraphT. +
+See:
+
+ Description
+
+ +
| +Class Summary | +|
|---|---|
| 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. | +
| 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. | +
| EdmondsKarpMaximumFlow<V,E> | +A flow network is a + directed graph where each edge has a capacity and each edge receives a flow. | +
| 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. | +
| HamiltonianCycle | +This class will deal with finding the optimal or approximately optimal + minimum tour (hamiltonian cycle) or commonly known as the Traveling + Salesman Problem. | +
| KShortestPaths<V,E> | +The algorithm determines the k shortest simple paths in increasing order of + weight. | +
| NeighborIndex<V,E> | +Maintains a cache of each vertex's neighbors. | +
| StrongConnectivityInspector<V,E> | +Complements the ConnectivityInspector class with
+ the capability to compute the strongly connected components of a directed
+ graph. |
+
| TransitiveClosure | +Constructs the transitive closure of the input graph. | +
| VertexCovers | +Algorithms to find a vertex cover for a graph. | +
+Package org.jgrapht.alg Description +
+ ++Algorithms provided with JGraphT. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/package-tree.html new file mode 100644 index 00000000..59708ff4 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/package-tree.html @@ -0,0 +1,163 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.alg +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.graph.AbstractGraph<V,E> (implements org.jgrapht.Graph<V,E>)
+
-
+
- org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
+
-
+
- org.jgrapht.graph.SimpleGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.alg.BlockCutpointGraph<V,E>
- org.jgrapht.graph.SimpleGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
- org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
+
- org.jgrapht.alg.BellmanFordShortestPath<V,E>
- org.jgrapht.alg.BiconnectivityInspector<V,E>
- org.jgrapht.alg.BronKerboschCliqueFinder<V,E>
- org.jgrapht.alg.ChromaticNumber
- org.jgrapht.alg.ConnectivityInspector<V,E> (implements org.jgrapht.event.GraphListener<V,E>) +
- org.jgrapht.alg.CycleDetector<V,E>
- org.jgrapht.alg.DijkstraShortestPath<V,E>
- org.jgrapht.alg.DirectedNeighborIndex<V,E> (implements org.jgrapht.event.GraphListener<V,E>) +
- org.jgrapht.alg.EdmondsKarpMaximumFlow<V,E>
- org.jgrapht.alg.EulerianCircuit
- org.jgrapht.alg.FloydWarshallShortestPaths<V,E>
- org.jgrapht.alg.HamiltonianCycle
- org.jgrapht.alg.KShortestPaths<V,E>
- org.jgrapht.alg.NeighborIndex<V,E> (implements org.jgrapht.event.GraphListener<V,E>) +
- org.jgrapht.alg.StrongConnectivityInspector<V,E>
- org.jgrapht.alg.TransitiveClosure
- org.jgrapht.alg.VertexCovers
- org.jgrapht.graph.AbstractGraph<V,E> (implements org.jgrapht.Graph<V,E>)
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/VertexDegreeComparator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/VertexDegreeComparator.html new file mode 100644 index 00000000..529217fb --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/VertexDegreeComparator.html @@ -0,0 +1,317 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.alg.util
+
+Class VertexDegreeComparator<V,E>
++java.lang.Object ++org.jgrapht.alg.util.VertexDegreeComparator<V,E> +
-
+
- All Implemented Interfaces:
- java.util.Comparator<V> +
+
-
+
public class VertexDegreeComparator<V,E>
- extends java.lang.Object
- implements java.util.Comparator<V>
- extends java.lang.Object
+Compares two vertices based on their degree. + +
Used by greedy algorithms that need to sort vertices by their degree. Two + vertices are considered equal if their degrees are equal.
++ +
+
-
+
- Since: +
- Nov 6, 2003 +
- Author: +
- Linda Buisman +
+ +
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ int |
+compare(V v1,
+ V v2)
+
++ Compare the degrees of v1 and v2, taking into
+ account whether ascending or descending order is used. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| Methods inherited from interface java.util.Comparator | +
|---|
equals |
+
| +Constructor Detail | +
|---|
+VertexDegreeComparator
++public VertexDegreeComparator(UndirectedGraph<V,E> g)+
-
+
- Creates a comparator for comparing the degrees of vertices in the
+ specified graph. The comparator compares in ascending order of degrees
+ (lowest first).
+
+
-
+
- Parameters:
g- graph with respect to which the degree is calculated.
+ +
+VertexDegreeComparator
++public VertexDegreeComparator(UndirectedGraph<V,E> g, + boolean ascendingOrder)+
-
+
- Creates a comparator for comparing the degrees of vertices in the
+ specified graph.
+
+
-
+
- Parameters:
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).
| +Method Detail | +
|---|
+compare
++public int compare(V v1, + V v2)+
-
+
- Compare the degrees of
v1andv2, taking into + account whether ascending or descending order is used. ++
-
+
- Specified by:
comparein interfacejava.util.Comparator<V>
-
+
- Parameters:
v1- the first vertex to be compared.v2- the second vertex to be compared. +- Returns:
- -1 if
v1comes beforev2, +1 if+ v1comes afterv2, 0 if equal.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/package-frame.html new file mode 100644 index 00000000..292f2c50 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/package-frame.html @@ -0,0 +1,32 @@ + + + + + +
|
+Classes
+
+ +VertexDegreeComparator |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.alg.util +
+Utilities used by JGraphT algorithms. +
+See:
+
+ Description
+
+ +
| +Class Summary | +|
|---|---|
| VertexDegreeComparator<V,E> | +Compares two vertices based on their degree. | +
+Package org.jgrapht.alg.util Description +
+ ++Utilities used by JGraphT algorithms. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/package-tree.html new file mode 100644 index 00000000..e4897b09 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/alg/util/package-tree.html @@ -0,0 +1,152 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.alg.util +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.alg.util.VertexDegreeComparator<V,E> (implements java.util.Comparator<T>) +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/CompleteGraphDemo.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/CompleteGraphDemo.html new file mode 100644 index 00000000..1efa4e6c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/CompleteGraphDemo.html @@ -0,0 +1,271 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.demo
+
+Class CompleteGraphDemo
++java.lang.Object ++
+
-
+
public final class CompleteGraphDemo
- extends java.lang.Object
+
+ +
| +Constructor Summary | +|
|---|---|
CompleteGraphDemo()
+
++ |
+|
| +Method Summary | +|
|---|---|
+static void |
+main(java.lang.String[] args)
+
++ |
+
+static boolean |
+replaceVertex(java.lang.Object oldVertex,
+ java.lang.Object newVertex)
+
++ |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+CompleteGraphDemo
++public CompleteGraphDemo()+
-
+
| +Method Detail | +
|---|
+main
++public static void main(java.lang.String[] args)+
-
+
-
+
+
+ +
+replaceVertex
++public static boolean replaceVertex(java.lang.Object oldVertex, + java.lang.Object newVertex)+
-
+
-
+
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/HelloJGraphT.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/HelloJGraphT.html new file mode 100644 index 00000000..0185c3ad --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/HelloJGraphT.html @@ -0,0 +1,229 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.demo
+
+Class HelloJGraphT
++java.lang.Object ++
+
-
+
public final class HelloJGraphT
- extends java.lang.Object
+A simple introduction to using JGraphT. +
+ +
+
-
+
- Since: +
- Jul 27, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+static void |
+main(java.lang.String[] args)
+
++ The starting point for the demo. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Method Detail | +
|---|
+main
++public static void main(java.lang.String[] args)+
-
+
- The starting point for the demo.
+
+
-
+
- Parameters:
args- ignored.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/JGraphAdapterDemo.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/JGraphAdapterDemo.html new file mode 100644 index 00000000..52f9d196 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/JGraphAdapterDemo.html @@ -0,0 +1,436 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.demo
+
+Class JGraphAdapterDemo
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.awt.image.ImageObserver, java.awt.MenuContainer, java.io.Serializable, javax.accessibility.Accessible, javax.swing.RootPaneContainer +
+
-
+
public class JGraphAdapterDemo
- extends javax.swing.JApplet
+A demo applet that shows how to use JGraph to visualize JGraphT graphs. +
+ +
+
-
+
- Since: +
- Aug 3, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Nested Class Summary | +
|---|
| Nested classes/interfaces inherited from class javax.swing.JApplet | +
|---|
javax.swing.JApplet.AccessibleJApplet |
+
| Nested classes/interfaces inherited from class java.applet.Applet | +
|---|
java.applet.Applet.AccessibleApplet |
+
| Nested classes/interfaces inherited from class java.awt.Panel | +
|---|
java.awt.Panel.AccessibleAWTPanel |
+
| Nested classes/interfaces inherited from class java.awt.Container | +
|---|
java.awt.Container.AccessibleAWTContainer |
+
| Nested classes/interfaces inherited from class java.awt.Component | +
|---|
java.awt.Component.AccessibleAWTComponent, java.awt.Component.BaselineResizeBehavior, java.awt.Component.BltBufferStrategy, java.awt.Component.FlipBufferStrategy |
+
| +Field Summary | +
|---|
| Fields inherited from class javax.swing.JApplet | +
|---|
accessibleContext, rootPane, rootPaneCheckingEnabled |
+
| Fields inherited from class java.awt.Component | +
|---|
BOTTOM_ALIGNMENT, CENTER_ALIGNMENT, LEFT_ALIGNMENT, RIGHT_ALIGNMENT, TOP_ALIGNMENT |
+
| Fields inherited from interface java.awt.image.ImageObserver | +
|---|
ABORT, ALLBITS, ERROR, FRAMEBITS, HEIGHT, PROPERTIES, SOMEBITS, WIDTH |
+
| +Constructor Summary | +|
|---|---|
JGraphAdapterDemo()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ void |
+init()
+
++ |
+
+static void |
+main(java.lang.String[] args)
+
++ An alternative starting point for this demo, to also allow running this + applet as an application. |
+
| Methods inherited from class javax.swing.JApplet | +
|---|
addImpl, createRootPane, getAccessibleContext, getContentPane, getGlassPane, getGraphics, getJMenuBar, getLayeredPane, getRootPane, getTransferHandler, isRootPaneCheckingEnabled, paramString, remove, repaint, setContentPane, setGlassPane, setJMenuBar, setLayeredPane, setLayout, setRootPane, setRootPaneCheckingEnabled, setTransferHandler, update |
+
| Methods inherited from class java.applet.Applet | +
|---|
destroy, getAppletContext, getAppletInfo, getAudioClip, getAudioClip, getCodeBase, getDocumentBase, getImage, getImage, getLocale, getParameter, getParameterInfo, isActive, newAudioClip, play, play, resize, resize, setStub, showStatus, start, stop |
+
| Methods inherited from class java.awt.Panel | +
|---|
addNotify |
+
| Methods inherited from class java.awt.Container | +
|---|
add, 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, transferFocusBackward, transferFocusDownCycle, validate, validateTree |
+
| Methods inherited from class java.awt.Component | +
|---|
action, 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, 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, transferFocusUpCycle |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+JGraphAdapterDemo
++public JGraphAdapterDemo()+
-
+
| +Method Detail | +
|---|
+main
++public static void main(java.lang.String[] args)+
-
+
- An alternative starting point for this demo, to also allow running this
+ applet as an application.
+
+
-
+
- Parameters:
args- ignored.
+ +
+init
++public void init()+
-
+
-
+
+
-
+
- Overrides:
initin classjava.applet.Applet
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/PerformanceDemo.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/PerformanceDemo.html new file mode 100644 index 00000000..fc07430b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/PerformanceDemo.html @@ -0,0 +1,272 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.demo
+
+Class PerformanceDemo
++java.lang.Object ++
+
-
+
public final class PerformanceDemo
- extends java.lang.Object
+A simple demo to test memory and CPU consumption on a graph with 3 million + elements. + +
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.
++ +
+
-
+
- Since: +
- Aug 10, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Constructor Summary | +|
|---|---|
PerformanceDemo()
+
++ |
+|
| +Method Summary | +|
|---|---|
+static void |
+main(java.lang.String[] args)
+
++ The starting point for the demo. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+PerformanceDemo
++public PerformanceDemo()+
-
+
| +Method Detail | +
|---|
+main
++public static void main(java.lang.String[] args)+
-
+
- The starting point for the demo.
+
+
-
+
- Parameters:
args- ignored.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/package-frame.html new file mode 100644 index 00000000..05982d0e --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/package-frame.html @@ -0,0 +1,38 @@ + + + + + +
|
+Classes
+
+ +CompleteGraphDemo + +HelloJGraphT + +JGraphAdapterDemo + +PerformanceDemo |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.demo +
+Demo programs that help to get started with JGraphT. +
+See:
+
+ Description
+
+ +
| +Class Summary | +|
|---|---|
| CompleteGraphDemo | ++ |
| HelloJGraphT | +A simple introduction to using JGraphT. | +
| JGraphAdapterDemo | +A demo applet that shows how to use JGraph to visualize JGraphT graphs. | +
| PerformanceDemo | +A simple demo to test memory and CPU consumption on a graph with 3 million + elements. | +
+Package org.jgrapht.demo Description +
+ ++Demo programs that help to get started with JGraphT. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/package-tree.html new file mode 100644 index 00000000..0e61ec6c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/demo/package-tree.html @@ -0,0 +1,164 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.demo +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.demo.CompleteGraphDemo
- java.awt.Component (implements java.awt.image.ImageObserver, java.awt.MenuContainer, java.io.Serializable)
+
-
+
- java.awt.Container
-
+
- java.awt.Panel (implements javax.accessibility.Accessible)
+
-
+
- java.applet.Applet
-
+
- javax.swing.JApplet (implements javax.accessibility.Accessible, javax.swing.RootPaneContainer)
+
-
+
- org.jgrapht.demo.JGraphAdapterDemo
- javax.swing.JApplet (implements javax.accessibility.Accessible, javax.swing.RootPaneContainer)
+
- java.applet.Applet
- java.awt.Panel (implements javax.accessibility.Accessible)
+
- java.awt.Container
- org.jgrapht.demo.HelloJGraphT
- org.jgrapht.demo.PerformanceDemo
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/ConnectedComponentTraversalEvent.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/ConnectedComponentTraversalEvent.html new file mode 100644 index 00000000..c6640de6 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/ConnectedComponentTraversalEvent.html @@ -0,0 +1,349 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class ConnectedComponentTraversalEvent
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable +
+
-
+
public class ConnectedComponentTraversalEvent
- extends java.util.EventObject
+A traversal event with respect to a connected component. +
+ +
+
-
+
- Since: +
- Aug 11, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+static int |
+CONNECTED_COMPONENT_FINISHED
+
++ Connected component traversal finished event. |
+
+static int |
+CONNECTED_COMPONENT_STARTED
+
++ Connected component traversal started event. |
+
| Fields inherited from class java.util.EventObject | +
|---|
source |
+
| +Constructor Summary | +|
|---|---|
ConnectedComponentTraversalEvent(java.lang.Object eventSource,
+ int type)
+
++ Creates a new ConnectedComponentTraversalEvent. |
+|
| +Method Summary | +|
|---|---|
+ int |
+getType()
+
++ Returns the event type. |
+
| Methods inherited from class java.util.EventObject | +
|---|
getSource, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+CONNECTED_COMPONENT_STARTED
++public static final int CONNECTED_COMPONENT_STARTED+
-
+
- Connected component traversal started event.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+CONNECTED_COMPONENT_FINISHED
++public static final int CONNECTED_COMPONENT_FINISHED+
-
+
- Connected component traversal finished event.
+
+
-
+
- See Also:
- Constant Field Values
| +Constructor Detail | +
|---|
+ConnectedComponentTraversalEvent
++public ConnectedComponentTraversalEvent(java.lang.Object eventSource, + int type)+
-
+
- Creates a new ConnectedComponentTraversalEvent.
+
+
-
+
- Parameters:
eventSource- the source of the event.type- the type of event.
| +Method Detail | +
|---|
+getType
++public int getType()+
-
+
- Returns the event type.
+
+
-
+
+
- Returns:
- the event type.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/EdgeTraversalEvent.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/EdgeTraversalEvent.html new file mode 100644 index 00000000..d9d856e4 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/EdgeTraversalEvent.html @@ -0,0 +1,329 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class EdgeTraversalEvent<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable +
+
-
+
public class EdgeTraversalEvent<V,E>
- extends java.util.EventObject
+A traversal event for a graph edge. +
+ +
+
-
+
- Since: +
- Aug 11, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+protected E |
+edge
+
++ The traversed edge. |
+
| Fields inherited from class java.util.EventObject | +
|---|
source |
+
| +Constructor Summary | +|
|---|---|
EdgeTraversalEvent(java.lang.Object eventSource,
+ E edge)
+
++ Creates a new EdgeTraversalEvent. |
+|
| +Method Summary | +|
|---|---|
+ E |
+getEdge()
+
++ Returns the traversed edge. |
+
| Methods inherited from class java.util.EventObject | +
|---|
getSource, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+edge
++protected E edge+
-
+
- The traversed edge.
+
+
-
+
| +Constructor Detail | +
|---|
+EdgeTraversalEvent
++public EdgeTraversalEvent(java.lang.Object eventSource, + E edge)+
-
+
- Creates a new EdgeTraversalEvent.
+
+
-
+
- Parameters:
eventSource- the source of the event.edge- the traversed edge.
| +Method Detail | +
|---|
+getEdge
++public E getEdge()+
-
+
- Returns the traversed edge.
+
+
-
+
+
- Returns:
- the traversed edge.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphChangeEvent.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphChangeEvent.html new file mode 100644 index 00000000..306ad4e5 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphChangeEvent.html @@ -0,0 +1,333 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class GraphChangeEvent
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable +
-
+
- Direct Known Subclasses:
- GraphEdgeChangeEvent, GraphVertexChangeEvent +
+
-
+
public class GraphChangeEvent
- extends java.util.EventObject
+An event which indicates that a graph has changed. This class is a root for + graph change events. +
+ +
+
-
+
- Since: +
- Aug 10, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+protected int |
+type
+
++ The type of graph change this event indicates. |
+
| Fields inherited from class java.util.EventObject | +
|---|
source |
+
| +Constructor Summary | +|
|---|---|
GraphChangeEvent(java.lang.Object eventSource,
+ int type)
+
++ Creates a new graph change event. |
+|
| +Method Summary | +|
|---|---|
+ int |
+getType()
+
++ Returns the event type. |
+
| Methods inherited from class java.util.EventObject | +
|---|
getSource, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+type
++protected int type+
-
+
- The type of graph change this event indicates.
+
+
-
+
| +Constructor Detail | +
|---|
+GraphChangeEvent
++public GraphChangeEvent(java.lang.Object eventSource, + int type)+
-
+
- Creates a new graph change event.
+
+
-
+
- Parameters:
eventSource- the source of the event.type- the type of event.
| +Method Detail | +
|---|
+getType
++public int getType()+
-
+
- Returns the event type.
+
+
-
+
+
- Returns:
- the event type.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphEdgeChangeEvent.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphEdgeChangeEvent.html new file mode 100644 index 00000000..4806ffea --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphEdgeChangeEvent.html @@ -0,0 +1,436 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class GraphEdgeChangeEvent<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable +
+
-
+
public class GraphEdgeChangeEvent<V,E>
- extends GraphChangeEvent
+An event which indicates that a graph edge has changed, or is about to
+ change. The event can be used either as an indication after the edge
+ has been added or removed, or before it is added. The type of the
+ event can be tested using the GraphChangeEvent.getType() method.
+
+ +
+
-
+
- Since: +
- Aug 10, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+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. |
+
| Fields inherited from class org.jgrapht.event.GraphChangeEvent | +
|---|
type |
+
| Fields inherited from class java.util.EventObject | +
|---|
source |
+
| +Constructor Summary | +|
|---|---|
GraphEdgeChangeEvent(java.lang.Object eventSource,
+ int type,
+ E e)
+
++ Constructor for GraphEdgeChangeEvent. |
+|
| +Method Summary | +|
|---|---|
+ E |
+getEdge()
+
++ Returns the edge that this event is related to. |
+
| Methods inherited from class org.jgrapht.event.GraphChangeEvent | +
|---|
getType |
+
| Methods inherited from class java.util.EventObject | +
|---|
getSource, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+BEFORE_EDGE_ADDED
++public static final int BEFORE_EDGE_ADDED+
-
+
- Before edge added event. This event is fired before an edge is added to a
+ graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+BEFORE_EDGE_REMOVED
++public static final int BEFORE_EDGE_REMOVED+
-
+
- Before edge removed event. This event is fired before an edge is removed
+ from a graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+EDGE_ADDED
++public static final int EDGE_ADDED+
-
+
- Edge added event. This event is fired after an edge is added to a graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+EDGE_REMOVED
++public static final int EDGE_REMOVED+
-
+
- Edge removed event. This event is fired after an edge is removed from a
+ graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+edge
++protected E edge+
-
+
- The edge that this event is related to.
+
+
-
+
| +Constructor Detail | +
|---|
+GraphEdgeChangeEvent
++public GraphEdgeChangeEvent(java.lang.Object eventSource, + int type, + E e)+
-
+
- Constructor for GraphEdgeChangeEvent.
+
+
-
+
- Parameters:
eventSource- the source of this event.type- the event type of this event.e- the edge that this event is related to.
| +Method Detail | +
|---|
+getEdge
++public E getEdge()+
-
+
- Returns the edge that this event is related to.
+
+
-
+
+
- Returns:
- the edge that this event is related to.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphListener.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphListener.html new file mode 100644 index 00000000..871d2c4d --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphListener.html @@ -0,0 +1,261 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Interface GraphListener<V,E>
+-
+
- All Superinterfaces:
- java.util.EventListener, VertexSetListener<V> +
-
+
- All Known Implementing Classes:
- ConnectivityInspector, DirectedNeighborIndex, NeighborIndex +
+
-
+
public interface GraphListener<V,E>
- extends VertexSetListener<V>
+A listener that is notified when the graph changes. + +
If only notifications on vertex set changes are required it is more + efficient to use the VertexSetListener.
++ +
+
-
+
- Since: +
- Jul 18, 2003 +
- Author: +
- Barak Naveh +
- See Also:
VertexSetListener
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from interface org.jgrapht.event.VertexSetListener | +
|---|
vertexAdded, vertexRemoved |
+
| +Method Detail | +
|---|
+edgeAdded
++void edgeAdded(GraphEdgeChangeEvent<V,E> e)+
-
+
- Notifies that an edge has been added to the graph.
+
+
-
+
-
+
- Parameters:
e- the edge event.
+ +
+edgeRemoved
++void edgeRemoved(GraphEdgeChangeEvent<V,E> e)+
-
+
- Notifies that an edge has been removed from the graph.
+
+
-
+
-
+
- Parameters:
e- the edge event.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphVertexChangeEvent.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphVertexChangeEvent.html new file mode 100644 index 00000000..4e1b453f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/GraphVertexChangeEvent.html @@ -0,0 +1,437 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class GraphVertexChangeEvent<V>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable +
+
-
+
public class GraphVertexChangeEvent<V>
- extends GraphChangeEvent
+An event which indicates that a graph vertex has changed, or is about to
+ change. The event can be used either as an indication after the vertex
+ has been added or removed, or before it is added. The type of the
+ event can be tested using the GraphChangeEvent.getType() method.
+
+ +
+
-
+
- Since: +
- Aug 10, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+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. |
+
| Fields inherited from class org.jgrapht.event.GraphChangeEvent | +
|---|
type |
+
| Fields inherited from class java.util.EventObject | +
|---|
source |
+
| +Constructor Summary | +|
|---|---|
GraphVertexChangeEvent(java.lang.Object eventSource,
+ int type,
+ V vertex)
+
++ Creates a new GraphVertexChangeEvent object. |
+|
| +Method Summary | +|
|---|---|
+ V |
+getVertex()
+
++ Returns the vertex that this event is related to. |
+
| Methods inherited from class org.jgrapht.event.GraphChangeEvent | +
|---|
getType |
+
| Methods inherited from class java.util.EventObject | +
|---|
getSource, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+BEFORE_VERTEX_ADDED
++public static final int BEFORE_VERTEX_ADDED+
-
+
- Before vertex added event. This event is fired before a vertex is added
+ to a graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+BEFORE_VERTEX_REMOVED
++public static final int BEFORE_VERTEX_REMOVED+
-
+
- Before vertex removed event. This event is fired before a vertex is
+ removed from a graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+VERTEX_ADDED
++public static final int VERTEX_ADDED+
-
+
- Vertex added event. This event is fired after a vertex is added to a
+ graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+VERTEX_REMOVED
++public static final int VERTEX_REMOVED+
-
+
- Vertex removed event. This event is fired after a vertex is removed from
+ a graph.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+vertex
++protected V vertex+
-
+
- The vertex that this event is related to.
+
+
-
+
| +Constructor Detail | +
|---|
+GraphVertexChangeEvent
++public GraphVertexChangeEvent(java.lang.Object eventSource, + int type, + V vertex)+
-
+
- Creates a new GraphVertexChangeEvent object.
+
+
-
+
- Parameters:
eventSource- the source of the event.type- the type of the event.vertex- the vertex that the event is related to.
| +Method Detail | +
|---|
+getVertex
++public V getVertex()+
-
+
- Returns the vertex that this event is related to.
+
+
-
+
+
- Returns:
- the vertex that this event is related to.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/TraversalListener.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/TraversalListener.html new file mode 100644 index 00000000..6258e2ca --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/TraversalListener.html @@ -0,0 +1,317 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Interface TraversalListener<V,E>
+-
+
- All Known Implementing Classes:
- TraversalListenerAdapter +
+
-
+
public interface TraversalListener<V,E>
+A listener on graph iterator or on a graph traverser. +
+ +
+
-
+
- Since: +
- Jul 19, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| +Method Detail | +
|---|
+connectedComponentFinished
++void connectedComponentFinished(ConnectedComponentTraversalEvent e)+
-
+
- Called to inform listeners that the traversal of the current connected
+ component has finished.
+
+
-
+
- Parameters:
e- the traversal event.
+ +
+connectedComponentStarted
++void connectedComponentStarted(ConnectedComponentTraversalEvent e)+
-
+
- Called to inform listeners that a traversal of a new connected component
+ has started.
+
+
-
+
- Parameters:
e- the traversal event.
+ +
+edgeTraversed
++void edgeTraversed(EdgeTraversalEvent<V,E> e)+
-
+
- Called to inform the listener that the specified edge have been visited
+ during the graph traversal. Depending on the traversal algorithm, edge
+ might be visited more than once.
+
+
-
+
- Parameters:
e- the edge traversal event.
+ +
+vertexTraversed
++void vertexTraversed(VertexTraversalEvent<V> e)+
-
+
- Called to inform the listener that the specified vertex have been visited
+ during the graph traversal. Depending on the traversal algorithm, vertex
+ might be visited more than once.
+
+
-
+
- Parameters:
e- the vertex traversal event.
+ +
+vertexFinished
++void vertexFinished(VertexTraversalEvent<V> e)+
-
+
- Called to inform the listener that the specified vertex have been
+ finished during the graph traversal. Exact meaning of "finish" is
+ algorithm-dependent; e.g. for DFS, it means that all vertices reachable
+ via the vertex have been visited as well.
+
+
-
+
- Parameters:
e- the vertex traversal event.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/TraversalListenerAdapter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/TraversalListenerAdapter.html new file mode 100644 index 00000000..d68b0935 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/TraversalListenerAdapter.html @@ -0,0 +1,384 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class TraversalListenerAdapter<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- TraversalListener<V,E> +
+
-
+
public class TraversalListenerAdapter<V,E>
- extends java.lang.Object
- implements TraversalListener<V,E>
- extends java.lang.Object
+An empty do-nothing implementation of the TraversalListener interface
+ used for subclasses.
+
+ +
+
-
+
- Since: +
- Aug 6, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Constructor Summary | +|
|---|---|
TraversalListenerAdapter()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+TraversalListenerAdapter
++public TraversalListenerAdapter()+
-
+
| +Method Detail | +
|---|
+connectedComponentFinished
++public void connectedComponentFinished(ConnectedComponentTraversalEvent e)+
-
+
- Description copied from interface:
TraversalListener
+ - Called to inform listeners that the traversal of the current connected
+ component has finished.
+
+
-
+
- Specified by:
connectedComponentFinishedin interfaceTraversalListener<V,E>
-
+
- Parameters:
e- the traversal event.- See Also:
TraversalListener.connectedComponentFinished(ConnectedComponentTraversalEvent)
+ +
+connectedComponentStarted
++public void connectedComponentStarted(ConnectedComponentTraversalEvent e)+
-
+
- Description copied from interface:
TraversalListener
+ - Called to inform listeners that a traversal of a new connected component
+ has started.
+
+
-
+
- Specified by:
connectedComponentStartedin interfaceTraversalListener<V,E>
-
+
- Parameters:
e- the traversal event.- See Also:
TraversalListener.connectedComponentStarted(ConnectedComponentTraversalEvent)
+ +
+edgeTraversed
++public void edgeTraversed(EdgeTraversalEvent<V,E> e)+
-
+
- Description copied from interface:
TraversalListener
+ - Called to inform the listener that the specified edge have been visited
+ during the graph traversal. Depending on the traversal algorithm, edge
+ might be visited more than once.
+
+
-
+
- Specified by:
edgeTraversedin interfaceTraversalListener<V,E>
-
+
- Parameters:
e- the edge traversal event.- See Also:
TraversalListener.edgeTraversed(EdgeTraversalEvent)
+ +
+vertexTraversed
++public void vertexTraversed(VertexTraversalEvent<V> e)+
-
+
- Description copied from interface:
TraversalListener
+ - Called to inform the listener that the specified vertex have been visited
+ during the graph traversal. Depending on the traversal algorithm, vertex
+ might be visited more than once.
+
+
-
+
- Specified by:
vertexTraversedin interfaceTraversalListener<V,E>
-
+
- Parameters:
e- the vertex traversal event.- See Also:
TraversalListener.vertexTraversed(VertexTraversalEvent)
+ +
+vertexFinished
++public void vertexFinished(VertexTraversalEvent<V> e)+
-
+
- Description copied from interface:
TraversalListener
+ - Called to inform the listener that the specified vertex have been
+ finished during the graph traversal. Exact meaning of "finish" is
+ algorithm-dependent; e.g. for DFS, it means that all vertices reachable
+ via the vertex have been visited as well.
+
+
-
+
- Specified by:
vertexFinishedin interfaceTraversalListener<V,E>
-
+
- Parameters:
e- the vertex traversal event.- See Also:
TraversalListener.vertexFinished(VertexTraversalEvent)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/VertexSetListener.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/VertexSetListener.html new file mode 100644 index 00000000..7c057469 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/VertexSetListener.html @@ -0,0 +1,255 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Interface VertexSetListener<V>
+-
+
- All Superinterfaces:
- java.util.EventListener +
-
+
- All Known Subinterfaces:
- GraphListener<V,E> +
-
+
- All Known Implementing Classes:
- ConnectivityInspector, DirectedNeighborIndex, NeighborIndex +
+
-
+
public interface VertexSetListener<V>
- extends java.util.EventListener
+A listener that is notified when the graph's vertex set changes. It should be
+ used when only notifications on vertex-set changes are of interest. If
+ all graph notifications are of interest better use
+ GraphListener.
+
+ +
+
-
+
- Since: +
- Jul 18, 2003 +
- Author: +
- Barak Naveh +
- See Also:
GraphListener
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| +Method Detail | +
|---|
+vertexAdded
++void vertexAdded(GraphVertexChangeEvent<V> e)+
-
+
- Notifies that a vertex has been added to the graph.
+
+
-
+
-
+
- Parameters:
e- the vertex event.
+ +
+vertexRemoved
++void vertexRemoved(GraphVertexChangeEvent<V> e)+
-
+
- Notifies that a vertex has been removed from the graph.
+
+
-
+
-
+
- Parameters:
e- the vertex event.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/VertexTraversalEvent.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/VertexTraversalEvent.html new file mode 100644 index 00000000..f8a0ce3f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/VertexTraversalEvent.html @@ -0,0 +1,329 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.event
+
+Class VertexTraversalEvent<V>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable +
+
-
+
public class VertexTraversalEvent<V>
- extends java.util.EventObject
+A traversal event for a graph vertex. +
+ +
+
-
+
- Since: +
- Aug 11, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+protected V |
+vertex
+
++ The traversed vertex. |
+
| Fields inherited from class java.util.EventObject | +
|---|
source |
+
| +Constructor Summary | +|
|---|---|
VertexTraversalEvent(java.lang.Object eventSource,
+ V vertex)
+
++ Creates a new VertexTraversalEvent. |
+|
| +Method Summary | +|
|---|---|
+ V |
+getVertex()
+
++ Returns the traversed vertex. |
+
| Methods inherited from class java.util.EventObject | +
|---|
getSource, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+vertex
++protected V vertex+
-
+
- The traversed vertex.
+
+
-
+
| +Constructor Detail | +
|---|
+VertexTraversalEvent
++public VertexTraversalEvent(java.lang.Object eventSource, + V vertex)+
-
+
- Creates a new VertexTraversalEvent.
+
+
-
+
- Parameters:
eventSource- the source of the event.vertex- the traversed vertex.
| +Method Detail | +
|---|
+getVertex
++public V getVertex()+
-
+
- Returns the traversed vertex.
+
+
-
+
+
- Returns:
- the traversed vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/package-frame.html new file mode 100644 index 00000000..802f8cd4 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/package-frame.html @@ -0,0 +1,59 @@ + + + + + +
|
+Interfaces
+
+ +GraphListener + +TraversalListener + +VertexSetListener |
+
|
+Classes
+
+ +ConnectedComponentTraversalEvent + +EdgeTraversalEvent + +GraphChangeEvent + +GraphEdgeChangeEvent + +GraphVertexChangeEvent + +TraversalListenerAdapter + +VertexTraversalEvent |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.event +
+Event classes and listener interfaces, used to provide a change +notification mechanism on graph modification events. +
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| 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 Summary | +|
|---|---|
| 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. | +
+Package org.jgrapht.event Description +
+ ++Event classes and listener interfaces, used to provide a change +notification mechanism on graph modification events. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/package-tree.html new file mode 100644 index 00000000..23ce67e0 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/event/package-tree.html @@ -0,0 +1,166 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.event +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- java.util.EventObject (implements java.io.Serializable)
+
-
+
- org.jgrapht.event.ConnectedComponentTraversalEvent
- org.jgrapht.event.EdgeTraversalEvent<V,E>
- org.jgrapht.event.GraphChangeEvent
-
+
- org.jgrapht.event.GraphEdgeChangeEvent<V,E>
- org.jgrapht.event.GraphVertexChangeEvent<V>
- org.jgrapht.event.VertexTraversalEvent<V>
- org.jgrapht.event.TraversalListenerAdapter<V,E> (implements org.jgrapht.event.TraversalListener<V,E>) +
- java.util.EventObject (implements java.io.Serializable)
+
+Interface Hierarchy +
+-
+
- java.util.EventListener
-
+
- org.jgrapht.event.VertexSetListener<V>
-
+
- org.jgrapht.event.GraphListener<V,E>
- org.jgrapht.event.VertexSetListener<V>
- org.jgrapht.event.TraversalListener<V,E>
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/DOTExporter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/DOTExporter.html new file mode 100644 index 00000000..4b78089c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/DOTExporter.html @@ -0,0 +1,296 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class DOTExporter<V,E>
++java.lang.Object ++
+
-
+
public class DOTExporter<V,E>
- extends java.lang.Object
+Exports a graph into a DOT file. + +
For a description of the format see + http://en.wikipedia.org/wiki/DOT_language.
++ +
+
-
+
- Author: +
- Trevor Harmon +
+ +
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ void |
+export(java.io.Writer writer,
+ Graph<V,E> g)
+
++ Exports a graph into a plain text file in DOT format. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+DOTExporter
++public 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
++public DOTExporter(VertexNameProvider<V> vertexIDProvider, + VertexNameProvider<V> vertexLabelProvider, + EdgeNameProvider<E> edgeLabelProvider)+
-
+
- Constructs a new DOTExporter object with the given ID and label
+ providers.
+
+
-
+
- Parameters:
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.
| +Method Detail | +
|---|
+export
++public void export(java.io.Writer writer, + Graph<V,E> g)+
-
+
- Exports a graph into a plain text file in DOT format.
+
+
-
+
- Parameters:
writer- the writer to which the graph to be exportedg- the graph to be exported
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/EdgeNameProvider.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/EdgeNameProvider.html new file mode 100644 index 00000000..3d8a251b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/EdgeNameProvider.html @@ -0,0 +1,215 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Interface EdgeNameProvider<E>
+-
+
- All Known Implementing Classes:
- IntegerEdgeNameProvider, StringEdgeNameProvider +
+
-
+
public interface EdgeNameProvider<E>
+Assigns a display name for each of the graph edes. +
+ +
+
+ +
| +Method Summary | +|
|---|---|
+ java.lang.String |
+getEdgeName(E edge)
+
++ Returns a unique name for an edge. |
+
| +Method Detail | +
|---|
+getEdgeName
++java.lang.String getEdgeName(E edge)+
-
+
- Returns a unique name for an edge. This is useful when exporting a graph,
+ as it ensures that all edges are assigned simple, consistent names.
+
+
-
+
- Parameters:
edge- the edge to be named +- Returns:
- the name of the edge
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/GmlExporter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/GmlExporter.html new file mode 100644 index 00000000..6725fc78 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/GmlExporter.html @@ -0,0 +1,474 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class GmlExporter<V,E>
++java.lang.Object ++
+
-
+
public class GmlExporter<V,E>
- extends java.lang.Object
+Exports a graph into a GML file (Graph Modelling Language). + +
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.
+ +
+
-
+
- Author: +
- Dimitrios Michail +
+ +
| +Field Summary | +|
|---|---|
+static java.lang.Integer |
+PRINT_EDGE_LABELS
+
++ Option to export only the edge labels. |
+
+static java.lang.Integer |
+PRINT_EDGE_VERTEX_LABELS
+
++ Option to export both edge and vertex labels. |
+
+static java.lang.Integer |
+PRINT_NO_LABELS
+
++ Option to export no vertex or edge labels. |
+
+static java.lang.Integer |
+PRINT_VERTEX_LABELS
+
++ Option to export only the vertex labels. |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ void |
+export(java.io.Writer output,
+ DirectedGraph<V,E> g)
+
++ Exports a directed graph into a plain text file in GML format. |
+
+ void |
+export(java.io.Writer output,
+ UndirectedGraph<V,E> g)
+
++ Exports an undirected graph into a plain text file in GML format. |
+
+ java.lang.Integer |
+getPrintLabels()
+
++ Get whether to export the vertex and edge labels. |
+
+ void |
+setPrintLabels(java.lang.Integer i)
+
++ Set whether to export the vertex and edge labels. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+PRINT_NO_LABELS
++public static final java.lang.Integer PRINT_NO_LABELS+
-
+
- Option to export no vertex or edge labels.
+
+
-
+
+ +
+PRINT_EDGE_LABELS
++public static final java.lang.Integer PRINT_EDGE_LABELS+
-
+
- Option to export only the edge labels.
+
+
-
+
+ +
+PRINT_EDGE_VERTEX_LABELS
++public static final java.lang.Integer PRINT_EDGE_VERTEX_LABELS+
-
+
- Option to export both edge and vertex labels.
+
+
-
+
+ +
+PRINT_VERTEX_LABELS
++public static final java.lang.Integer PRINT_VERTEX_LABELS+
-
+
- Option to export only the vertex labels.
+
+
-
+
| +Constructor Detail | +
|---|
+GmlExporter
++public 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
++public 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.
+
+
-
+
- Parameters:
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.
| +Method Detail | +
|---|
+export
++public void export(java.io.Writer output, + UndirectedGraph<V,E> g)+
-
+
- Exports an undirected graph into a plain text file in GML format.
+
+
-
+
- Parameters:
output- the writer to which the graph to be exportedg- the undirected graph to be exported
+ +
+export
++public void export(java.io.Writer output, + DirectedGraph<V,E> g)+
-
+
- Exports a directed graph into a plain text file in GML format.
+
+
-
+
- Parameters:
output- the writer to which the graph to be exportedg- the directed graph to be exported
+ +
+setPrintLabels
++public void setPrintLabels(java.lang.Integer i)+
-
+
- Set whether to export the vertex and edge labels. The default behavior is
+ to export no vertex or edge labels.
+
+
-
+
- Parameters:
i- What labels to export. Valid options arePRINT_NO_LABELS,PRINT_EDGE_LABELS,PRINT_EDGE_VERTEX_LABELS, andPRINT_VERTEX_LABELS. +- Throws: +
java.lang.IllegalArgumentException- if a non-supported value is used- See Also:
PRINT_NO_LABELS, +PRINT_EDGE_LABELS, +PRINT_EDGE_VERTEX_LABELS, +PRINT_VERTEX_LABELS
+ +
+getPrintLabels
++public java.lang.Integer getPrintLabels()+
-
+
- Get whether to export the vertex and edge labels.
+
+
-
+
+
- Returns:
- One of the
PRINT_NO_LABELS,PRINT_EDGE_LABELS, +PRINT_EDGE_VERTEX_LABELS, orPRINT_VERTEX_LABELS.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/GraphMLExporter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/GraphMLExporter.html new file mode 100644 index 00000000..be6a9c42 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/GraphMLExporter.html @@ -0,0 +1,305 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class GraphMLExporter<V,E>
++java.lang.Object ++
+
-
+
public class GraphMLExporter<V,E>
- extends java.lang.Object
+Exports a graph into a GraphML file. + +
For a description of the format see + http://en.wikipedia.org/wiki/GraphML.
++ +
+
-
+
- Author: +
- Trevor Harmon +
+ +
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ void |
+export(java.io.Writer writer,
+ Graph<V,E> g)
+
++ Exports a graph into a plain text file in GraphML format. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+GraphMLExporter
++public 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
++public 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.
+
+
-
+
- Parameters:
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.
| +Method Detail | +
|---|
+export
++public void export(java.io.Writer writer, + Graph<V,E> g) + throws org.xml.sax.SAXException, + javax.xml.transform.TransformerConfigurationException+
-
+
- Exports a graph into a plain text file in GraphML format.
+
+
-
+
- Parameters:
writer- the writer to which the graph to be exportedg- the graph to be exported +- Throws: +
org.xml.sax.SAXException+javax.xml.transform.TransformerConfigurationException
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/IntegerEdgeNameProvider.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/IntegerEdgeNameProvider.html new file mode 100644 index 00000000..90af64fe --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/IntegerEdgeNameProvider.html @@ -0,0 +1,294 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class IntegerEdgeNameProvider<E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- EdgeNameProvider<E> +
+
-
+
public class IntegerEdgeNameProvider<E>
- extends java.lang.Object
- implements EdgeNameProvider<E>
- extends java.lang.Object
+Assigns a unique integer to represent each edge. Each instance of + IntegerEdgeNameProvider maintains an internal map between every edge it has + ever seen and the unique integer representing that edge. As a result it is + probably desirable to have a separate instance for each distinct graph. +
+ +
+
-
+
- Author: +
- Trevor Harmon +
+ +
| +Constructor Summary | +|
|---|---|
IntegerEdgeNameProvider()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ void |
+clear()
+
++ Clears all cached identifiers, and resets the unique identifier counter. |
+
+ java.lang.String |
+getEdgeName(E edge)
+
++ Returns the String representation of an edge. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+IntegerEdgeNameProvider
++public IntegerEdgeNameProvider()+
-
+
| +Method Detail | +
|---|
+clear
++public void clear()+
-
+
- Clears all cached identifiers, and resets the unique identifier counter.
+
+
-
+
-
+
+ +
+getEdgeName
++public java.lang.String getEdgeName(E edge)+
-
+
- Returns the String representation of an edge.
+
+
-
+
- Specified by:
getEdgeNamein interfaceEdgeNameProvider<E>
-
+
- Parameters:
edge- the edge to be named +- Returns:
- the name of the edge
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/IntegerNameProvider.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/IntegerNameProvider.html new file mode 100644 index 00000000..12f8de2f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/IntegerNameProvider.html @@ -0,0 +1,296 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class IntegerNameProvider<V>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- VertexNameProvider<V> +
+
-
+
public class IntegerNameProvider<V>
- extends java.lang.Object
- implements VertexNameProvider<V>
- extends java.lang.Object
+Assigns a unique integer to represent each vertex. Each instance of + IntegerNameProvider maintains an internal map between every vertex it has + ever seen and the unique integer representing that vertex. As a result it is + probably desirable to have a separate instance for each distinct graph. +
+ +
+
-
+
- Author: +
- Charles Fry +
+ +
| +Constructor Summary | +|
|---|---|
IntegerNameProvider()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ void |
+clear()
+
++ Clears all cached identifiers, and resets the unique identifier counter. |
+
+ java.lang.String |
+getVertexName(V vertex)
+
++ Returns the String representation of the unique integer representing a + vertex. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+IntegerNameProvider
++public IntegerNameProvider()+
-
+
| +Method Detail | +
|---|
+clear
++public void clear()+
-
+
- Clears all cached identifiers, and resets the unique identifier counter.
+
+
-
+
-
+
+ +
+getVertexName
++public java.lang.String getVertexName(V vertex)+
-
+
- Returns the String representation of the unique integer representing a
+ vertex.
+
+
-
+
- Specified by:
getVertexNamein interfaceVertexNameProvider<V>
-
+
- Parameters:
vertex- the vertex to be named +- Returns:
- the name of
- See Also:
GraphListener.edgeAdded(GraphEdgeChangeEvent)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.CellFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.CellFactory.html new file mode 100644 index 00000000..6e28a0dc --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.CellFactory.html @@ -0,0 +1,245 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Interface JGraphModelAdapter.CellFactory<VV,EE>
+-
+
- All Known Implementing Classes:
- JGraphModelAdapter.DefaultCellFactory +
-
+
- Enclosing class:
- JGraphModelAdapter<V,E> +
+
-
+
public static interface JGraphModelAdapter.CellFactory<VV,EE>
+Creates the JGraph cells that reflect the respective JGraphT elements. +
+ +
+
-
+
- Since: +
- Dec 12, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| +Method Detail | +
|---|
+createEdgeCell
++org.jgraph.graph.DefaultEdge createEdgeCell(EE jGraphTEdge)+
-
+
- Creates an edge cell that contains its respective JGraphT edge.
+
+
-
+
- Parameters:
jGraphTEdge- a JGraphT edge to be contained. +- Returns:
- an edge cell that contains its respective JGraphT edge.
+ +
+createVertexCell
++org.jgraph.graph.DefaultGraphCell createVertexCell(VV jGraphTVertex)+
-
+
- Creates a vertex cell that contains its respective JGraphT vertex.
+
+
-
+
- Parameters:
jGraphTVertex- a JGraphT vertex to be contained. +- Returns:
- a vertex cell that contains its respective JGraphT vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.DefaultCellFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.DefaultCellFactory.html new file mode 100644 index 00000000..af87f86f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.DefaultCellFactory.html @@ -0,0 +1,299 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class JGraphModelAdapter.DefaultCellFactory<VV,EE>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, JGraphModelAdapter.CellFactory<VV,EE> +
-
+
- Enclosing class:
- JGraphModelAdapter<V,E> +
+
-
+
public static class JGraphModelAdapter.DefaultCellFactory<VV,EE>
- extends java.lang.Object
- implements JGraphModelAdapter.CellFactory<VV,EE>, java.io.Serializable
- extends java.lang.Object
+A simple default cell factory. +
+ +
+
-
+
- Since: +
- Dec 12, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
JGraphModelAdapter.DefaultCellFactory()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+JGraphModelAdapter.DefaultCellFactory
++public JGraphModelAdapter.DefaultCellFactory()+
-
+
| +Method Detail | +
|---|
+createEdgeCell
++public org.jgraph.graph.DefaultEdge createEdgeCell(EE jGraphTEdge)+
-
+
- Description copied from interface:
JGraphModelAdapter.CellFactory
+ - Creates an edge cell that contains its respective JGraphT edge.
+
+
-
+
- Specified by:
createEdgeCellin interfaceJGraphModelAdapter.CellFactory<VV,EE>
-
+
- Parameters:
jGraphTEdge- a JGraphT edge to be contained. +- Returns:
- an edge cell that contains its respective JGraphT edge.
- See Also:
JGraphModelAdapter.CellFactory.createEdgeCell(Object)
+ +
+createVertexCell
++public org.jgraph.graph.DefaultGraphCell createVertexCell(VV jGraphTVertex)+
-
+
- Description copied from interface:
JGraphModelAdapter.CellFactory
+ - Creates a vertex cell that contains its respective JGraphT vertex.
+
+
-
+
- Specified by:
createVertexCellin interfaceJGraphModelAdapter.CellFactory<VV,EE>
-
+
- Parameters:
jGraphTVertex- a JGraphT vertex to be contained. +- Returns:
- a vertex cell that contains its respective JGraphT vertex.
- See Also:
JGraphModelAdapter.CellFactory.createVertexCell(Object)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.html new file mode 100644 index 00000000..ff16543c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/JGraphModelAdapter.html @@ -0,0 +1,659 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class JGraphModelAdapter<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, org.jgraph.graph.GraphModel +
+
-
+
public class JGraphModelAdapter<V,E>
- extends org.jgraph.graph.DefaultGraphModel
+An adapter that reflects a JGraphT graph as a JGraph graph. This adapter is + useful when using JGraph in order to visualize JGraphT graphs. For more about + JGraph see + http://jgraph.sourceforge.net + +
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.
++ +
+
-
+
- Since: +
- Aug 2, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Nested Class Summary | +|
|---|---|
+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. |
+
| Nested classes/interfaces inherited from class org.jgraph.graph.DefaultGraphModel | +
|---|
org.jgraph.graph.DefaultGraphModel.EmptyIterator, org.jgraph.graph.DefaultGraphModel.GraphModelEdit, org.jgraph.graph.DefaultGraphModel.GraphModelLayerEdit |
+
| +Field Summary | +
|---|
| Fields inherited from class org.jgraph.graph.DefaultGraphModel | +
|---|
asksAllowsChildren, attributes, emptyIterator, listenerList, roots |
+
| Fields inherited from class javax.swing.undo.UndoableEditSupport | +
|---|
compoundEdit, listeners, realSource, updateLevel |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+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(java.lang.Object jGraphTVertex)
+
++ Returns the JGraph vertex cell that corresponds to the specified JGraphT + vertex. |
+|
+ org.jgraph.graph.DefaultPort |
+getVertexPort(java.lang.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. |
+|
| Methods inherited from class org.jgraph.graph.DefaultGraphModel | +
|---|
acceptsSource, acceptsTarget, addGraphModelListener, cellsChanged, cloneCell, cloneCell, cloneCell, cloneCells, cloneUserObject, connect, contains, containsEdgeBetween, createEdit, createLayerEdit, createRemoveEdit, edges, edit, edit, fireGraphChanged, getAll, getAttributes, getAttributes, getChild, getChildCount, getConnectionSet, getDescendants, getEdges, getEdges, getEdgesBetween, getGraphModelListeners, getIncomingEdges, getIndexOfChild, getIndexOfRoot, getOpposite, getOutgoingEdges, getParent, getRootAt, getRootCount, getRoots, getRoots, getRoots, getSource, getSourceVertex, getTarget, getTargetVertex, getTopmostCells, getUserObject, getValue, handleAttributes, handleConnection, handleConnectionSet, handleInsert, handleParentMap, handleRemove, hasAncestorIn, insert, isEdge, isGroup, isLeaf, isPort, isVertex, order, remove, removeGraphModelListener, setParent, setSourcePort, setTargetPort, toBack, toFront, valueForCellChanged |
+
| Methods inherited from class javax.swing.undo.UndoableEditSupport | +
|---|
_postEdit, addUndoableEditListener, beginUpdate, createCompoundEdit, endUpdate, getUndoableEditListeners, getUpdateLevel, postEdit, removeUndoableEditListener, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgraph.graph.GraphModel | +
|---|
addUndoableEditListener, removeUndoableEditListener |
+
| +Constructor Detail | +
|---|
+JGraphModelAdapter
++public JGraphModelAdapter(Graph<V,E> jGraphTGraph)+
-
+
- Constructs a new JGraph model adapter for the specified JGraphT graph.
+
+
-
+
- Parameters:
jGraphTGraph- the JGraphT graph for which JGraph model adapter to + be created.nullis NOT permitted.
+ +
+JGraphModelAdapter
++public 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.
+
+
-
+
- Parameters:
jGraphTGraph- the JGraphT graph for which JGraph model adapter to + be created.nullis NOT permitted.defaultVertexAttributes- a default map of JGraph attributes to + format vertices.nullis NOT permitted.defaultEdgeAttributes- a default map of JGraph attributes to format + edges.nullis NOT permitted.
+ +
+JGraphModelAdapter
++public 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.
+
+
-
+
- Parameters:
jGraphTGraph- the JGraphT graph for which JGraph model adapter to + be created.nullis NOT permitted.defaultVertexAttributes- a default map of JGraph attributes to + format vertices.nullis NOT permitted.defaultEdgeAttributes- a default map of JGraph attributes to format + edges.nullis NOT permitted.cellFactory- aJGraphModelAdapter.CellFactoryto be used to create the JGraph + cells.nullis NOT permitted. +- Throws: +
java.lang.IllegalArgumentException
| +Method Detail | +
|---|
+createDefaultEdgeAttributes
++public 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.
+
+
-
+
- Parameters:
jGraphTGraph- the graph for which default edge attributes to be + created. +- Returns:
- a map of attributes to be used as default for edge attributes.
+ +
+createDefaultVertexAttributes
++public static org.jgraph.graph.AttributeMap createDefaultVertexAttributes()+
-
+
- Creates and returns a map of attributes to be used as defaults for vertex
+ attributes.
+
+
-
+
+
- Returns:
- a map of attributes to be used as defaults for vertex attributes.
+ +
+getCellFactory
++public JGraphModelAdapter.CellFactory<V,E> getCellFactory()+
-
+
- Returns the cell factory used to create the JGraph cells.
+
+
-
+
+
- Returns:
- the cell factory used to create the JGraph cells.
+ +
+setDefaultEdgeAttributes
++public void setDefaultEdgeAttributes(org.jgraph.graph.AttributeMap defaultEdgeAttributes)+
-
+
- Sets the default edge attributes used for creating new JGraph edges.
+
+
-
+
- Parameters:
defaultEdgeAttributes- the default edge attributes to set.
+ +
+getDefaultEdgeAttributes
++public org.jgraph.graph.AttributeMap getDefaultEdgeAttributes()+
-
+
- Returns the default edge attributes used for creating new JGraph edges.
+
+
-
+
+
- Returns:
- the default edge attributes used for creating new JGraph edges.
+ +
+setDefaultVertexAttributes
++public void setDefaultVertexAttributes(org.jgraph.graph.AttributeMap defaultVertexAttributes)+
-
+
- Sets the default vertex attributes used for creating new JGraph vertices.
+
+
-
+
- Parameters:
defaultVertexAttributes- the default vertex attributes to set.
+ +
+getDefaultVertexAttributes
++public org.jgraph.graph.AttributeMap getDefaultVertexAttributes()+
-
+
- Returns the default vertex attributes used for creating new JGraph
+ vertices.
+
+
-
+
+
- Returns:
- the default vertex attributes used for creating new JGraph + vertices.
+ +
+getEdgeCell
++public org.jgraph.graph.DefaultEdge getEdgeCell(E jGraphTEdge)+
-
+
- Returns the JGraph edge cell that corresponds to the specified JGraphT
+ edge. If no corresponding cell found, returns
null. ++
-
+
- Parameters:
jGraphTEdge- a JGraphT edge of the JGraphT graph. +- Returns:
- the JGraph edge cell that corresponds to the specified JGraphT
+ edge, or
nullif no corresponding cell found.
+ +
+getVertexCell
++public org.jgraph.graph.DefaultGraphCell getVertexCell(java.lang.Object jGraphTVertex)+
-
+
- Returns the JGraph vertex cell that corresponds to the specified JGraphT
+ vertex. If no corresponding cell found, returns
null. ++
-
+
- Parameters:
jGraphTVertex- a JGraphT vertex of the JGraphT graph. +- Returns:
- the JGraph vertex cell that corresponds to the specified JGraphT
+ vertex, or
nullif no corresponding cell found.
+ +
+getVertexPort
++public org.jgraph.graph.DefaultPort getVertexPort(java.lang.Object jGraphTVertex)+
-
+
- Returns the JGraph port cell that corresponds to the specified JGraphT
+ vertex. If no corresponding port found, returns
null. ++
-
+
- Parameters:
jGraphTVertex- a JGraphT vertex of the JGraphT graph. +- Returns:
- the JGraph port cell that corresponds to the specified JGraphT
+ vertex, or
nullif no corresponding cell found.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/MatrixExporter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/MatrixExporter.html new file mode 100644 index 00000000..d9388c14 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/MatrixExporter.html @@ -0,0 +1,357 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class MatrixExporter<V,E>
++java.lang.Object ++
+
-
+
public class MatrixExporter<V,E>
- extends java.lang.Object
+Exports a graph to a plain text matrix format, which can be processed by + matrix manipulation software, such as + MTJ or MATLAB. +
+ +
+
-
+
- Author: +
- Charles Fry +
+ +
| +Constructor Summary | +|
|---|---|
MatrixExporter()
+
++ Creates a new MatrixExporter object. |
+|
| +Method Summary | +|
|---|---|
+ void |
+exportAdjacencyMatrix(java.io.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(java.io.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(java.io.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(java.io.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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+MatrixExporter
++public MatrixExporter()+
-
+
- Creates a new MatrixExporter object.
+
+
| +Method Detail | +
|---|
+exportAdjacencyMatrix
++public void exportAdjacencyMatrix(java.io.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. The value stored
+ in each position of the matrix indicates the number of edges between two
+ vertices. With an undirected graph, the adjacency matrix is symetric.
+
+
-
+
- Parameters:
output- the writer to which the graph to be exported.g- the graph to be exported.
+ +
+exportAdjacencyMatrix
++public void exportAdjacencyMatrix(java.io.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. The value stored
+ in each position of the matrix indicates the number of directed edges
+ going from one vertex to another.
+
+
-
+
- Parameters:
output- the writer to which the graph to be exported.g- the graph to be exported.
+ +
+exportLaplacianMatrix
++public void exportLaplacianMatrix(java.io.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. Laplacian matrices
+ are only defined for simple graphs, so edge direction, multiple edges,
+ loops, and weights are all ignored when creating the Laplacian matrix. If
+ you're unsure about Laplacian matrices, see:
+ http://mathworld.wolfram.com/LaplacianMatrix.html.
+
+
-
+
- Parameters:
output- the writer to which the graph is to be exported.g- the graph to be exported.
+ +
+exportNormalizedLaplacianMatrix
++public void exportNormalizedLaplacianMatrix(java.io.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.
+ Laplacian matrices are only defined for simple graphs, so edge direction,
+ multiple edges, loops, and weights are all ignored when creating the
+ Laplacian matrix. If you're unsure about normalized Laplacian matrices,
+ see:
+ http://mathworld.wolfram.com/LaplacianMatrix.html.
+
+
-
+
- Parameters:
output- the writer to which the graph is to be exported.g- the graph to be exported.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/StringEdgeNameProvider.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/StringEdgeNameProvider.html new file mode 100644 index 00000000..be4c45d3 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/StringEdgeNameProvider.html @@ -0,0 +1,269 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class StringEdgeNameProvider<E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- EdgeNameProvider<E> +
+
-
+
public class StringEdgeNameProvider<E>
- extends java.lang.Object
- implements EdgeNameProvider<E>
- extends java.lang.Object
+Generates edge names by invoking Object.toString() on them. This assumes
+ that the edge's Object.toString() method returns a unique String
+ representation for each edge.
+
+ +
+
-
+
- Author: +
- Trevor Harmon +
+ +
| +Constructor Summary | +|
|---|---|
StringEdgeNameProvider()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ java.lang.String |
+getEdgeName(E edge)
+
++ Returns the String representation an edge. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+StringEdgeNameProvider
++public StringEdgeNameProvider()+
-
+
| +Method Detail | +
|---|
+getEdgeName
++public java.lang.String getEdgeName(E edge)+
-
+
- Returns the String representation an edge.
+
+
-
+
- Specified by:
getEdgeNamein interfaceEdgeNameProvider<E>
-
+
- Parameters:
edge- the edge to be named +- Returns:
- the name of the edge
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/StringNameProvider.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/StringNameProvider.html new file mode 100644 index 00000000..15461fe5 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/StringNameProvider.html @@ -0,0 +1,271 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class StringNameProvider<V>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- VertexNameProvider<V> +
+
-
+
public class StringNameProvider<V>
- extends java.lang.Object
- implements VertexNameProvider<V>
- extends java.lang.Object
+Generates vertex names by invoking Object.toString() on them. This assumes
+ that the vertex's Object.toString() method returns a unique String
+ representation for each vertex.
+
+ +
+
-
+
- Author: +
- Charles Fry +
+ +
| +Constructor Summary | +|
|---|---|
StringNameProvider()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ java.lang.String |
+getVertexName(V vertex)
+
++ Returns the String representation of the unique integer representing a + vertex. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+StringNameProvider
++public StringNameProvider()+
-
+
| +Method Detail | +
|---|
+getVertexName
++public java.lang.String getVertexName(V vertex)+
-
+
- Returns the String representation of the unique integer representing a
+ vertex.
+
+
-
+
- Specified by:
getVertexNamein interfaceVertexNameProvider<V>
-
+
- Parameters:
vertex- the vertex to be named +- Returns:
- the name of
- See Also:
GraphListener.edgeAdded(GraphEdgeChangeEvent)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/VertexNameProvider.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/VertexNameProvider.html new file mode 100644 index 00000000..a0d009cd --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/VertexNameProvider.html @@ -0,0 +1,216 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Interface VertexNameProvider<V>
+-
+
- All Known Implementing Classes:
- IntegerNameProvider, StringNameProvider +
+
-
+
public interface VertexNameProvider<V>
+Assigns a display name for each of the graph vertices. +
+ +
+
+ +
| +Method Summary | +|
|---|---|
+ java.lang.String |
+getVertexName(V vertex)
+
++ Returns a unique name for a vertex. |
+
| +Method Detail | +
|---|
+getVertexName
++java.lang.String getVertexName(V vertex)+
-
+
- Returns a unique name for a vertex. This is useful when exporting a a
+ graph, as it ensures that all vertices are assigned simple, consistant
+ names.
+
+
-
+
- Parameters:
vertex- the vertex to be named +- Returns:
- the name of the vertex
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/VisioExporter.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/VisioExporter.html new file mode 100644 index 00000000..e09f9f5d --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/VisioExporter.html @@ -0,0 +1,294 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.ext
+
+Class VisioExporter<V,E>
++java.lang.Object ++
+
-
+
public class VisioExporter<V,E>
- extends java.lang.Object
+Exports a graph to a csv format that can be imported into MS Visio. + +
Tip: By default, the exported graph doesn't show link directions.
+ To show link directions:
+
+
-
+
- Select All (Ctrl-A) +
- Right Click the selected items +
- Format/Line... +
- Line ends: End: (choose an arrow) +
+ +
+
-
+
- Author: +
- Avner Linder +
+ +
| +Constructor Summary | +|
|---|---|
VisioExporter()
+
++ Creates a new VisioExporter object. |
+|
VisioExporter(VertexNameProvider<V> vertexNameProvider)
+
++ Creates a new VisioExporter object with the specified naming policy. |
+|
| +Method Summary | +|
|---|---|
+ void |
+export(java.io.OutputStream output,
+ Graph<V,E> g)
+
++ Exports the specified graph into a Visio csv file format. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+VisioExporter
++public VisioExporter(VertexNameProvider<V> vertexNameProvider)+
-
+
- Creates a new VisioExporter object with the specified naming policy.
+
+
-
+
- Parameters:
vertexNameProvider- the vertex name provider to be used for naming + the Visio shapes.
+ +
+VisioExporter
++public VisioExporter()+
-
+
- Creates a new VisioExporter object.
+
+
| +Method Detail | +
|---|
+export
++public void export(java.io.OutputStream output, + Graph<V,E> g)+
-
+
- Exports the specified graph into a Visio csv file format.
+
+
-
+
- Parameters:
output- the print stream to which the graph to be exported.g- the graph to be exported.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/package-frame.html new file mode 100644 index 00000000..099ceb0c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/package-frame.html @@ -0,0 +1,67 @@ + + + + + +
|
+Interfaces
+
+ +EdgeNameProvider + +JGraphModelAdapter.CellFactory + +VertexNameProvider |
+
|
+Classes
+
+ +DOTExporter + +GmlExporter + +GraphMLExporter + +IntegerEdgeNameProvider + +IntegerNameProvider + +JGraphModelAdapter + +JGraphModelAdapter.DefaultCellFactory + +MatrixExporter + +StringEdgeNameProvider + +StringNameProvider + +VisioExporter |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.ext +
+ +Extensions and integration means to other products. +
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| EdgeNameProvider<E> | +Assigns a display name for each of the graph edes. | +
| 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. | +
+ +
| +Class Summary | +|
|---|---|
| DOTExporter<V,E> | +Exports a graph into 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. | +
| MatrixExporter<V,E> | +Exports a graph to a plain text matrix format, which can be processed by + matrix manipulation software, such as + MTJ or MATLAB. | +
| 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. | +
+Package org.jgrapht.ext Description +
+ ++
+Extensions and integration means to other products. +
++ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/package-tree.html new file mode 100644 index 00000000..2646b657 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/ext/package-tree.html @@ -0,0 +1,166 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.ext +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.ext.DOTExporter<V,E>
- org.jgrapht.ext.GmlExporter<V,E>
- org.jgrapht.ext.GraphMLExporter<V,E>
- org.jgrapht.ext.IntegerEdgeNameProvider<E> (implements org.jgrapht.ext.EdgeNameProvider<E>) +
- org.jgrapht.ext.IntegerNameProvider<V> (implements org.jgrapht.ext.VertexNameProvider<V>) +
- org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory<VV,EE> (implements org.jgrapht.ext.JGraphModelAdapter.CellFactory<VV,EE>, java.io.Serializable) +
- org.jgrapht.ext.MatrixExporter<V,E>
- org.jgrapht.ext.StringEdgeNameProvider<E> (implements org.jgrapht.ext.EdgeNameProvider<E>) +
- org.jgrapht.ext.StringNameProvider<V> (implements org.jgrapht.ext.VertexNameProvider<V>) +
- javax.swing.undo.UndoableEditSupport
-
+
- org.jgraph.graph.DefaultGraphModel (implements org.jgraph.graph.GraphModel, java.io.Serializable)
+
-
+
- org.jgrapht.ext.JGraphModelAdapter<V,E>
- org.jgraph.graph.DefaultGraphModel (implements org.jgraph.graph.GraphModel, java.io.Serializable)
+
- org.jgrapht.ext.VisioExporter<V,E>
+Interface Hierarchy +
+-
+
- org.jgrapht.ext.EdgeNameProvider<E>
- org.jgrapht.ext.JGraphModelAdapter.CellFactory<VV,EE>
- org.jgrapht.ext.VertexNameProvider<V>
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html new file mode 100644 index 00000000..a92f115b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html @@ -0,0 +1,285 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class CompleteBipartiteGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class CompleteBipartiteGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a complete + bipartite graph of any size. This is a graph with two partitions; two + vertices will contain an edge if and only if they belong to different + partitions. +
+ +
+
-
+
- Since: +
- Dec 21, 2008 +
- Author: +
- Andrew Newell +
+ +
| +Constructor Summary | +|
|---|---|
CompleteBipartiteGraphGenerator(int partitionOne,
+ int partitionTwo)
+
++ Creates a new CompleteBipartiteGraphGenerator object. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Construct a complete bipartite graph |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+CompleteBipartiteGraphGenerator
++public CompleteBipartiteGraphGenerator(int partitionOne, + int partitionTwo)+
-
+
- Creates a new CompleteBipartiteGraphGenerator object.
+
+
-
+
- Parameters:
partitionOne- This is the number of vertices in the first partitionpartitionTwo- This is the number of vertices in the second parition
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Construct a complete bipartite graph
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/CompleteGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/CompleteGraphGenerator.html new file mode 100644 index 00000000..e83d3db0 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/CompleteGraphGenerator.html @@ -0,0 +1,296 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class CompleteGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class CompleteGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a complete graph of any size. A complete graph is a graph where + every vertex shares an edge with every other vertex. If it is a directed + graph, then edges must always exist in both directions. On a side note, a + complete graph is the least efficient possible graph in terms of memory and + cpu usage. Note: This contructor was designed for a simple undirected or + directed graph. It will act strangely when used with certain graph types, + such as undirected multigraphs. Note, though, that a complete undirected + multigraph is rather senseless -- you can keep adding edges and the graph is + never truly complete. +
+ +
+
-
+
- Since: +
- Nov 02, 2008 +
- Author: +
- Tim Shearouse +
+ +
| +Constructor Summary | +|
|---|---|
CompleteGraphGenerator(int size)
+
++ Construct a new CompleteGraphGenerator. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generate a graph structure. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+CompleteGraphGenerator
++public CompleteGraphGenerator(int size)+
-
+
- Construct a new CompleteGraphGenerator.
+
+
-
+
- Parameters:
size- number of vertices to be generated +- Throws: +
java.lang.IllegalArgumentException- if the specified size is negative.
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generate a graph structure. The topology of the generated graph is
+ dependent on the implementation. For graphs in which not all vertices
+ share the same automorphism equivalence class, the generator may produce
+ a labeling indicating the roles played by generated elements. This is the
+ purpose of the resultMap parameter. For example, a generator for a wheel
+ graph would designate a hub vertex. Role names used as keys in resultMap
+ should be declared as public static final Strings by implementation
+ classes.
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/EmptyGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/EmptyGraphGenerator.html new file mode 100644 index 00000000..758db2d7 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/EmptyGraphGenerator.html @@ -0,0 +1,289 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class EmptyGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class EmptyGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates an empty + graph of any size. An empty graph is a graph that has no edges. +
+ +
+
-
+
- Since: +
- Sep 16, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Constructor Summary | +|
|---|---|
EmptyGraphGenerator(int size)
+
++ Construct a new EmptyGraphGenerator. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generate a graph structure. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+EmptyGraphGenerator
++public EmptyGraphGenerator(int size)+
-
+
- Construct a new EmptyGraphGenerator.
+
+
-
+
- Parameters:
size- number of vertices to be generated +- Throws: +
java.lang.IllegalArgumentException- if the specified size is negative.
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generate a graph structure. The topology of the generated graph is
+ dependent on the implementation. For graphs in which not all vertices
+ share the same automorphism equivalence class, the generator may produce
+ a labeling indicating the roles played by generated elements. This is the
+ purpose of the resultMap parameter. For example, a generator for a wheel
+ graph would designate a hub vertex. Role names used as keys in resultMap
+ should be declared as public static final Strings by implementation
+ classes.
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/GraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/GraphGenerator.html new file mode 100644 index 00000000..7c5bc0ce --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/GraphGenerator.html @@ -0,0 +1,233 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Interface GraphGenerator<V,E,T>
+-
+
- All Known Implementing Classes:
- CompleteBipartiteGraphGenerator, CompleteGraphGenerator, EmptyGraphGenerator, HyperCubeGraphGenerator, LinearGraphGenerator, RandomGraphGenerator, RingGraphGenerator, ScaleFreeGraphGenerator, StarGraphGenerator, WheelGraphGenerator +
+
-
+
public interface GraphGenerator<V,E,T>
+GraphGenerator defines an interface for generating new graph structures. +
+ +
+
-
+
- Since: +
- Sep 16, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,T> resultMap)
+
++ Generate a graph structure. |
+
| +Method Detail | +
|---|
+generateGraph
++void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,T> resultMap)+
-
+
- Generate a graph structure. The topology of the generated graph is
+ dependent on the implementation. For graphs in which not all vertices
+ share the same automorphism equivalence class, the generator may produce
+ a labeling indicating the roles played by generated elements. This is the
+ purpose of the resultMap parameter. For example, a generator for a wheel
+ graph would designate a hub vertex. Role names used as keys in resultMap
+ should be declared as public static final Strings by implementation
+ classes.
+
+
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/HyperCubeGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/HyperCubeGraphGenerator.html new file mode 100644 index 00000000..a47fc8a9 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/HyperCubeGraphGenerator.html @@ -0,0 +1,283 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class HyperCubeGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class HyperCubeGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a hyper + cube graph of any size. This is a graph that can be represented by bit + strings, so for an n-dimensial hypercube each vertex resembles an n-length + bit string. Then, two vertices are adjacent if and only if their bitstring + differ by exactly one element. +
+ +
+
-
+
- Since: +
- Dec 21, 2008 +
- Author: +
- Andrew Newell +
+ +
| +Constructor Summary | +|
|---|---|
HyperCubeGraphGenerator(int dim)
+
++ Creates a new HyperCubeGraphGenerator object. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ This will generate the hypercube graph |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+HyperCubeGraphGenerator
++public HyperCubeGraphGenerator(int dim)+
-
+
- Creates a new HyperCubeGraphGenerator object.
+
+
-
+
- Parameters:
dim- This is the dimension of the hypercube.
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- This will generate the hypercube graph
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/LinearGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/LinearGraphGenerator.html new file mode 100644 index 00000000..08aa0f7e --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/LinearGraphGenerator.html @@ -0,0 +1,347 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class LinearGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class LinearGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a linear graph of any size. For a directed graph, the edges are + oriented from START_VERTEX to END_VERTEX. +
+ +
+
-
+
- Since: +
- Sep 16, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Field Summary | +|
|---|---|
+static java.lang.String |
+END_VERTEX
+
++ Role for the last vertex generated. |
+
+static java.lang.String |
+START_VERTEX
+
++ Role for the first vertex generated. |
+
| +Constructor Summary | +|
|---|---|
LinearGraphGenerator(int size)
+
++ Construct a new LinearGraphGenerator. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generate a graph structure. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+START_VERTEX
++public static final java.lang.String START_VERTEX+
-
+
- Role for the first vertex generated.
+
+
-
+
- See Also:
- Constant Field Values
+ +
+END_VERTEX
++public static final java.lang.String END_VERTEX+
-
+
- Role for the last vertex generated.
+
+
-
+
- See Also:
- Constant Field Values
| +Constructor Detail | +
|---|
+LinearGraphGenerator
++public LinearGraphGenerator(int size)+
-
+
- Construct a new LinearGraphGenerator.
+
+
-
+
- Parameters:
size- number of vertices to be generated +- Throws: +
java.lang.IllegalArgumentException- if the specified size is negative.
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generate a graph structure. The topology of the generated graph is
+ dependent on the implementation. For graphs in which not all vertices
+ share the same automorphism equivalence class, the generator may produce
+ a labeling indicating the roles played by generated elements. This is the
+ purpose of the resultMap parameter. For example, a generator for a wheel
+ graph would designate a hub vertex. Role names used as keys in resultMap
+ should be declared as public static final Strings by implementation
+ classes.
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.DefaultEdgeTopologyFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.DefaultEdgeTopologyFactory.html new file mode 100644 index 00000000..108090df --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.DefaultEdgeTopologyFactory.html @@ -0,0 +1,399 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- RandomGraphGenerator.EdgeTopologyFactory<VV,EE> +
-
+
- Enclosing class:
- RandomGraphGenerator<V,E> +
+
-
+
public class RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE>
- extends java.lang.Object
- implements RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
- extends java.lang.Object
+Default implementation of the EdgeTopologyFactory interface. randomly + chooses an edge and tries to add it. If the add fails from any reason + (like: self edge / multiple edges in unpermitted graph type) it will just + choose another and try again. Performance: +
+ +
+
-
+
- Since: +
- Aug 6, 2005 +
- Author: +
- Assaf +
+ +
| +Constructor Summary | +|
|---|---|
RandomGraphGenerator.DefaultEdgeTopologyFactory()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ void |
+createEdges(Graph<VV,EE> targetGraph,
+ java.util.Map<java.lang.Integer,VV> orderToVertexMap,
+ int numberOfEdges,
+ java.util.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: |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+RandomGraphGenerator.DefaultEdgeTopologyFactory
++public RandomGraphGenerator.DefaultEdgeTopologyFactory()+
-
+
| +Method Detail | +
|---|
+createEdges
++public void createEdges(Graph<VV,EE> targetGraph, + java.util.Map<java.lang.Integer,VV> orderToVertexMap, + int numberOfEdges, + java.util.Random randomizer)+
-
+
- Description copied from interface:
RandomGraphGenerator.EdgeTopologyFactory
+ - Two different calls to the createEdges() with the same parameters
+ must result in the generation of the same. But if the randomizer is
+ different, it should, usually, create different edge topology.
+
+
-
+
- Specified by:
createEdgesin interfaceRandomGraphGenerator.EdgeTopologyFactory<VV,EE>
-
+
- Parameters:
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 graph
+ +
+isNumberOfEdgesValid
++public boolean isNumberOfEdgesValid(Graph<VV,EE> targetGraph, + int numberOfEdges)+
-
+
- checks if the numOfEdges is smaller than the Max edges according to
+ the following table:
+
+
+
+
++ +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 ++
-
+
- Specified by:
isNumberOfEdgesValidin interfaceRandomGraphGenerator.EdgeTopologyFactory<VV,EE>
-
+
- Parameters:
targetGraph- guranteed to start with zero edges.- See Also:
RandomGraphGenerator.EdgeTopologyFactory.isNumberOfEdgesValid(Graph, + int)
+ +
+getMaxEdgesForVertexNum
++public int getMaxEdgesForVertexNum(Graph<VV,EE> targetGraph)+
-
+
- Return max edges for that graph. If it is infinite return -1 instead.
+
+
-
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.EdgeTopologyFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.EdgeTopologyFactory.html new file mode 100644 index 00000000..dc0ba5a7 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.EdgeTopologyFactory.html @@ -0,0 +1,259 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Interface RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
+-
+
- All Known Implementing Classes:
- RandomGraphGenerator.DefaultEdgeTopologyFactory +
-
+
- Enclosing class:
- RandomGraphGenerator<V,E> +
+
-
+
public static interface RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
+This class is used to generate the edge topology for a graph. +
+ +
+
-
+
- Since: +
- Aug 6, 2005 +
- Author: +
- Assaf +
+ +
| +Method Summary | +|
|---|---|
+ void |
+createEdges(Graph<VV,EE> targetGraph,
+ java.util.Map<java.lang.Integer,VV> orderToVertexMap,
+ int numberOfEdges,
+ java.util.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. |
+
| +Method Detail | +
|---|
+createEdges
++void createEdges(Graph<VV,EE> targetGraph, + java.util.Map<java.lang.Integer,VV> orderToVertexMap, + int numberOfEdges, + java.util.Random randomizer)+
-
+
- Two different calls to the createEdges() with the same parameters
+ must result in the generation of the same. But if the randomizer is
+ different, it should, usually, create different edge topology.
+
+
-
+
- Parameters:
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-
+ +
+isNumberOfEdgesValid
++boolean isNumberOfEdgesValid(Graph<VV,EE> targetGraph, + int numberOfEdges)+
-
+
- Checks if the graph can contain the givven numberOfEdges according to
+ the graph type restrictions. For example: #V means number of
+ vertexes in graph
+
- a Simple Graph, can have max of #V*(#V-1)/2 edges. etc +
+
-
+
- Parameters:
targetGraph- guranteed to start with zero edges.numberOfEdges-
- a Simple Graph, can have max of #V*(#V-1)/2 edges. etc +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.html new file mode 100644 index 00000000..374f2a96 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RandomGraphGenerator.html @@ -0,0 +1,388 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class RandomGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class RandomGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+This Generator creates a random-topology graph of a specified number of + vertexes and edges. An instance of this generator will always return the same + graph-topology in calls to generateGraph(). The vertexes can be different + (depends on the VertexFactory implementation) + +
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). +
+ +
+
-
+
- Since: +
- Aug 6, 2005 +
- Author: +
- Assaf Lehr +
+ +
| +Nested Class Summary | +|
|---|---|
+ 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. |
+
| +Field Summary | +|
|---|---|
+protected int |
+numOfEdges
+
++ |
+
+protected int |
+numOfVertexes
+
++ |
+
+protected java.util.Random |
+randomizer
+
++ |
+
| +Constructor Summary | +|
|---|---|
RandomGraphGenerator(int aNumOfVertexes,
+ int aNumOfEdges)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ (non-Javadoc) |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+numOfVertexes
++protected int numOfVertexes+
-
+
-
+
+ +
+numOfEdges
++protected int numOfEdges+
-
+
-
+
+ +
+randomizer
++protected java.util.Random randomizer+
-
+
-
+
| +Constructor Detail | +
|---|
+RandomGraphGenerator
++public RandomGraphGenerator(int aNumOfVertexes, + int aNumOfEdges)+
-
+
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- (non-Javadoc)
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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) +- Throws: +
java.lang.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)- See Also:
GraphGenerator.generateGraph(Graph, VertexFactory, Map)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RingGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RingGraphGenerator.html new file mode 100644 index 00000000..9cb0f5ac --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/RingGraphGenerator.html @@ -0,0 +1,291 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class RingGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class RingGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a ring graph of any size. A ring graph is a graph that contains a + single cycle that passes through all its vertices exactly once. For a + directed graph, the generated edges are oriented consistently around the + ring. +
+ +
+
-
+
- Since: +
- Sep 16, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Constructor Summary | +|
|---|---|
RingGraphGenerator(int size)
+
++ Construct a new RingGraphGenerator. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generate a graph structure. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+RingGraphGenerator
++public RingGraphGenerator(int size)+
-
+
- Construct a new RingGraphGenerator.
+
+
-
+
- Parameters:
size- number of vertices to be generated +- Throws: +
java.lang.IllegalArgumentException- if the specified size is negative.
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generate a graph structure. The topology of the generated graph is
+ dependent on the implementation. For graphs in which not all vertices
+ share the same automorphism equivalence class, the generator may produce
+ a labeling indicating the roles played by generated elements. This is the
+ purpose of the resultMap parameter. For example, a generator for a wheel
+ graph would designate a hub vertex. Role names used as keys in resultMap
+ should be declared as public static final Strings by implementation
+ classes.
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/ScaleFreeGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/ScaleFreeGraphGenerator.html new file mode 100644 index 00000000..3effa42b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/ScaleFreeGraphGenerator.html @@ -0,0 +1,306 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class ScaleFreeGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class ScaleFreeGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates directed or undirected scale-free network + of any size. Scale-free network is a connected graph, where degrees of + vertices are distributed in unusual way. There are many vertices with small + degrees and only small amount of vertices with big degrees. +
+ +
+
-
+
- Author: +
- Ilya Razenshteyn +
+ +
| +Constructor Summary | +|
|---|---|
ScaleFreeGraphGenerator(int size)
+
++ Constructs a new ScaleFreeGraphGenerator. |
+|
ScaleFreeGraphGenerator(int size,
+ long seed)
+
++ Constructs a new ScaleFreeGraphGenerator using fixed + seed for the random generator. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generates scale-free network with size passed to the + constructor. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+ScaleFreeGraphGenerator
++public ScaleFreeGraphGenerator(int size)+
-
+
- Constructs a new ScaleFreeGraphGenerator.
+
+
-
+
- Parameters:
size- number of vertices to be generated
+ +
+ScaleFreeGraphGenerator
++public ScaleFreeGraphGenerator(int size, + long seed)+
-
+
- Constructs a new ScaleFreeGraphGenerator using fixed
+ seed for the random generator.
+
+
-
+
- Parameters:
size- number of vertices to be generatedseed- initial seed for the random generator
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generates scale-free network with size passed to the
+ constructor. Each call of this method produces identical output (but if
+ target is an undirected graph, the directions of edges will be
+ lost).
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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 parameter
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/StarGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/StarGraphGenerator.html new file mode 100644 index 00000000..ed80f90d --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/StarGraphGenerator.html @@ -0,0 +1,317 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class StarGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class StarGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a star + graph of any size. This is a graph where every vertex has exactly one + edge with a center vertex. +
+ +
+
-
+
- Since: +
- Dec 21, 2008 +
- Author: +
- Andrew Newell +
+ +
| +Field Summary | +|
|---|---|
+static java.lang.String |
+CENTER_VERTEX
+
++ |
+
| +Constructor Summary | +|
|---|---|
StarGraphGenerator(int order)
+
++ Creates a new StarGraphGenerator object. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generates a star graph with the designated order from the constructor |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+CENTER_VERTEX
++public static final java.lang.String CENTER_VERTEX+
-
+
- See Also:
- Constant Field Values
-
+
| +Constructor Detail | +
|---|
+StarGraphGenerator
++public StarGraphGenerator(int order)+
-
+
- Creates a new StarGraphGenerator object.
+
+
-
+
- Parameters:
order- number of total vertices including the center vertex
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generates a star graph with the designated order from the constructor
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/WheelGraphGenerator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/WheelGraphGenerator.html new file mode 100644 index 00000000..fa65dec2 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/WheelGraphGenerator.html @@ -0,0 +1,353 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.generate
+
+Class WheelGraphGenerator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphGenerator<V,E,V> +
+
-
+
public class WheelGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
- extends java.lang.Object
+Generates a wheel + graph of any size. Reminding a bicycle wheel, a wheel graph has a hub + vertex in the center and a rim of vertices around it that are connected to + each other (as a ring). The rim vertices are also connected to the hub with + edges that are called "spokes". +
+ +
+
-
+
- Since: +
- Sep 16, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Field Summary | +|
|---|---|
+static java.lang.String |
+HUB_VERTEX
+
++ Role for the hub vertex. |
+
| +Constructor Summary | +|
|---|---|
WheelGraphGenerator(int size)
+
++ Creates a new WheelGraphGenerator object. |
+|
WheelGraphGenerator(int size,
+ boolean inwardSpokes)
+
++ Construct a new WheelGraphGenerator. |
+|
| +Method Summary | +|
|---|---|
+ void |
+generateGraph(Graph<V,E> target,
+ VertexFactory<V> vertexFactory,
+ java.util.Map<java.lang.String,V> resultMap)
+
++ Generate a graph structure. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+HUB_VERTEX
++public static final java.lang.String HUB_VERTEX+
-
+
- Role for the hub vertex.
+
+
-
+
- See Also:
- Constant Field Values
| +Constructor Detail | +
|---|
+WheelGraphGenerator
++public WheelGraphGenerator(int size)+
-
+
- Creates a new WheelGraphGenerator object. This constructor is more
+ suitable for undirected graphs, where spokes' direction is meaningless.
+ In the directed case, spokes will be oriented from rim to hub.
+
+
-
+
- Parameters:
size- number of vertices to be generated.
+ +
+WheelGraphGenerator
++public WheelGraphGenerator(int size, + boolean inwardSpokes)+
-
+
- Construct a new WheelGraphGenerator.
+
+
-
+
- Parameters:
size- number of vertices to be generated.inwardSpokes- iftrueand graph is directed, spokes + are oriented from rim to hub; else from hub to rim. +- Throws: +
java.lang.IllegalArgumentException
| +Method Detail | +
|---|
+generateGraph
++public void generateGraph(Graph<V,E> target, + VertexFactory<V> vertexFactory, + java.util.Map<java.lang.String,V> resultMap)+
-
+
- Generate a graph structure. The topology of the generated graph is
+ dependent on the implementation. For graphs in which not all vertices
+ share the same automorphism equivalence class, the generator may produce
+ a labeling indicating the roles played by generated elements. This is the
+ purpose of the resultMap parameter. For example, a generator for a wheel
+ graph would designate a hub vertex. Role names used as keys in resultMap
+ should be declared as public static final Strings by implementation
+ classes.
+
+
-
+
- Specified by:
generateGraphin interfaceGraphGenerator<V,E,V>
-
+
- Parameters:
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)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/package-frame.html new file mode 100644 index 00000000..0746d903 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/package-frame.html @@ -0,0 +1,63 @@ + + + + + +
|
+Interfaces
+
+ +GraphGenerator + +RandomGraphGenerator.EdgeTopologyFactory |
+
|
+Classes
+
+ +CompleteBipartiteGraphGenerator + +CompleteGraphGenerator + +EmptyGraphGenerator + +HyperCubeGraphGenerator + +LinearGraphGenerator + +RandomGraphGenerator + +RingGraphGenerator + +ScaleFreeGraphGenerator + +StarGraphGenerator + +WheelGraphGenerator |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.generate +
+Generators for graphs of various topologies. +
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| 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 Summary | +|
|---|---|
| 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. | +
| 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. | +
| StarGraphGenerator<V,E> | +Generates a star + graph of any size. | +
| WheelGraphGenerator<V,E> | +Generates a wheel + graph of any size. | +
+Package org.jgrapht.generate Description +
+ ++Generators for graphs of various topologies. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/package-tree.html new file mode 100644 index 00000000..69ca20c7 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/generate/package-tree.html @@ -0,0 +1,167 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.generate +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.generate.CompleteBipartiteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.CompleteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.EmptyGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.HyperCubeGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.LinearGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.RandomGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE> (implements org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory<VV,EE>) +
- org.jgrapht.generate.RingGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.ScaleFreeGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.StarGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.WheelGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
+Interface Hierarchy +
+-
+
- org.jgrapht.generate.GraphGenerator<V,E,T>
- org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AbstractBaseGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AbstractBaseGraph.html new file mode 100644 index 00000000..86e96b18 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AbstractBaseGraph.html @@ -0,0 +1,1092 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class AbstractBaseGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E> +
-
+
- Direct Known Subclasses:
- DefaultDirectedGraph, DirectedMultigraph, DirectedPseudograph, Multigraph, Pseudograph, SimpleDirectedGraph, SimpleGraph +
+
-
+
public abstract class AbstractBaseGraph<V,E>
- extends AbstractGraph<V,E>
- implements Graph<V,E>, java.lang.Cloneable, java.io.Serializable
- extends AbstractGraph<V,E>
+The most general implementation of the 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).
+ +
+
-
+
- Since: +
- Jul 24, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
AbstractBaseGraph(EdgeFactory<V,E> ef,
+ boolean allowMultipleEdges,
+ boolean allowLoops)
+
++ Construct a new pseudograph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.lang.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. |
+
+ int |
+degreeOf(V vertex)
+
++ |
+
+ java.util.Set<E> |
+edgeSet()
+
++ Returns a set of the edges contained in this graph. |
+
+ java.util.Set<E> |
+edgesOf(V vertex)
+
++ Returns a set of all edges touching the specified vertex. |
+
+ java.util.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. |
+
+ java.util.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)
+
++ |
+
+ java.util.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)
+
++ |
+
+ java.util.Set<V> |
+vertexSet()
+
++ Returns a set of the vertices contained in this graph. |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
containsEdge, removeAllEdges, removeAllEdges, removeAllVertices |
+
| +Constructor Detail | +
|---|
+AbstractBaseGraph
++public AbstractBaseGraph(EdgeFactory<V,E> ef, + boolean allowMultipleEdges, + boolean allowLoops)+
-
+
- Construct a new pseudograph. The pseudograph can either be directed or
+ undirected, depending on the specified edge factory.
+
+
-
+
- Parameters:
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. +- Throws: +
java.lang.NullPointerException- if the specified edge factory is+ null.
| +Method Detail | +
|---|
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Specified by:
getAllEdgesin interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
Graph.getAllEdges(Object, Object)
+ +
+isAllowingLoops
++public boolean isAllowingLoops()+
-
+
- Returns
trueif 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. ++
-
+
-
+
+
- Returns:
trueif and only if graph loops are allowed.
+ +
+isAllowingMultipleEdges
++public boolean isAllowingMultipleEdges()+
-
+
- Returns
trueif 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. ++
-
+
-
+
+
- Returns:
trueif and only if multiple edges are allowed.
+ +
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
- See Also:
Graph.getEdge(Object, Object)
+ +
+getEdgeFactory
++public EdgeFactory<V,E> getEdgeFactory()+
-
+
- Description copied from interface:
Graph
+ - Returns the edge factory using which this graph creates new edges. The
+ edge factory is defined when the graph is constructed and must not be
+ modified.
+
+
-
+
- Specified by:
getEdgeFactoryin interfaceGraph<V,E>
-
+
+
- Returns:
- the edge factory using which this graph creates new edges.
- See Also:
Graph.getEdgeFactory()
+ +
+setEdgeSetFactory
++public void setEdgeSetFactory(EdgeSetFactory<V,E> edgeSetFactory)+
-
+
- Set the
EdgeSetFactoryto use for this graph. Initially, a graph + is created with a default implementation which always supplies anArrayListwith capacity 1. ++
-
+
-
+
- Parameters:
edgeSetFactory- factory to use for subsequently created edge sets + (this call has no effect on existing edge sets)
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
- +
+-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
- See Also:
Graph.addVertex(Object)
+ +
+getEdgeSource
++public V getEdgeSource(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeSourcein interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- source vertex
- See Also:
Graph.getEdgeSource(Object)
+ +
+getEdgeTarget
++public V getEdgeTarget(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeTargetin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- target vertex
- See Also:
Graph.getEdgeTarget(Object)
+ +
+clone
++public java.lang.Object clone()+
-
+
- Returns a shallow copy of this graph instance. Neither edges nor vertices
+ are cloned.
+
+
-
+
- Overrides:
clonein classjava.lang.Object
-
+
+
- Returns:
- a shallow copy of this set. +
- Throws: +
java.lang.RuntimeException- See Also:
Object.clone()
+ +
+containsEdge
++public boolean containsEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified edge. More
+ formally, returns true if and only if this graph contains an
+ edge
e2such thate.equals(e2). If the + specified edge isnullreturnsfalse. ++
-
+
- Specified by:
containsEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified edge.
- See Also:
Graph.containsEdge(Object)
+ +
+containsVertex
++public boolean containsVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified vertex. More
+ formally, returns true if and only if this graph contains a
+ vertex
usuch thatu.equals(v). If the + specified vertex isnullreturnsfalse. ++
-
+
- Specified by:
containsVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified vertex.
- See Also:
Graph.containsVertex(Object)
+ +
+degreeOf
++public int degreeOf(V vertex)+
-
+
-
+
+-
+
- See Also:
UndirectedGraph.degreeOf(Object)
+
+ +
+edgeSet
++public java.util.Set<E> edgeSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the edges contained in this graph. The set is backed by
+ the graph, so changes to the graph are reflected in the set. If the graph
+ is modified while an iteration over the set is in progress, the results
+ of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set of the edges contained in this graph.
- See Also:
Graph.edgeSet()
+ +
+edgesOf
++public java.util.Set<E> edgesOf(V vertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges touching the specified vertex. If no edges are
+ touching the specified vertex returns an empty set.
+
+
- +
+-
+
- Parameters:
vertex- the vertex for which a set of touching edges is to be + returned. +- Returns:
- a set of all edges touching the specified vertex.
- See Also:
Graph.edgesOf(Object)
+ +
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.inDegreeOf(Object)
+
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.incomingEdgesOf(Object)
+
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.outDegreeOf(Object)
+
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.outgoingEdgesOf(Object)
+
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.- See Also:
Graph.removeEdge(Object)
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Specified by:
removeVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.- See Also:
Graph.removeVertex(Object)
+ +
+vertexSet
++public java.util.Set<V> vertexSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the vertices contained in this graph. The set is backed
+ by the graph, so changes to the graph are reflected in the set. If the
+ graph is modified while an iteration over the set is in progress, the
+ results of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set view of the vertices contained in this graph.
- See Also:
Graph.vertexSet()
+ +
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
Graph.getEdgeWeight(Object)
+ +
+setEdgeWeight
++public void setEdgeWeight(E e, + double weight)+
-
+
-
+
+- + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AbstractGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AbstractGraph.html new file mode 100644 index 00000000..961eab38 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AbstractGraph.html @@ -0,0 +1,507 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class AbstractGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- Graph<V,E> +
-
+
- Direct Known Subclasses:
- AbstractBaseGraph, GraphDelegator, GraphUnion, MaskSubgraph, Subgraph +
+
-
+
public abstract class AbstractGraph<V,E>
- extends java.lang.Object
- implements Graph<V,E>
- extends java.lang.Object
+A skeletal implementation of the Graph interface, to minimize the + effort required to implement graph interfaces. This implementation is + applicable to both: directed graphs and undirected graphs. +
+ +
+
-
+
- Author: +
- Barak Naveh +
- See Also:
Graph, +DirectedGraph, +UndirectedGraph
+ +
| +Constructor Summary | +|
|---|---|
AbstractGraph()
+
++ Construct a new empty graph object. |
+|
| +Method Summary | +|
|---|---|
+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 |
+removeAllEdges(java.util.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. |
+
+ java.util.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(java.util.Collection<? extends V> vertices)
+
++ Removes all the vertices in this graph that are also contained in the + specified vertex collection. |
+
+ java.lang.String |
+toString()
+
++ Returns a string of the parenthesized pair (V, E) representing this + G=(V,E) graph. |
+
+protected java.lang.String |
+toStringFromSets(java.util.Collection<? extends V> vertexSet,
+ java.util.Collection<? extends E> edgeSet,
+ boolean directed)
+
++ Helper for subclass implementations of toString( ). |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+AbstractGraph
++public AbstractGraph()+
-
+
- Construct a new empty graph object.
+
+
| +Method Detail | +
|---|
+containsEdge
++public boolean containsEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns true if and only if this graph contains an edge going
+ from the source vertex to the target vertex. In undirected graphs the
+ same result is obtained when source and target are inverted. If any of
+ the specified vertices does not exist in the graph, or if is
+ null, returnsfalse. ++
-
+
- Specified by:
containsEdgein interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- true if this graph contains the specified edge.
- See Also:
Graph.containsEdge(Object, Object)
+ +
+removeAllEdges
++public boolean removeAllEdges(java.util.Collection<? extends E> edges)+
-
+
- Description copied from interface:
Graph
+ - Removes all the edges in this graph that are also contained in the
+ specified edge collection. After this call returns, this graph will
+ contain no edges in common with the specified edges. This method will
+ invoke the
Graph.removeEdge(Object)method. ++
-
+
- Specified by:
removeAllEdgesin interfaceGraph<V,E>
-
+
- Parameters:
edges- edges to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call
- See Also:
Graph.removeAllEdges(Collection)
+ +
+removeAllEdges
++public java.util.Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges. Returns
+
nullif 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 theGraph.removeEdge(Object)method, or + theGraph.removeEdge(Object, Object)method. ++
-
+
- Specified by:
removeAllEdgesin interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- the removed edges, or
nullif no either vertex not + part of graph - See Also:
Graph.removeAllEdges(Object, Object)
+ +
+removeAllVertices
++public boolean removeAllVertices(java.util.Collection<? extends V> vertices)+
-
+
- Description copied from interface:
Graph
+ - Removes all the vertices in this graph that are also contained in the
+ specified vertex collection. After this call returns, this graph will
+ contain no vertices in common with the specified vertices. This method
+ will invoke the
Graph.removeVertex(Object)method. ++
-
+
- Specified by:
removeAllVerticesin interfaceGraph<V,E>
-
+
- Parameters:
vertices- vertices to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call
- See Also:
Graph.removeAllVertices(Collection)
+ +
+toString
++public java.lang.String toString()+
-
+
- Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph. 'V' is the string representation of the vertex set, and
+ 'E' is the string representation of the edge set.
+
+
-
+
- Overrides:
toStringin classjava.lang.Object
-
+
+
- Returns:
- a string representation of this graph.
+ +
+assertVertexExist
++protected boolean assertVertexExist(V v)+
-
+
- Ensures that the specified vertex exists in this graph, or else throws
+ exception.
+
+
-
+
-
+
- Parameters:
v- vertex +- Returns:
trueif this assertion holds. +- Throws: +
java.lang.NullPointerException- if specified vertex isnull. +java.lang.IllegalArgumentException- if specified vertex does not exist in + this graph.
+ +
+removeAllEdges
++protected boolean removeAllEdges(E[] edges)+
-
+
- Removes all the edges in this graph that are also contained in the
+ specified edge array. After this call returns, this graph will contain no
+ edges in common with the specified edges. This method will invoke the
+
Graph.removeEdge(Object)method. ++
-
+
-
+
- Parameters:
edges- edges to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call.
- See Also:
Graph.removeEdge(Object), +Graph.containsEdge(Object)
+ +
+toStringFromSets
++protected java.lang.String toStringFromSets(java.util.Collection<? extends V> vertexSet, + java.util.Collection<? extends E> edgeSet, + boolean directed)+
-
+
- Helper for subclass implementations of toString( ).
+
+
-
+
-
+
- Parameters:
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) +- Returns:
- a string representation of (V,E)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUndirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUndirectedGraph.html new file mode 100644 index 00000000..2c95351a --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUndirectedGraph.html @@ -0,0 +1,604 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class AsUndirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E>, UndirectedGraph<V,E> +
+
-
+
public class AsUndirectedGraph<V,E>
- extends GraphDelegator<V,E>
- implements java.io.Serializable, UndirectedGraph<V,E>
- extends GraphDelegator<V,E>
+An undirected view of the backing directed graph specified in the
+ constructor. This graph allows modules to apply algorithms designed for
+ undirected graphs to a directed graph by simply ignoring edge direction. If
+ the backing directed graph is an oriented graph,
+ then the view will be a simple graph; otherwise, it will be a multigraph.
+ Query operations on this graph "read through" to the backing graph. Attempts
+ to add edges will result in an 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.
++ +
+
-
+
- Since: +
- Aug 14, 2003 +
- Author: +
- John V. Sichi +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
AsUndirectedGraph(DirectedGraph<V,E> g)
+
++ Constructor for AsUndirectedGraph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.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. |
+
+ java.util.Set<E> |
+incomingEdgesOf(V vertex)
+
++ |
+
+ int |
+inDegreeOf(V vertex)
+
++ |
+
+ int |
+outDegreeOf(V vertex)
+
++ |
+
+ java.util.Set<E> |
+outgoingEdgesOf(V vertex)
+
++ |
+
+ java.lang.String |
+toString()
+
++ Returns a string of the parenthesized pair (V, E) representing this + G=(V,E) graph. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+AsUndirectedGraph
++public AsUndirectedGraph(DirectedGraph<V,E> g)+
-
+
- Constructor for AsUndirectedGraph.
+
+
-
+
- Parameters:
g- the backing directed graph over which an undirected view is to + be created.
| +Method Detail | +
|---|
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Specified by:
getAllEdgesin interfaceGraph<V,E>- Overrides:
getAllEdgesin classGraphDelegator<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
Graph.getAllEdges(Object, Object)
+ +
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
- See Also:
Graph.getEdge(Object, Object)
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+degreeOf
++public int degreeOf(V vertex)+
-
+
- Description copied from interface:
UndirectedGraph
+ - Returns the degree of the specified vertex. A degree of a vertex in an
+ undirected graph is the number of edges touching that vertex.
+
+
-
+
- Specified by:
degreeOfin interfaceUndirectedGraph<V,E>- Overrides:
degreeOfin classGraphDelegator<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
- See Also:
UndirectedGraph.degreeOf(Object)
+ +
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
-
+
- Overrides:
inDegreeOfin classGraphDelegator<V,E>
+-
+
- See Also:
DirectedGraph.inDegreeOf(Object)
+
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
-
+
- Overrides:
incomingEdgesOfin classGraphDelegator<V,E>
+-
+
- See Also:
DirectedGraph.incomingEdgesOf(Object)
+
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
-
+
- Overrides:
outDegreeOfin classGraphDelegator<V,E>
+-
+
- See Also:
DirectedGraph.outDegreeOf(Object)
+
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
-
+
- Overrides:
outgoingEdgesOfin classGraphDelegator<V,E>
+-
+
- See Also:
DirectedGraph.outgoingEdgesOf(Object)
+
+ +
+toString
++public java.lang.String toString()+
-
+
- Description copied from class:
AbstractGraph
+ - Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph. 'V' is the string representation of the vertex set, and
+ 'E' is the string representation of the edge set.
+
+
-
+
- Overrides:
toStringin classGraphDelegator<V,E>
-
+
+
- Returns:
- a string representation of this graph.
- See Also:
AbstractGraph.toString()
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUnweightedDirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUnweightedDirectedGraph.html new file mode 100644 index 00000000..572ccdc2 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUnweightedDirectedGraph.html @@ -0,0 +1,328 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class AsUnweightedDirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, DirectedGraph<V,E>, Graph<V,E> +
+
-
+
public class AsUnweightedDirectedGraph<V,E>
- extends GraphDelegator<V,E>
- implements java.io.Serializable, DirectedGraph<V,E>
- extends GraphDelegator<V,E>
+An unweighted view of the backing weighted graph specified in the + constructor. This graph allows modules to apply algorithms designed for + unweighted graphs to a weighted graph by simply ignoring edge weights. 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). + +
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.
++ +
+
-
+
- Since: +
- Sep 7, 2007 +
- Author: +
- Lucas J. Scharenbroich +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
AsUnweightedDirectedGraph(DirectedGraph<V,E> g)
+
++ Constructor for AsUnweightedGraph. |
+|
| +Method Summary | +|
|---|---|
+ double |
+getEdgeWeight(E e)
+
++ Returns the weight assigned to a given edge. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+AsUnweightedDirectedGraph
++public AsUnweightedDirectedGraph(DirectedGraph<V,E> g)+
-
+
- Constructor for AsUnweightedGraph.
+
+
-
+
- Parameters:
g- the backing graph over which an unweighted view is to be + created.
| +Method Detail | +
|---|
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>- Overrides:
getEdgeWeightin classGraphDelegator<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
Graph.getEdgeWeight(E)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUnweightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUnweightedGraph.html new file mode 100644 index 00000000..e5317eb9 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsUnweightedGraph.html @@ -0,0 +1,319 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class AsUnweightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E> +
+
-
+
public class AsUnweightedGraph<V,E>
- extends GraphDelegator<V,E>
- implements java.io.Serializable
- extends GraphDelegator<V,E>
+An unweighted view of the backing weighted graph specified in the + constructor. This graph allows modules to apply algorithms designed for + unweighted graphs to a weighted graph by simply ignoring edge weights. 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). + +
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.
++ +
+
-
+
- Since: +
- Sep 7, 2007 +
- Author: +
- Lucas J. Scharenbroich +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
AsUnweightedGraph(Graph<V,E> g)
+
++ Constructor for AsUnweightedGraph. |
+|
| +Method Summary | +|
|---|---|
+ double |
+getEdgeWeight(E e)
+
++ Returns the weight assigned to a given edge. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
containsEdge, removeAllEdges, removeAllEdges, removeAllVertices |
+
| +Constructor Detail | +
|---|
+AsUnweightedGraph
++public AsUnweightedGraph(Graph<V,E> g)+
-
+
- Constructor for AsUnweightedGraph.
+
+
-
+
- Parameters:
g- the backing graph over which an unweighted view is to be + created.
| +Method Detail | +
|---|
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>- Overrides:
getEdgeWeightin classGraphDelegator<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
Graph.getEdgeWeight(E)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsWeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsWeightedGraph.html new file mode 100644 index 00000000..154e2f7c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/AsWeightedGraph.html @@ -0,0 +1,402 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class AsWeightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E>, WeightedGraph<V,E> +
+
-
+
public class AsWeightedGraph<V,E>
- extends GraphDelegator<V,E>
- implements java.io.Serializable, WeightedGraph<V,E>
- extends GraphDelegator<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.
++ +
+
-
+
- Since: +
- Sep 10, 2007 +
- Author: +
- Lucas J. Scharenbroich +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+protected java.util.Map<E,java.lang.Double> |
+weightMap
+
++ |
+
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
AsWeightedGraph(Graph<V,E> g,
+ java.util.Map<E,java.lang.Double> weightMap)
+
++ Constructor for AsWeightedGraph. |
+|
| +Method Summary | +|
|---|---|
+ double |
+getEdgeWeight(E e)
+
++ Returns the weight assigned to a given edge. |
+
+ void |
+setEdgeWeight(E e,
+ double weight)
+
++ Assigns a weight to an edge. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Field Detail | +
|---|
+weightMap
++protected final java.util.Map<E,java.lang.Double> weightMap+
-
+
-
+
| +Constructor Detail | +
|---|
+AsWeightedGraph
++public AsWeightedGraph(Graph<V,E> g, + java.util.Map<E,java.lang.Double> weightMap)+
-
+
- Constructor for AsWeightedGraph.
+
+
-
+
- Parameters:
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.
| +Method Detail | +
|---|
+setEdgeWeight
++public void setEdgeWeight(E e, + double weight)+
-
+
- Description copied from interface:
WeightedGraph
+ - Assigns a weight to an edge.
+
+
-
+
- Specified by:
setEdgeWeightin interfaceWeightedGraph<V,E>- Overrides:
setEdgeWeightin classGraphDelegator<V,E>
-
+
- Parameters:
e- edge on which to set weightweight- new weight for edge- See Also:
WeightedGraph.setEdgeWeight(E, double)
+ +
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>- Overrides:
getEdgeWeightin classGraphDelegator<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
Graph.getEdgeWeight(E)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ClassBasedEdgeFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ClassBasedEdgeFactory.html new file mode 100644 index 00000000..f5873512 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ClassBasedEdgeFactory.html @@ -0,0 +1,275 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ClassBasedEdgeFactory<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, EdgeFactory<V,E> +
+
-
+
public class ClassBasedEdgeFactory<V,E>
- extends java.lang.Object
- implements EdgeFactory<V,E>, java.io.Serializable
- extends java.lang.Object
+An EdgeFactory for producing edges by using a class as a factory.
+
+ +
+
-
+
- Since: +
- Jul 14, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
ClassBasedEdgeFactory(java.lang.Class<? extends E> edgeClass)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ E |
+createEdge(V source,
+ V target)
+
++ Creates a new edge whose endpoints are the specified source and target + vertices. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+ClassBasedEdgeFactory
++public ClassBasedEdgeFactory(java.lang.Class<? extends E> edgeClass)+
-
+
| +Method Detail | +
|---|
+createEdge
++public E createEdge(V source, + V target)+
-
+
- Description copied from interface:
EdgeFactory
+ - Creates a new edge whose endpoints are the specified source and target
+ vertices.
+
+
-
+
- Specified by:
createEdgein interfaceEdgeFactory<V,E>
-
+
- Parameters:
source- the source vertex.target- the target vertex. +- Returns:
- a new edge whose endpoints are the specified source and target + vertices.
- See Also:
EdgeFactory.createEdge(Object, Object)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ClassBasedVertexFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ClassBasedVertexFactory.html new file mode 100644 index 00000000..1eaff05b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ClassBasedVertexFactory.html @@ -0,0 +1,270 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ClassBasedVertexFactory<V>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- VertexFactory<V> +
+
-
+
public class ClassBasedVertexFactory<V>
- extends java.lang.Object
- implements VertexFactory<V>
- extends java.lang.Object
+A VertexFactory for producing vertices by using a class as a factory.
+
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Constructor Summary | +|
|---|---|
ClassBasedVertexFactory(java.lang.Class<? extends V> vertexClass)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ V |
+createVertex()
+
++ Creates a new vertex. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+ClassBasedVertexFactory
++public ClassBasedVertexFactory(java.lang.Class<? extends V> vertexClass)+
-
+
| +Method Detail | +
|---|
+createVertex
++public V createVertex()+
-
+
- Description copied from interface:
VertexFactory
+ - Creates a new vertex.
+
+
-
+
- Specified by:
createVertexin interfaceVertexFactory<V>
-
+
+
- Returns:
- the new vertex
- See Also:
VertexFactory.createVertex()
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultDirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultDirectedGraph.html new file mode 100644 index 00000000..dc6fdcd9 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultDirectedGraph.html @@ -0,0 +1,299 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DefaultDirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E> +
-
+
- Direct Known Subclasses:
- DefaultDirectedWeightedGraph +
+
-
+
public class DefaultDirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
- implements DirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A directed graph. A default directed graph is a non-simple directed graph in + which multiple edges between any two vertices are not permitted, but + loops are. + +
prefixed 'Default' to avoid name collision with the DirectedGraph + interface.
++ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DefaultDirectedGraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new directed graph. |
+|
DefaultDirectedGraph(EdgeFactory<V,E> ef)
+
++ Creates a new directed graph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+DefaultDirectedGraph
++public DefaultDirectedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new directed graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+DefaultDirectedGraph
++public DefaultDirectedGraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new directed graph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultDirectedWeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultDirectedWeightedGraph.html new file mode 100644 index 00000000..792ba4de --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultDirectedWeightedGraph.html @@ -0,0 +1,322 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DefaultDirectedWeightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E>, WeightedGraph<V,E> +
+
-
+
public class DefaultDirectedWeightedGraph<V,E>
- extends DefaultDirectedGraph<V,E>
- implements WeightedGraph<V,E>
- extends DefaultDirectedGraph<V,E>
+A directed weighted graph. A directed weighted graph is a non-simple directed + graph in which multiple edges between any two vertices are not + permitted, but loops are. The graph has weights on its edges. +
+ +
+
-
+
- See Also:
DefaultDirectedGraph, +Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
DefaultDirectedWeightedGraph(java.lang.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. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| +Constructor Detail | +
|---|
+DefaultDirectedWeightedGraph
++public DefaultDirectedWeightedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new directed weighted graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+DefaultDirectedWeightedGraph
++public DefaultDirectedWeightedGraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new directed weighted graph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultEdge.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultEdge.html new file mode 100644 index 00000000..f58861dc --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultEdge.html @@ -0,0 +1,337 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DefaultEdge
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable +
-
+
- Direct Known Subclasses:
- DefaultWeightedEdge +
+
-
+
public class DefaultEdge
- extends java.lang.Object
+A default implementation for edges in a Graph.
+
+ +
+
-
+
- Since: +
- Jul 14, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DefaultEdge()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ java.lang.Object |
+clone()
+
++ |
+
+protected java.lang.Object |
+getSource()
+
++ Retrieves the source of this edge. |
+
+protected java.lang.Object |
+getTarget()
+
++ Retrieves the target of this edge. |
+
+ java.lang.String |
+toString()
+
++ |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+DefaultEdge
++public DefaultEdge()+
-
+
| +Method Detail | +
|---|
+getSource
++protected java.lang.Object getSource()+
-
+
- Retrieves the source of this edge. This is protected, for use by
+ subclasses only (e.g. for implementing toString).
+
+
-
+
+
- Returns:
- source of this edge
+ +
+getTarget
++protected java.lang.Object getTarget()+
-
+
- Retrieves the target of this edge. This is protected, for use by
+ subclasses only (e.g. for implementing toString).
+
+
-
+
+
- Returns:
- target of this edge
+ +
+toString
++public java.lang.String toString()+
-
+
-
+
- Overrides:
toStringin classjava.lang.Object
+-
+
+
+ +
+clone
++public java.lang.Object clone()+
-
+
-
+
- Overrides:
clonein classjava.lang.Object
+-
+
- See Also:
Object.clone()
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultGraphMapping.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultGraphMapping.html new file mode 100644 index 00000000..39e59275 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultGraphMapping.html @@ -0,0 +1,317 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DefaultGraphMapping<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphMapping<V,E> +
+
-
+
public class DefaultGraphMapping<V,E>
- extends java.lang.Object
- implements GraphMapping<V,E>
- extends java.lang.Object
+Implementation of the GraphMapping interface. The performance of
+ 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.
+
+ +
+
-
+
- Since: +
- Jul 30, 2005 +
- Author: +
- Assaf +
+ +
| +Constructor Summary | +|
|---|---|
DefaultGraphMapping(java.util.Map<V,V> g1ToG2,
+ java.util.Map<V,V> g2ToG1,
+ Graph<V,E> g1,
+ Graph<V,E> g2)
+
++ The maps themselves are used. |
+|
| +Method Summary | +|
|---|---|
+ 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 |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+DefaultGraphMapping
++public DefaultGraphMapping(java.util.Map<V,V> g1ToG2, + java.util.Map<V,V> g2ToG1, + Graph<V,E> g1, + Graph<V,E> g2)+
-
+
- The maps themselves are used. There is no defensive-copy. Assumption: The
+ key and value in the mappings are of valid graph objects. It is not
+ checked.
+
+
-
+
- Parameters:
g1ToG2-g2ToG1-g1-g2-
| +Method Detail | +
|---|
+getEdgeCorrespondence
++public E getEdgeCorrespondence(E currEdge, + boolean forward)+
-
+
- Description copied from interface:
GraphMapping
+ - Gets the mapped value where the key is
edge++
-
+
- Specified by:
getEdgeCorrespondencein interfaceGraphMapping<V,E>
-
+
- Parameters:
currEdge- edge in one of the graphsforward- if true, uses mapping from graph1 to graph2; if false, use + mapping from graph2 to graph1 +- Returns:
- corresponding edge in other graph, or null if none
+ +
+getVertexCorrespondence
++public V getVertexCorrespondence(V keyVertex, + boolean forward)+
-
+
- Description copied from interface:
GraphMapping
+ - Gets the mapped value where the key is
vertex++
-
+
- Specified by:
getVertexCorrespondencein interfaceGraphMapping<V,E>
-
+
- Parameters:
keyVertex- vertex in one of the graphsforward- if true, uses mapping from graph1 to graph2; if false, use + mapping from graph2 to graph1 +- Returns:
- corresponding vertex in other graph, or null if none
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultListenableGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultListenableGraph.html new file mode 100644 index 00000000..fa7b014e --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultListenableGraph.html @@ -0,0 +1,824 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DefaultListenableGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, ListenableGraph<V,E> +
-
+
- Direct Known Subclasses:
- ListenableDirectedGraph, ListenableUndirectedGraph +
+
-
+
public class DefaultListenableGraph<V,E>
- extends GraphDelegator<V,E>
- implements ListenableGraph<V,E>, java.lang.Cloneable
- extends GraphDelegator<V,E>
+A graph backed by the the graph specified at the constructor, which can be
+ listened by 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.
++ +
+
-
+
- Since: +
- Jul 20, 2003 +
- Author: +
- Barak Naveh +
- See Also:
GraphListener, +VertexSetListener, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DefaultListenableGraph(Graph<V,E> g)
+
++ Creates a new listenable graph. |
+|
DefaultListenableGraph(Graph<V,E> g,
+ boolean reuseEvents)
+
++ Creates a new listenable graph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.lang.Object |
+clone()
+
++ |
+
+protected void |
+fireEdgeAdded(E edge)
+
++ Notify listeners that the specified edge was added. |
+
+protected void |
+fireEdgeRemoved(E edge)
+
++ 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. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, vertexSet |
+
| +Constructor Detail | +
|---|
+DefaultListenableGraph
++public DefaultListenableGraph(Graph<V,E> g)+
-
+
- Creates a new listenable graph.
+
+
-
+
- Parameters:
g- the backing graph.
+ +
+DefaultListenableGraph
++public DefaultListenableGraph(Graph<V,E> g, + boolean reuseEvents)+
-
+
- Creates a new listenable graph. If the
reuseEventsflag is + set totruethis 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. ++
-
+
- Parameters:
g- the backing graph.reuseEvents- whether to reuse previously fired event objects + instead of creating a new event object for each event. +- Throws: +
java.lang.IllegalArgumentException- if the backing graph is already a + listenable graph.
| +Method Detail | +
|---|
+setReuseEvents
++public void setReuseEvents(boolean reuseEvents)+
-
+
- If the
reuseEventsflag is set totruethis + 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. ++
-
+
-
+
- Parameters:
reuseEvents- whether to reuse previously fired event objects + instead of creating a new event object for each event.
+ +
+isReuseEvents
++public boolean isReuseEvents()+
-
+
- Tests whether the
reuseEventsflag is set. If the flag is + set totruethis 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. ++
-
+
-
+
+
- Returns:
- the value of the
reuseEventsflag.
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+addGraphListener
++public void addGraphListener(GraphListener<V,E> l)+
-
+
- Description copied from interface:
ListenableGraph
+ - Adds the specified graph listener to this graph, if not already present.
+
+
-
+
- Specified by:
addGraphListenerin interfaceListenableGraph<V,E>
-
+
- Parameters:
l- the listener to be added.- See Also:
ListenableGraph.addGraphListener(GraphListener)
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
- +
+-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
- See Also:
Graph.addVertex(Object)
+ +
+addVertexSetListener
++public void addVertexSetListener(VertexSetListener<V> l)+
-
+
- Description copied from interface:
ListenableGraph
+ - Adds the specified vertex set listener to this graph, if not already
+ present.
+
+
-
+
- Specified by:
addVertexSetListenerin interfaceListenableGraph<V,E>
-
+
- Parameters:
l- the listener to be added.- See Also:
ListenableGraph.addVertexSetListener(VertexSetListener)
+ +
+clone
++public java.lang.Object clone()+
-
+
-
+
- Overrides:
clonein classjava.lang.Object
+-
+
- See Also:
Object.clone()
+
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.- See Also:
Graph.removeEdge(Object)
+ +
+removeGraphListener
++public void removeGraphListener(GraphListener<V,E> l)+
-
+
- Description copied from interface:
ListenableGraph
+ - Removes the specified graph listener from this graph, if present.
+
+
-
+
- Specified by:
removeGraphListenerin interfaceListenableGraph<V,E>
-
+
- Parameters:
l- the listener to be removed.- See Also:
ListenableGraph.removeGraphListener(GraphListener)
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Specified by:
removeVertexin interfaceGraph<V,E>- Overrides:
removeVertexin classGraphDelegator<V,E>
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.- See Also:
Graph.removeVertex(Object)
+ +
+removeVertexSetListener
++public void removeVertexSetListener(VertexSetListener<V> l)+
-
+
- Description copied from interface:
ListenableGraph
+ - Removes the specified vertex set listener from this graph, if present.
+
+
-
+
- Specified by:
removeVertexSetListenerin interfaceListenableGraph<V,E>
-
+
- Parameters:
l- the listener to be removed.- See Also:
ListenableGraph.removeVertexSetListener(VertexSetListener)
+ +
+fireEdgeAdded
++protected void fireEdgeAdded(E edge)+
-
+
- Notify listeners that the specified edge was added.
+
+
-
+
-
+
- Parameters:
edge- the edge that was added.
+ +
+fireEdgeRemoved
++protected void fireEdgeRemoved(E edge)+
-
+
- Notify listeners that the specified edge was removed.
+
+
-
+
-
+
- Parameters:
edge- the edge that was removed.
+ +
+fireVertexAdded
++protected void fireVertexAdded(V vertex)+
-
+
- Notify listeners that the specified vertex was added.
+
+
-
+
-
+
- Parameters:
vertex- the vertex that was added.
+ +
+fireVertexRemoved
++protected void fireVertexRemoved(V vertex)+
-
+
- Notify listeners that the specified vertex was removed.
+
+
-
+
-
+
- Parameters:
vertex- the vertex that was removed.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultWeightedEdge.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultWeightedEdge.html new file mode 100644 index 00000000..dc0e9843 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DefaultWeightedEdge.html @@ -0,0 +1,299 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DefaultWeightedEdge
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable +
+
-
+
public class DefaultWeightedEdge
- extends DefaultEdge
+A default implementation for edges in a 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.
+
+ +
+
-
+
- Author: +
- John V. Sichi +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DefaultWeightedEdge()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ java.lang.Object |
+clone()
+
++ |
+
+protected double |
+getWeight()
+
++ Retrieves the weight of this edge. |
+
| Methods inherited from class org.jgrapht.graph.DefaultEdge | +
|---|
getSource, getTarget, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+DefaultWeightedEdge
++public DefaultWeightedEdge()+
-
+
| +Method Detail | +
|---|
+getWeight
++protected double getWeight()+
-
+
- Retrieves the weight of this edge. This is protected, for use by
+ subclasses only (e.g. for implementing toString).
+
+
-
+
+
- Returns:
- weight of this edge
+ +
+clone
++public java.lang.Object clone()+
-
+
-
+
- Overrides:
clonein classjava.lang.Object
+-
+
- See Also:
Object.clone()
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedGraphUnion.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedGraphUnion.html new file mode 100644 index 00000000..4384fa7b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedGraphUnion.html @@ -0,0 +1,344 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedGraphUnion<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, DirectedGraph<V,E>, Graph<V,E> +
+
-
+
public class DirectedGraphUnion<V,E>
- extends GraphUnion<V,E,DirectedGraph<V,E>>
- implements DirectedGraph<V,E>
- extends GraphUnion<V,E,DirectedGraph<V,E>>
+
-
+
- See Also:
- Serialized Form
+ +
| +Method Summary | +|
|---|---|
+ java.util.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. |
+
+ java.util.Set<E> |
+outgoingEdgesOf(V vertex)
+
++ Returns a set of all edges outgoing from the specified vertex. |
+
| Methods inherited from class org.jgrapht.graph.GraphUnion | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Method Detail | +
|---|
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns the "in degree" of the specified vertex. An in degree of a vertex
+ in a directed graph is the number of inward directed edges from that
+ vertex. See
+ http://mathworld.wolfram.com/Indegree.html.
+
+
-
+
- Specified by:
inDegreeOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns a set of all edges incoming into the specified vertex.
+
+
-
+
- Specified by:
incomingEdgesOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- the vertex for which the list of incoming edges to be + returned. +- Returns:
- a set of all edges incoming into the specified vertex.
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns the "out degree" of the specified vertex. An out degree of a
+ vertex in a directed graph is the number of outward directed edges from
+ that vertex. See
+ http://mathworld.wolfram.com/Outdegree.html.
+
+
-
+
- Specified by:
outDegreeOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns a set of all edges outgoing from the specified vertex.
+
+
-
+
- Specified by:
outgoingEdgesOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- the vertex for which the list of outgoing edges to be + returned. +- Returns:
- a set of all edges outgoing from the specified vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedMaskSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedMaskSubgraph.html new file mode 100644 index 00000000..b7d3b721 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedMaskSubgraph.html @@ -0,0 +1,275 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedMaskSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- DirectedGraph<V,E>, Graph<V,E> +
+
-
+
public class DirectedMaskSubgraph<V,E>
- extends MaskSubgraph<V,E>
- implements DirectedGraph<V,E>
- extends MaskSubgraph<V,E>
+A directed graph that is a MaskSubgraph on another graph.
+
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Constructor Summary | +|
|---|---|
DirectedMaskSubgraph(DirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask)
+
++ |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.MaskSubgraph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+DirectedMaskSubgraph
++public DirectedMaskSubgraph(DirectedGraph<V,E> base, + MaskFunctor<V,E> mask)+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedMultigraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedMultigraph.html new file mode 100644 index 00000000..436778c8 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedMultigraph.html @@ -0,0 +1,295 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedMultigraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E> +
-
+
- Direct Known Subclasses:
- DirectedWeightedMultigraph +
+
-
+
public class DirectedMultigraph<V,E>
- extends AbstractBaseGraph<V,E>
- implements DirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A directed multigraph. A directed multigraph is a non-simple directed graph + in which loops and multiple edges between any two vertices are permitted. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DirectedMultigraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new directed multigraph. |
+|
DirectedMultigraph(EdgeFactory<V,E> ef)
+
++ Creates a new directed multigraph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+DirectedMultigraph
++public DirectedMultigraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new directed multigraph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+DirectedMultigraph
++public DirectedMultigraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new directed multigraph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedPseudograph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedPseudograph.html new file mode 100644 index 00000000..7968561d --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedPseudograph.html @@ -0,0 +1,291 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedPseudograph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E> +
+
-
+
public class DirectedPseudograph<V,E>
- extends AbstractBaseGraph<V,E>
- implements DirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A directed pseudograph. A directed pseudograph is a non-simple directed graph + in which both graph loops and multiple edges are permitted. If you're unsure + about pseudographs, see: + http://mathworld.wolfram.com/Pseudograph.html. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DirectedPseudograph(java.lang.Class<? extends E> edgeClass)
+
++ |
+|
DirectedPseudograph(EdgeFactory<V,E> ef)
+
++ |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+DirectedPseudograph
++public DirectedPseudograph(java.lang.Class<? extends E> edgeClass)+
-
+
- See Also:
AbstractBaseGraph
-
+
+ +
+DirectedPseudograph
++public DirectedPseudograph(EdgeFactory<V,E> ef)+
-
+
- See Also:
AbstractBaseGraph
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedSubgraph.html new file mode 100644 index 00000000..1ad25d98 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedSubgraph.html @@ -0,0 +1,396 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, DirectedGraph<V,E>, Graph<V,E> +
-
+
- Direct Known Subclasses:
- DirectedWeightedSubgraph +
+
-
+
public class DirectedSubgraph<V,E>
- extends Subgraph<V,E,DirectedGraph<V,E>>
- implements DirectedGraph<V,E>
- extends Subgraph<V,E,DirectedGraph<V,E>>
+A directed graph that is a subgraph on other graph. +
+ +
+
-
+
- See Also:
Subgraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
DirectedSubgraph(DirectedGraph<V,E> base,
+ java.util.Set<V> vertexSubset,
+ java.util.Set<E> edgeSubset)
+
++ Creates a new directed subgraph. |
+|
| +Method Summary | +|
|---|---|
+ java.util.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. |
+
+ java.util.Set<E> |
+outgoingEdgesOf(V vertex)
+
++ Returns a set of all edges outgoing from the specified vertex. |
+
| Methods inherited from class org.jgrapht.graph.Subgraph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+DirectedSubgraph
++public DirectedSubgraph(DirectedGraph<V,E> base, + java.util.Set<V> vertexSubset, + java.util.Set<E> edgeSubset)+
-
+
- Creates a new directed subgraph.
+
+
-
+
- Parameters:
base- the base (backing) graph on which the subgraph will be based.vertexSubset- vertices to include in the subgraph. If+ nullthen all vertices are included.edgeSubset- edges to in include in the subgraph. If+ nullthen all the edges whose vertices found in the graph are + included.
| +Method Detail | +
|---|
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns the "in degree" of the specified vertex. An in degree of a vertex
+ in a directed graph is the number of inward directed edges from that
+ vertex. See
+ http://mathworld.wolfram.com/Indegree.html.
+
+
-
+
- Specified by:
inDegreeOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
- See Also:
DirectedGraph.inDegreeOf(Object)
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns a set of all edges incoming into the specified vertex.
+
+
-
+
- Specified by:
incomingEdgesOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- the vertex for which the list of incoming edges to be + returned. +- Returns:
- a set of all edges incoming into the specified vertex.
- See Also:
DirectedGraph.incomingEdgesOf(Object)
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns the "out degree" of the specified vertex. An out degree of a
+ vertex in a directed graph is the number of outward directed edges from
+ that vertex. See
+ http://mathworld.wolfram.com/Outdegree.html.
+
+
-
+
- Specified by:
outDegreeOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
- See Also:
DirectedGraph.outDegreeOf(Object)
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns a set of all edges outgoing from the specified vertex.
+
+
-
+
- Specified by:
outgoingEdgesOfin interfaceDirectedGraph<V,E>
-
+
- Parameters:
vertex- the vertex for which the list of outgoing edges to be + returned. +- Returns:
- a set of all edges outgoing from the specified vertex.
- See Also:
DirectedGraph.outgoingEdgesOf(Object)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedWeightedMultigraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedWeightedMultigraph.html new file mode 100644 index 00000000..6771ab2b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedWeightedMultigraph.html @@ -0,0 +1,323 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedWeightedMultigraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E>, WeightedGraph<V,E> +
+
-
+
public class DirectedWeightedMultigraph<V,E>
- extends DirectedMultigraph<V,E>
- implements WeightedGraph<V,E>
- extends DirectedMultigraph<V,E>
+A directed weighted multigraph. A directed weighted multigraph is a + non-simple directed graph in which loops and multiple edges between any two + vertices are permitted, and edges have weights. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
DirectedWeightedMultigraph(java.lang.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. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| +Constructor Detail | +
|---|
+DirectedWeightedMultigraph
++public DirectedWeightedMultigraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new directed weighted multigraph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+DirectedWeightedMultigraph
++public DirectedWeightedMultigraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new directed weighted multigraph with the specified edge
+ factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedWeightedSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedWeightedSubgraph.html new file mode 100644 index 00000000..16613eae --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/DirectedWeightedSubgraph.html @@ -0,0 +1,309 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class DirectedWeightedSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, DirectedGraph<V,E>, Graph<V,E>, WeightedGraph<V,E> +
+
-
+
public class DirectedWeightedSubgraph<V,E>
- extends DirectedSubgraph<V,E>
- implements WeightedGraph<V,E>
- extends DirectedSubgraph<V,E>
+A directed weighted graph that is a subgraph on other graph. +
+ +
+
-
+
- See Also:
Subgraph, +Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
DirectedWeightedSubgraph(WeightedGraph<V,E> base,
+ java.util.Set<V> vertexSubset,
+ java.util.Set<E> edgeSubset)
+
++ Creates a new weighted directed subgraph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.DirectedSubgraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from class org.jgrapht.graph.Subgraph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+DirectedWeightedSubgraph
++public DirectedWeightedSubgraph(WeightedGraph<V,E> base, + java.util.Set<V> vertexSubset, + java.util.Set<E> edgeSubset)+
-
+
- Creates a new weighted directed subgraph.
+
+
-
+
- Parameters:
base- the base (backing) graph on which the subgraph will be based.vertexSubset- vertices to include in the subgraph. If+ nullthen all vertices are included.edgeSubset- edges to in include in the subgraph. If+ nullthen all the edges whose vertices found in the graph are + included.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/EdgeReversedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/EdgeReversedGraph.html new file mode 100644 index 00000000..690f4449 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/EdgeReversedGraph.html @@ -0,0 +1,677 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class EdgeReversedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, DirectedGraph<V,E>, Graph<V,E> +
+
-
+
public class EdgeReversedGraph<V,E>
- extends GraphDelegator<V,E>
- implements DirectedGraph<V,E>
- extends GraphDelegator<V,E>
+Provides an edge-reversed view g' of a directed graph g. The vertex sets for + the two graphs are the same, but g' contains an edge (v2, v1) iff g contains + an edge (v1, v2). g' is backed by g, so changes to g are reflected in g', and + vice versa. + +
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.
+
+ +
+
-
+
- Author: +
- John V. Sichi +
- See Also:
AsUndirectedGraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
EdgeReversedGraph(DirectedGraph<V,E> g)
+
++ Creates a new EdgeReversedGraph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.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. |
+
+ java.util.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. |
+
+ java.util.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. |
+
+ java.lang.String |
+toString()
+
++ Returns a string of the parenthesized pair (V, E) representing this + G=(V,E) graph. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getEdgeFactory, getEdgeWeight, removeEdge, removeVertex, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getEdgeFactory, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+EdgeReversedGraph
++public EdgeReversedGraph(DirectedGraph<V,E> g)+
-
+
- Creates a new EdgeReversedGraph.
+
+
-
+
- Parameters:
g- the base (backing) graph on which the edge-reversed view will be + based.
| +Method Detail | +
|---|
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
- See Also:
Graph.getEdge(Object, Object)
+ +
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Specified by:
getAllEdgesin interfaceGraph<V,E>- Overrides:
getAllEdgesin classGraphDelegator<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
Graph.getAllEdges(Object, Object)
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns the "in degree" of the specified vertex. An in degree of a vertex
+ in a directed graph is the number of inward directed edges from that
+ vertex. See
+ http://mathworld.wolfram.com/Indegree.html.
+
+
-
+
- Specified by:
inDegreeOfin interfaceDirectedGraph<V,E>- Overrides:
inDegreeOfin classGraphDelegator<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
- See Also:
DirectedGraph.inDegreeOf(Object)
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns the "out degree" of the specified vertex. An out degree of a
+ vertex in a directed graph is the number of outward directed edges from
+ that vertex. See
+ http://mathworld.wolfram.com/Outdegree.html.
+
+
-
+
- Specified by:
outDegreeOfin interfaceDirectedGraph<V,E>- Overrides:
outDegreeOfin classGraphDelegator<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
- See Also:
DirectedGraph.outDegreeOf(Object)
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns a set of all edges incoming into the specified vertex.
+
+
-
+
- Specified by:
incomingEdgesOfin interfaceDirectedGraph<V,E>- Overrides:
incomingEdgesOfin classGraphDelegator<V,E>
-
+
- Parameters:
vertex- the vertex for which the list of incoming edges to be + returned. +- Returns:
- a set of all edges incoming into the specified vertex.
- See Also:
DirectedGraph.incomingEdgesOf(Object)
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
- Description copied from interface:
DirectedGraph
+ - Returns a set of all edges outgoing from the specified vertex.
+
+
-
+
- Specified by:
outgoingEdgesOfin interfaceDirectedGraph<V,E>- Overrides:
outgoingEdgesOfin classGraphDelegator<V,E>
-
+
- Parameters:
vertex- the vertex for which the list of outgoing edges to be + returned. +- Returns:
- a set of all edges outgoing from the specified vertex.
- See Also:
DirectedGraph.outgoingEdgesOf(Object)
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+getEdgeSource
++public V getEdgeSource(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeSourcein interfaceGraph<V,E>- Overrides:
getEdgeSourcein classGraphDelegator<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- source vertex
- See Also:
Graph.getEdgeSource(Object)
+ +
+getEdgeTarget
++public V getEdgeTarget(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeTargetin interfaceGraph<V,E>- Overrides:
getEdgeTargetin classGraphDelegator<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- target vertex
- See Also:
Graph.getEdgeTarget(Object)
+ +
+toString
++public java.lang.String toString()+
-
+
- Description copied from class:
AbstractGraph
+ - Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph. 'V' is the string representation of the vertex set, and
+ 'E' is the string representation of the edge set.
+
+
-
+
- Overrides:
toStringin classGraphDelegator<V,E>
-
+
+
- Returns:
- a string representation of this graph.
- See Also:
Object.toString()
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/EdgeSetFactory.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/EdgeSetFactory.html new file mode 100644 index 00000000..ca6dccc1 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/EdgeSetFactory.html @@ -0,0 +1,222 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Interface EdgeSetFactory<V,E>
++
-
+
public interface EdgeSetFactory<V,E>
+A factory for edge sets. This interface allows the creator of a graph to
+ choose the Set implementation used internally by the graph
+ to maintain sets of edges. This provides control over performance tradeoffs
+ between memory and CPU usage.
+
+ +
+
-
+
- Author: +
- John V. Sichi +
+ +
| +Method Summary | +|
|---|---|
+ java.util.Set<E> |
+createEdgeSet(V vertex)
+
++ Create a new edge set for a particular vertex. |
+
| +Method Detail | +
|---|
+createEdgeSet
++java.util.Set<E> createEdgeSet(V vertex)+
-
+
- Create a new edge set for a particular vertex.
+
+
-
+
- Parameters:
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) +- Returns:
- new set
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphDelegator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphDelegator.html new file mode 100644 index 00000000..73f7f861 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphDelegator.html @@ -0,0 +1,1008 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class GraphDelegator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E> +
-
+
- Direct Known Subclasses:
- AsUndirectedGraph, AsUnweightedDirectedGraph, AsUnweightedGraph, AsWeightedGraph, DefaultListenableGraph, EdgeReversedGraph, ParanoidGraph, UnmodifiableGraph +
+
-
+
public class GraphDelegator<V,E>
- extends AbstractGraph<V,E>
- implements Graph<V,E>, java.io.Serializable
- extends AbstractGraph<V,E>
+A graph backed by the the graph specified at the constructor, which delegates + all its methods to the backing graph. 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.
+ +This class is mostly used as a base for extending subclasses.
++ +
+
-
+
- Since: +
- Jul 20, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
GraphDelegator(Graph<V,E> g)
+
++ Constructor for GraphDelegator. |
+|
| +Method Summary | +|
|---|---|
+ 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)
+
++ |
+
+ java.util.Set<E> |
+edgeSet()
+
++ Returns a set of the edges contained in this graph. |
+
+ java.util.Set<E> |
+edgesOf(V vertex)
+
++ Returns a set of all edges touching the specified vertex. |
+
+ java.util.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. |
+
+ java.util.Set<E> |
+incomingEdgesOf(V vertex)
+
++ |
+
+ int |
+inDegreeOf(V vertex)
+
++ |
+
+ int |
+outDegreeOf(V vertex)
+
++ |
+
+ java.util.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)
+
++ |
+
+ java.lang.String |
+toString()
+
++ Returns a string of the parenthesized pair (V, E) representing this + G=(V,E) graph. |
+
+ java.util.Set<V> |
+vertexSet()
+
++ Returns a set of the vertices contained in this graph. |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
containsEdge, removeAllEdges, removeAllEdges, removeAllVertices |
+
| +Constructor Detail | +
|---|
+GraphDelegator
++public GraphDelegator(Graph<V,E> g)+
-
+
- Constructor for GraphDelegator.
+
+
-
+
- Parameters:
g- the backing graph (the delegate). +- Throws: +
java.lang.IllegalArgumentException- iffg==null
| +Method Detail | +
|---|
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Specified by:
getAllEdgesin interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
Graph.getAllEdges(Object, Object)
+ +
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
- See Also:
Graph.getEdge(Object, Object)
+ +
+getEdgeFactory
++public EdgeFactory<V,E> getEdgeFactory()+
-
+
- Description copied from interface:
Graph
+ - Returns the edge factory using which this graph creates new edges. The
+ edge factory is defined when the graph is constructed and must not be
+ modified.
+
+
-
+
- Specified by:
getEdgeFactoryin interfaceGraph<V,E>
-
+
+
- Returns:
- the edge factory using which this graph creates new edges.
- See Also:
Graph.getEdgeFactory()
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
- +
+-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
- See Also:
Graph.addVertex(Object)
+ +
+containsEdge
++public boolean containsEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified edge. More
+ formally, returns true if and only if this graph contains an
+ edge
e2such thate.equals(e2). If the + specified edge isnullreturnsfalse. ++
-
+
- Specified by:
containsEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified edge.
- See Also:
Graph.containsEdge(Object)
+ +
+containsVertex
++public boolean containsVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified vertex. More
+ formally, returns true if and only if this graph contains a
+ vertex
usuch thatu.equals(v). If the + specified vertex isnullreturnsfalse. ++
-
+
- Specified by:
containsVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified vertex.
- See Also:
Graph.containsVertex(Object)
+ +
+degreeOf
++public int degreeOf(V vertex)+
-
+
-
+
+-
+
- See Also:
UndirectedGraph.degreeOf(Object)
+
+ +
+edgeSet
++public java.util.Set<E> edgeSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the edges contained in this graph. The set is backed by
+ the graph, so changes to the graph are reflected in the set. If the graph
+ is modified while an iteration over the set is in progress, the results
+ of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set of the edges contained in this graph.
- See Also:
Graph.edgeSet()
+ +
+edgesOf
++public java.util.Set<E> edgesOf(V vertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges touching the specified vertex. If no edges are
+ touching the specified vertex returns an empty set.
+
+
- +
+-
+
- Parameters:
vertex- the vertex for which a set of touching edges is to be + returned. +- Returns:
- a set of all edges touching the specified vertex.
- See Also:
Graph.edgesOf(Object)
+ +
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.inDegreeOf(Object)
+
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.incomingEdgesOf(Object)
+
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.outDegreeOf(Object)
+
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
-
+
+-
+
- See Also:
DirectedGraph.outgoingEdgesOf(Object)
+
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.- See Also:
Graph.removeEdge(Object)
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Specified by:
removeVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.- See Also:
Graph.removeVertex(Object)
+ +
+toString
++public java.lang.String toString()+
-
+
- Description copied from class:
AbstractGraph
+ - Returns a string of the parenthesized pair (V, E) representing this
+ G=(V,E) graph. 'V' is the string representation of the vertex set, and
+ 'E' is the string representation of the edge set.
+
+
-
+
- Overrides:
toStringin classAbstractGraph<V,E>
-
+
+
- Returns:
- a string representation of this graph.
- See Also:
Object.toString()
+ +
+vertexSet
++public java.util.Set<V> vertexSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the vertices contained in this graph. The set is backed
+ by the graph, so changes to the graph are reflected in the set. If the
+ graph is modified while an iteration over the set is in progress, the
+ results of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set view of the vertices contained in this graph.
- See Also:
Graph.vertexSet()
+ +
+getEdgeSource
++public V getEdgeSource(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeSourcein interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- source vertex
- See Also:
Graph.getEdgeSource(Object)
+ +
+getEdgeTarget
++public V getEdgeTarget(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeTargetin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- target vertex
- See Also:
Graph.getEdgeTarget(Object)
+ +
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
Graph.getEdgeWeight(Object)
+ +
+setEdgeWeight
++public void setEdgeWeight(E e, + double weight)+
-
+
-
+
+- + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphPathImpl.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphPathImpl.html new file mode 100644 index 00000000..d493d2df --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphPathImpl.html @@ -0,0 +1,414 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class GraphPathImpl<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- GraphPath<V,E> +
+
-
+
public class GraphPathImpl<V,E>
- extends java.lang.Object
- implements GraphPath<V,E>
- extends java.lang.Object
+GraphPathImpl is a default implementation of GraphPath.
+
+ +
+
-
+
- Version: +
- $Id: GraphPathImpl.java 689 2009-07-04 06:40:29Z perfecthash $ +
- Author: +
- John Sichi +
+ +
| +Constructor Summary | +|
|---|---|
GraphPathImpl(Graph<V,E> graph,
+ V startVertex,
+ V endVertex,
+ java.util.List<E> edgeList,
+ double weight)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ java.util.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. |
+
+ java.lang.String |
+toString()
+
++ |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+GraphPathImpl
++public GraphPathImpl(Graph<V,E> graph, + V startVertex, + V endVertex, + java.util.List<E> edgeList, + double weight)+
-
+
| +Method Detail | +
|---|
+getGraph
++public Graph<V,E> getGraph()+
-
+
- Description copied from interface:
GraphPath
+ - Returns the graph over which this path is defined. The path may also be
+ valid with respect to other graphs.
+
+
- +
+-
+
+
- Returns:
- the containing graph
+ +
+getStartVertex
++public V getStartVertex()+
-
+
- Description copied from interface:
GraphPath
+ - Returns the start vertex in the path.
+
+
-
+
- Specified by:
getStartVertexin interfaceGraphPath<V,E>
-
+
+
- Returns:
- the start vertex
+ +
+getEndVertex
++public V getEndVertex()+
-
+
- Description copied from interface:
GraphPath
+ - Returns the end vertex in the path.
+
+
-
+
- Specified by:
getEndVertexin interfaceGraphPath<V,E>
-
+
+
- Returns:
- the end vertex
+ +
+getEdgeList
++public java.util.List<E> getEdgeList()+
-
+
- Description copied from interface:
GraphPath
+ - Returns the edges making up the path. The first edge in this path is
+ incident to the start vertex. The last edge is incident to the end
+ vertex. The vertices along the path can be obtained by traversing from
+ the start vertex, finding its opposite across the first edge, and then
+ doing the same successively across subsequent edges;
Graphs.getPathVertexList(org.jgrapht.GraphPathprovides a convenience method for this. + +Whether or not the returned edge list is modifiable depends on the + path implementation. +
+
-
+
- Specified by:
getEdgeListin interfaceGraphPath<V,E>
-
+
+
- Returns:
- list of edges traversed by the path
+ +
+getWeight
++public double getWeight()+
-
+
- Description copied from interface:
GraphPath
+ - Returns the weight assigned to the path. Typically, this will be the sum
+ of the weights of the edge list entries (as defined by the containing
+ graph), but some path implementations may use other definitions.
+
+
- +
+-
+
+
- Returns:
- the weight of the path
+ +
+toString
++public java.lang.String toString()+
-
+
-
+
- Overrides:
toStringin classjava.lang.Object
+-
+
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphUnion.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphUnion.html new file mode 100644 index 00000000..3f774eb6 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/GraphUnion.html @@ -0,0 +1,839 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class GraphUnion<V,E,G extends Graph<V,E>>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E> +
-
+
- Direct Known Subclasses:
- DirectedGraphUnion, UndirectedGraphUnion +
+
-
+
public class GraphUnion<V,E,G extends Graph<V,E>>
- extends AbstractGraph<V,E>
- implements java.io.Serializable
- extends AbstractGraph<V,E>
+
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.
++ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
GraphUnion(G g1,
+ G g2)
+
++ |
+|
GraphUnion(G g1,
+ G g2,
+ WeightCombiner operator)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.Set<E> |
+edgeSet()
+
++ Returns a set of the edges contained in this graph. |
+
+ java.util.Set<E> |
+edgesOf(V vertex)
+
++ Returns a set of all edges touching the specified vertex. |
+
+ java.util.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. |
+
+ java.util.Set<V> |
+vertexSet()
+
++ Returns a set of the vertices contained in this graph. |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+GraphUnion
++public GraphUnion(G g1, + G g2, + WeightCombiner operator)+
-
+
+ +
+GraphUnion
++public GraphUnion(G g1, + G g2)+
-
+
| +Method Detail | +
|---|
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Specified by:
getAllEdgesin interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
+ +
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
+ +
+getEdgeFactory
++public EdgeFactory<V,E> getEdgeFactory()+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
-
+
- Specified by:
getEdgeFactoryin interfaceGraph<V,E>
-
+
+
- Returns:
- the edge factory using which this graph creates new edges.
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.getEdgeFactory()
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object), +Graph.getEdgeFactory()
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
- +
+-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
+ +
+containsEdge
++public boolean containsEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified edge. More
+ formally, returns true if and only if this graph contains an
+ edge
e2such thate.equals(e2). If the + specified edge isnullreturnsfalse. ++
-
+
- Specified by:
containsEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified edge.
+ +
+containsVertex
++public boolean containsVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified vertex. More
+ formally, returns true if and only if this graph contains a
+ vertex
usuch thatu.equals(v). If the + specified vertex isnullreturnsfalse. ++
-
+
- Specified by:
containsVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified vertex.
+ +
+edgeSet
++public java.util.Set<E> edgeSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the edges contained in this graph. The set is backed by
+ the graph, so changes to the graph are reflected in the set. If the graph
+ is modified while an iteration over the set is in progress, the results
+ of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set of the edges contained in this graph.
+ +
+edgesOf
++public java.util.Set<E> edgesOf(V vertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges touching the specified vertex. If no edges are
+ touching the specified vertex returns an empty set.
+
+
- +
+-
+
- Parameters:
vertex- the vertex for which a set of touching edges is to be + returned. +- Returns:
- a set of all edges touching the specified vertex.
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed.
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Throws UnsupportedOperationException, because
+ GraphUnion is read-only.
+
+
-
+
- Specified by:
removeVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.
+ +
+vertexSet
++public java.util.Set<V> vertexSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the vertices contained in this graph. The set is backed
+ by the graph, so changes to the graph are reflected in the set. If the
+ graph is modified while an iteration over the set is in progress, the
+ results of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set view of the vertices contained in this graph.
+ +
+getEdgeSource
++public V getEdgeSource(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeSourcein interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- source vertex
+ +
+getEdgeTarget
++public V getEdgeTarget(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeTargetin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- target vertex
+ +
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
WeightedGraph
+ +
+getG1
++public G getG1()+
-
+
-
+
+-
+
+
- Returns:
- G1
+
+ +
+getG2
++public G getG2()+
-
+
-
+
+-
+
+
- Returns:
- G2
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableDirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableDirectedGraph.html new file mode 100644 index 00000000..24d4fc5e --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableDirectedGraph.html @@ -0,0 +1,305 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ListenableDirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E>, ListenableGraph<V,E> +
-
+
- Direct Known Subclasses:
- ListenableDirectedWeightedGraph +
+
-
+
public class ListenableDirectedGraph<V,E>
- extends DefaultListenableGraph<V,E>
- implements DirectedGraph<V,E>
- extends DefaultListenableGraph<V,E>
+A directed graph which is also ListenableGraph.
+
+ +
+
-
+
- See Also:
DefaultListenableGraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
ListenableDirectedGraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new listenable directed graph. |
+|
ListenableDirectedGraph(DirectedGraph<V,E> base)
+
++ Creates a new listenable directed graph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.DefaultListenableGraph | +
|---|
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEvents |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+ListenableDirectedGraph
++public ListenableDirectedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new listenable directed graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+ListenableDirectedGraph
++public ListenableDirectedGraph(DirectedGraph<V,E> base)+
-
+
- Creates a new listenable directed graph.
+
+
-
+
- Parameters:
base- the backing graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableDirectedWeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableDirectedWeightedGraph.html new file mode 100644 index 00000000..489a8452 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableDirectedWeightedGraph.html @@ -0,0 +1,330 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ListenableDirectedWeightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E>, ListenableGraph<V,E>, WeightedGraph<V,E> +
+
-
+
public class ListenableDirectedWeightedGraph<V,E>
- extends ListenableDirectedGraph<V,E>
- implements WeightedGraph<V,E>
- extends ListenableDirectedGraph<V,E>
+A directed weighted graph which is also ListenableGraph.
+
+ +
+
-
+
- See Also:
DefaultListenableGraph, +Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
ListenableDirectedWeightedGraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new listenable directed weighted graph. |
+|
ListenableDirectedWeightedGraph(WeightedGraph<V,E> base)
+
++ Creates a new listenable directed weighted graph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.DefaultListenableGraph | +
|---|
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEvents |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| +Constructor Detail | +
|---|
+ListenableDirectedWeightedGraph
++public ListenableDirectedWeightedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new listenable directed weighted graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+ListenableDirectedWeightedGraph
++public ListenableDirectedWeightedGraph(WeightedGraph<V,E> base)+
-
+
- Creates a new listenable directed weighted graph.
+
+
-
+
- Parameters:
base- the backing graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableUndirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableUndirectedGraph.html new file mode 100644 index 00000000..9973efc3 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableUndirectedGraph.html @@ -0,0 +1,305 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ListenableUndirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, ListenableGraph<V,E>, UndirectedGraph<V,E> +
-
+
- Direct Known Subclasses:
- ListenableUndirectedWeightedGraph +
+
-
+
public class ListenableUndirectedGraph<V,E>
- extends DefaultListenableGraph<V,E>
- implements UndirectedGraph<V,E>
- extends DefaultListenableGraph<V,E>
+An undirected graph which is also ListenableGraph.
+
+ +
+
-
+
- See Also:
DefaultListenableGraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
ListenableUndirectedGraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new listenable undirected simple graph. |
+|
ListenableUndirectedGraph(UndirectedGraph<V,E> base)
+
++ Creates a new listenable undirected graph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.DefaultListenableGraph | +
|---|
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEvents |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+ListenableUndirectedGraph
++public ListenableUndirectedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new listenable undirected simple graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+ListenableUndirectedGraph
++public ListenableUndirectedGraph(UndirectedGraph<V,E> base)+
-
+
- Creates a new listenable undirected graph.
+
+
-
+
- Parameters:
base- the backing graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableUndirectedWeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableUndirectedWeightedGraph.html new file mode 100644 index 00000000..b9300ad7 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ListenableUndirectedWeightedGraph.html @@ -0,0 +1,330 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ListenableUndirectedWeightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, ListenableGraph<V,E>, UndirectedGraph<V,E>, WeightedGraph<V,E> +
+
-
+
public class ListenableUndirectedWeightedGraph<V,E>
- extends ListenableUndirectedGraph<V,E>
- implements WeightedGraph<V,E>
- extends ListenableUndirectedGraph<V,E>
+An undirected weighted graph which is also ListenableGraph.
+
+ +
+
-
+
- See Also:
DefaultListenableGraph, +Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
ListenableUndirectedWeightedGraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new listenable undirected weighted graph. |
+|
ListenableUndirectedWeightedGraph(WeightedGraph<V,E> base)
+
++ Creates a new listenable undirected weighted graph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.DefaultListenableGraph | +
|---|
addEdge, addEdge, addGraphListener, addVertex, addVertexSetListener, clone, fireEdgeAdded, fireEdgeRemoved, fireVertexAdded, fireVertexRemoved, isReuseEvents, removeEdge, removeEdge, removeGraphListener, removeVertex, removeVertexSetListener, setReuseEvents |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| +Constructor Detail | +
|---|
+ListenableUndirectedWeightedGraph
++public ListenableUndirectedWeightedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new listenable undirected weighted graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+ListenableUndirectedWeightedGraph
++public ListenableUndirectedWeightedGraph(WeightedGraph<V,E> base)+
-
+
- Creates a new listenable undirected weighted graph.
+
+
-
+
- Parameters:
base- the backing graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/MaskFunctor.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/MaskFunctor.html new file mode 100644 index 00000000..decd44e1 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/MaskFunctor.html @@ -0,0 +1,243 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Interface MaskFunctor<V,E>
++
-
+
public interface MaskFunctor<V,E>
+A functor interface for masking out vertices and edges of a graph. +
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| +Method Detail | +
|---|
+isEdgeMasked
++boolean isEdgeMasked(E edge)+
-
+
- Returns
trueif the edge is masked,false+ otherwise. ++
-
+
- Parameters:
edge- edge. +- Returns:
- .
+ +
+isVertexMasked
++boolean isVertexMasked(V vertex)+
-
+
- Returns
trueif the vertex is masked,false+ otherwise. ++
-
+
- Parameters:
vertex- vertex. +- Returns:
- .
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/MaskSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/MaskSubgraph.html new file mode 100644 index 00000000..d562fd3b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/MaskSubgraph.html @@ -0,0 +1,973 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class MaskSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- Graph<V,E> +
-
+
- Direct Known Subclasses:
- DirectedMaskSubgraph, UndirectedMaskSubgraph +
+
-
+
public class MaskSubgraph<V,E>
- extends AbstractGraph<V,E>
+An unmodifiable subgraph induced by a vertex/edge masking function. The + subgraph will keep track of edges being added to its vertex subset as well as + deletion of edges and vertices. When iterating over the vertices/edges, it + will iterate over the vertices/edges of the base graph and discard + vertices/edges that are masked (an edge with a masked extremity vertex is + discarded as well). +
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Constructor Summary | +|
|---|---|
MaskSubgraph(Graph<V,E> base,
+ MaskFunctor<V,E> mask)
+
++ Creates a new induced subgraph. |
+|
| +Method Summary | +|
|---|---|
+ 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)
+
++ |
+
+ java.util.Set<E> |
+edgeSet()
+
++ Returns a set of the edges contained in this graph. |
+
+ java.util.Set<E> |
+edgesOf(V vertex)
+
++ Returns a set of all edges touching the specified vertex. |
+
+ java.util.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. |
+
+ java.util.Set<E> |
+incomingEdgesOf(V vertex)
+
++ |
+
+ int |
+inDegreeOf(V vertex)
+
++ |
+
+ int |
+outDegreeOf(V vertex)
+
++ |
+
+ java.util.Set<E> |
+outgoingEdgesOf(V vertex)
+
++ |
+
+ boolean |
+removeAllEdges(java.util.Collection<? extends E> edges)
+
++ Removes all the edges in this graph that are also contained in the + specified edge collection. |
+
+ java.util.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(java.util.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. |
+
+ java.util.Set<V> |
+vertexSet()
+
++ Returns a set of the vertices contained in this graph. |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+MaskSubgraph
++public MaskSubgraph(Graph<V,E> base, + MaskFunctor<V,E> mask)+
-
+
- Creates a new induced subgraph. Running-time = O(1).
+
+
-
+
- Parameters:
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.
| +Method Detail | +
|---|
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E edge)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.edge- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object), +Graph.getEdgeFactory()
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
- See Also:
Graph.addVertex(Object)
+ +
+containsEdge
++public boolean containsEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified edge. More
+ formally, returns true if and only if this graph contains an
+ edge
e2such thate.equals(e2). If the + specified edge isnullreturnsfalse. ++
-
+
- Parameters:
e- edge whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified edge.
+ +
+containsVertex
++public boolean containsVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified vertex. More
+ formally, returns true if and only if this graph contains a
+ vertex
usuch thatu.equals(v). If the + specified vertex isnullreturnsfalse. ++
-
+
- Parameters:
v- vertex whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified vertex.
+ +
+degreeOf
++public int degreeOf(V vertex)+
-
+
-
+
- See Also:
UndirectedGraph.degreeOf(Object)
+
+ +
+edgeSet
++public java.util.Set<E> edgeSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the edges contained in this graph. The set is backed by
+ the graph, so changes to the graph are reflected in the set. If the graph
+ is modified while an iteration over the set is in progress, the results
+ of the iteration are undefined.
+
+
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.+
-
+
+
- Returns:
- a set of the edges contained in this graph.
+ +
+edgesOf
++public java.util.Set<E> edgesOf(V vertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges touching the specified vertex. If no edges are
+ touching the specified vertex returns an empty set.
+
+
-
+
- Parameters:
vertex- the vertex for which a set of touching edges is to be + returned. +- Returns:
- a set of all edges touching the specified vertex.
+ +
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
+ +
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
+ +
+getEdgeFactory
++public EdgeFactory<V,E> getEdgeFactory()+
-
+
- Description copied from interface:
Graph
+ - Returns the edge factory using which this graph creates new edges. The
+ edge factory is defined when the graph is constructed and must not be
+ modified.
+
+
-
+
+
- Returns:
- the edge factory using which this graph creates new edges.
+ +
+getEdgeSource
++public V getEdgeSource(E edge)+
-
+
- Description copied from interface:
Graph
+ - Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Parameters:
edge- edge of interest +- Returns:
- source vertex
+ +
+getEdgeTarget
++public V getEdgeTarget(E edge)+
-
+
- Description copied from interface:
Graph
+ - Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Parameters:
edge- edge of interest +- Returns:
- target vertex
+ +
+getEdgeWeight
++public double getEdgeWeight(E edge)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Parameters:
edge- edge of interest +- Returns:
- edge weight
- See Also:
WeightedGraph
+ +
+incomingEdgesOf
++public java.util.Set<E> incomingEdgesOf(V vertex)+
-
+
-
+
- See Also:
DirectedGraph.incomingEdgesOf(Object)
+
+ +
+inDegreeOf
++public int inDegreeOf(V vertex)+
-
+
-
+
- See Also:
DirectedGraph.inDegreeOf(Object)
+
+ +
+outDegreeOf
++public int outDegreeOf(V vertex)+
-
+
-
+
- See Also:
DirectedGraph.outDegreeOf(Object)
+
+ +
+outgoingEdgesOf
++public java.util.Set<E> outgoingEdgesOf(V vertex)+
-
+
-
+
- See Also:
DirectedGraph.outgoingEdgesOf(Object)
+
+ +
+removeAllEdges
++public boolean removeAllEdges(java.util.Collection<? extends E> edges)+
-
+
- Description copied from interface:
Graph
+ - Removes all the edges in this graph that are also contained in the
+ specified edge collection. After this call returns, this graph will
+ contain no edges in common with the specified edges. This method will
+ invoke the
Graph.removeEdge(Object)method. ++
-
+
- Specified by:
removeAllEdgesin interfaceGraph<V,E>- Overrides:
removeAllEdgesin classAbstractGraph<V,E>
-
+
- Parameters:
edges- edges to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call
- See Also:
Graph.removeAllEdges(Collection)
+ +
+removeAllEdges
++public java.util.Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges. Returns
+
nullif 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 theGraph.removeEdge(Object)method, or + theGraph.removeEdge(Object, Object)method. ++
-
+
- Specified by:
removeAllEdgesin interfaceGraph<V,E>- Overrides:
removeAllEdgesin classAbstractGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- the removed edges, or
nullif no either vertex not + part of graph - See Also:
Graph.removeAllEdges(Object, Object)
+ +
+removeAllVertices
++public boolean removeAllVertices(java.util.Collection<? extends V> vertices)+
-
+
- Description copied from interface:
Graph
+ - Removes all the vertices in this graph that are also contained in the
+ specified vertex collection. After this call returns, this graph will
+ contain no vertices in common with the specified vertices. This method
+ will invoke the
Graph.removeVertex(Object)method. ++
-
+
- Specified by:
removeAllVerticesin interfaceGraph<V,E>- Overrides:
removeAllVerticesin classAbstractGraph<V,E>
-
+
- Parameters:
vertices- vertices to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call
- See Also:
Graph.removeAllVertices(Collection)
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.- See Also:
Graph.removeEdge(Object)
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.- See Also:
Graph.removeVertex(Object)
+ +
+vertexSet
++public java.util.Set<V> vertexSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the vertices contained in this graph. The set is backed
+ by the graph, so changes to the graph are reflected in the set. If the
+ graph is modified while an iteration over the set is in progress, the
+ results of the iteration are undefined.
+
+
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.+
-
+
+
- Returns:
- a set view of the vertices contained in this graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Multigraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Multigraph.html new file mode 100644 index 00000000..bb176cfe --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Multigraph.html @@ -0,0 +1,298 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class Multigraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, UndirectedGraph<V,E> +
-
+
- Direct Known Subclasses:
- WeightedMultigraph +
+
-
+
public class Multigraph<V,E>
- extends AbstractBaseGraph<V,E>
- implements UndirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A multigraph. A multigraph is a non-simple undirected graph in which no loops + are permitted, but multiple edges between any two vertices are. If you're + unsure about multigraphs, see: + http://mathworld.wolfram.com/Multigraph.html. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
Multigraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new multigraph. |
+|
Multigraph(EdgeFactory<V,E> ef)
+
++ Creates a new multigraph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+Multigraph
++public Multigraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new multigraph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+Multigraph
++public Multigraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new multigraph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ParanoidGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ParanoidGraph.html new file mode 100644 index 00000000..564a20c4 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/ParanoidGraph.html @@ -0,0 +1,354 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class ParanoidGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E> +
+
-
+
public class ParanoidGraph<V,E>
- extends GraphDelegator<V,E>
+ParanoidGraph provides a way to verify that objects added to a graph obey the + standard equals/hashCode contract. It can be used to wrap an underlying graph + to be verified. Note that the verification is very expensive, so + ParanoidGraph should only be used during debugging. +
+ +
+
-
+
- Version: +
- $Id: ParanoidGraph.java 645 2008-09-30 19:44:48Z perfecthash $ +
- Author: +
- John Sichi +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
ParanoidGraph(Graph<V,E> g)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
addEdge, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
containsEdge, removeAllEdges, removeAllEdges, removeAllVertices |
+
| +Constructor Detail | +
|---|
+ParanoidGraph
++public ParanoidGraph(Graph<V,E> g)+
-
+
| +Method Detail | +
|---|
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
- +
+-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
- See Also:
Graph.addVertex(Object)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Pseudograph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Pseudograph.html new file mode 100644 index 00000000..d57807f5 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Pseudograph.html @@ -0,0 +1,297 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class Pseudograph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, UndirectedGraph<V,E> +
-
+
- Direct Known Subclasses:
- WeightedPseudograph +
+
-
+
public class Pseudograph<V,E>
- extends AbstractBaseGraph<V,E>
- implements UndirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A pseudograph. A pseudograph is a non-simple undirected graph in which both + graph loops and multiple edges are permitted. If you're unsure about + pseudographs, see: + http://mathworld.wolfram.com/Pseudograph.html. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
Pseudograph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new pseudograph. |
+|
Pseudograph(EdgeFactory<V,E> ef)
+
++ Creates a new pseudograph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+Pseudograph
++public Pseudograph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new pseudograph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+Pseudograph
++public Pseudograph(EdgeFactory<V,E> ef)+
-
+
- Creates a new pseudograph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleDirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleDirectedGraph.html new file mode 100644 index 00000000..a1f2f7ac --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleDirectedGraph.html @@ -0,0 +1,295 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class SimpleDirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E> +
-
+
- Direct Known Subclasses:
- SimpleDirectedWeightedGraph +
+
-
+
public class SimpleDirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
- implements DirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A simple directed graph. A simple directed graph is a directed graph in which + neither multiple edges between any two vertices nor loops are permitted. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
SimpleDirectedGraph(java.lang.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. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+SimpleDirectedGraph
++public SimpleDirectedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new simple directed graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ +
+SimpleDirectedGraph
++public SimpleDirectedGraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new simple directed graph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleDirectedWeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleDirectedWeightedGraph.html new file mode 100644 index 00000000..11c1890f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleDirectedWeightedGraph.html @@ -0,0 +1,322 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class SimpleDirectedWeightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, DirectedGraph<V,E>, Graph<V,E>, WeightedGraph<V,E> +
+
-
+
public class SimpleDirectedWeightedGraph<V,E>
- extends SimpleDirectedGraph<V,E>
- implements WeightedGraph<V,E>
- extends SimpleDirectedGraph<V,E>
+A simple directed weighted graph. A simple directed weighted graph is a + simple directed graph for which edges are assigned weights. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
SimpleDirectedWeightedGraph(java.lang.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. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| +Constructor Detail | +
|---|
+SimpleDirectedWeightedGraph
++public SimpleDirectedWeightedGraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new simple directed weighted graph with the specified edge
+ factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ +
+SimpleDirectedWeightedGraph
++public SimpleDirectedWeightedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new simple directed weighted graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleGraph.html new file mode 100644 index 00000000..53b0264c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleGraph.html @@ -0,0 +1,298 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class SimpleGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, UndirectedGraph<V,E> +
-
+
- Direct Known Subclasses:
- BlockCutpointGraph, SimpleWeightedGraph +
+
-
+
public class SimpleGraph<V,E>
- extends AbstractBaseGraph<V,E>
- implements UndirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
+A simple graph. A simple graph is an undirected graph for which at most one + edge connects any two vertices, and loops are not permitted. If you're unsure + about simple graphs, see: + http://mathworld.wolfram.com/SimpleGraph.html. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
SimpleGraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new simple graph. |
+|
SimpleGraph(EdgeFactory<V,E> ef)
+
++ Creates a new simple graph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+SimpleGraph
++public SimpleGraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new simple graph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ +
+SimpleGraph
++public SimpleGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new simple graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleWeightedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleWeightedGraph.html new file mode 100644 index 00000000..9db52d98 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/SimpleWeightedGraph.html @@ -0,0 +1,320 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class SimpleWeightedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, UndirectedGraph<V,E>, WeightedGraph<V,E> +
+
-
+
public class SimpleWeightedGraph<V,E>
- extends SimpleGraph<V,E>
- implements WeightedGraph<V,E>
- extends SimpleGraph<V,E>
+A simple weighted graph. A simple weighted graph is a simple graph for which + edges are assigned weights. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
SimpleWeightedGraph(java.lang.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. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| +Constructor Detail | +
|---|
+SimpleWeightedGraph
++public SimpleWeightedGraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new simple weighted graph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ +
+SimpleWeightedGraph
++public SimpleWeightedGraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new simple weighted graph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Subgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Subgraph.html new file mode 100644 index 00000000..b27aef17 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/Subgraph.html @@ -0,0 +1,940 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class Subgraph<V,E,G extends Graph<V,E>>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E> +
-
+
- Direct Known Subclasses:
- DirectedSubgraph, UndirectedSubgraph +
+
-
+
public class Subgraph<V,E,G extends Graph<V,E>>
- extends AbstractGraph<V,E>
- implements java.io.Serializable
- extends AbstractGraph<V,E>
+A subgraph is a graph that has a subset of vertices and a subset of edges
+ with respect to some base graph. More formally, a subgraph G(V,E) that is
+ based on a base graph Gb(Vb,Eb) satisfies the following subgraph
+ property: V is a subset of Vb and E is a subset of Eb. Other than
+ this property, a subgraph is a graph with any respect and fully complies with
+ the 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).
+ +
+
-
+
- Since: +
- Jul 18, 2003 +
- Author: +
- Barak Naveh +
- See Also:
Graph, +Set, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
Subgraph(G base,
+ java.util.Set<V> vertexSubset)
+
++ Creates a new induced Subgraph. |
+|
Subgraph(G base,
+ java.util.Set<V> vertexSubset,
+ java.util.Set<E> edgeSubset)
+
++ Creates a new Subgraph. |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
+ java.util.Set<E> |
+edgeSet()
+
++ Returns a set of the edges contained in this graph. |
+
+ java.util.Set<E> |
+edgesOf(V vertex)
+
++ Returns a set of all edges touching the specified vertex. |
+
+ java.util.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)
+
++ |
+
+ java.util.Set<V> |
+vertexSet()
+
++ Returns a set of the vertices contained in this graph. |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+Subgraph
++public Subgraph(G base, + java.util.Set<V> vertexSubset, + java.util.Set<E> edgeSubset)+
-
+
- Creates a new Subgraph.
+
+
-
+
- Parameters:
base- the base (backing) graph on which the subgraph will be based.vertexSubset- vertices to include in the subgraph. If+ nullthen all vertices are included.edgeSubset- edges to in include in the subgraph. If+ nullthen all the edges whose vertices found in the graph are + included.
+ +
+Subgraph
++public Subgraph(G base, + java.util.Set<V> vertexSubset)+
-
+
- Creates a new induced Subgraph. The subgraph will keep track of edges
+ being added to its vertex subset as well as deletion of edges and
+ vertices. If base it not listenable, this is identical to the call
+ Subgraph(base, vertexSubset, null) .
+
+
-
+
- Parameters:
base- the base (backing) graph on which the subgraph will be based.vertexSubset- vertices to include in the subgraph. If+ nullthen all vertices are included.
| +Method Detail | +
|---|
+getAllEdges
++public java.util.Set<E> getAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges connecting source vertex to target vertex if
+ such vertices exist in this graph. If any of the vertices does not exist
+ or is
null, returnsnull. 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.
++
-
+
- Specified by:
getAllEdgesin interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
Graph.getAllEdges(Object, Object)
+ +
+getEdge
++public E getEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Returns an edge connecting source vertex to target vertex if such
+ vertices and such edge exist in this graph. Otherwise returns
+ null. If any of the specified vertices isnull+ returnsnull+ +In undirected graphs, the returned edge may have its source and target + vertices in the opposite order.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- an edge connecting source vertex to target vertex.
- See Also:
Graph.getEdge(Object, Object)
+ +
+getEdgeFactory
++public EdgeFactory<V,E> getEdgeFactory()+
-
+
- Description copied from interface:
Graph
+ - Returns the edge factory using which this graph creates new edges. The
+ edge factory is defined when the graph is constructed and must not be
+ modified.
+
+
-
+
- Specified by:
getEdgeFactoryin interfaceGraph<V,E>
-
+
+
- Returns:
- the edge factory using which this graph creates new edges.
- See Also:
Graph.getEdgeFactory()
+ +
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Adds the specified vertex to this subgraph.
+
+
- +
+-
+
- Parameters:
v- the vertex to be added. +- Returns:
trueif the vertex was added, otherwise+ false. +- Throws: +
java.lang.NullPointerException+java.lang.IllegalArgumentException- See Also:
Subgraph, +Graph.addVertex(Object)
+ +
+containsEdge
++public boolean containsEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified edge. More
+ formally, returns true if and only if this graph contains an
+ edge
e2such thate.equals(e2). If the + specified edge isnullreturnsfalse. ++
-
+
- Specified by:
containsEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified edge.
- See Also:
Graph.containsEdge(Object)
+ +
+containsVertex
++public boolean containsVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Returns true if this graph contains the specified vertex. More
+ formally, returns true if and only if this graph contains a
+ vertex
usuch thatu.equals(v). If the + specified vertex isnullreturnsfalse. ++
-
+
- Specified by:
containsVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex whose presence in this graph is to be tested. +- Returns:
- true if this graph contains the specified vertex.
- See Also:
Graph.containsVertex(Object)
+ +
+edgeSet
++public java.util.Set<E> edgeSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the edges contained in this graph. The set is backed by
+ the graph, so changes to the graph are reflected in the set. If the graph
+ is modified while an iteration over the set is in progress, the results
+ of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set of the edges contained in this graph.
- See Also:
Graph.edgeSet()
+ +
+edgesOf
++public java.util.Set<E> edgesOf(V vertex)+
-
+
- Description copied from interface:
Graph
+ - Returns a set of all edges touching the specified vertex. If no edges are
+ touching the specified vertex returns an empty set.
+
+
- +
+-
+
- Parameters:
vertex- the vertex for which a set of touching edges is to be + returned. +- Returns:
- a set of all edges touching the specified vertex.
- See Also:
Graph.edgesOf(Object)
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.- See Also:
Graph.removeEdge(Object)
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Specified by:
removeVertexin interfaceGraph<V,E>
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.- See Also:
Graph.removeVertex(Object)
+ +
+vertexSet
++public java.util.Set<V> vertexSet()+
-
+
- Description copied from interface:
Graph
+ - Returns a set of the vertices contained in this graph. The set is backed
+ by the graph, so changes to the graph are reflected in the set. If the
+ graph is modified while an iteration over the set is in progress, the
+ results of the iteration are undefined.
+
+
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.+
- +
+-
+
+
- Returns:
- a set view of the vertices contained in this graph.
- See Also:
Graph.vertexSet()
+ +
+getEdgeSource
++public V getEdgeSource(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the source vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeSourcein interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- source vertex
- See Also:
Graph.getEdgeSource(Object)
+ +
+getEdgeTarget
++public V getEdgeTarget(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the target vertex of an edge. For an undirected graph, source and
+ target are distinguishable designations (but without any mathematical
+ meaning).
+
+
-
+
- Specified by:
getEdgeTargetin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- target vertex
- See Also:
Graph.getEdgeTarget(Object)
+ +
+getBase
++public G getBase()+
-
+
-
+
+-
+
+
+ +
+getEdgeWeight
++public double getEdgeWeight(E e)+
-
+
- Description copied from interface:
Graph
+ - Returns the weight assigned to a given edge. Unweighted graphs return 1.0
+ (as defined by
WeightedGraph.DEFAULT_EDGE_WEIGHT), allowing + weighted-graph algorithms to apply to them where meaningful. ++
-
+
- Specified by:
getEdgeWeightin interfaceGraph<V,E>
-
+
- Parameters:
e- edge of interest +- Returns:
- edge weight
- See Also:
Graph.getEdgeWeight(Object)
+ +
+setEdgeWeight
++public void setEdgeWeight(E e, + double weight)+
-
+
-
+
+- + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedGraphUnion.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedGraphUnion.html new file mode 100644 index 00000000..4dadbcca --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedGraphUnion.html @@ -0,0 +1,259 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UndirectedGraphUnion<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E>, UndirectedGraph<V,E> +
+
-
+
public class UndirectedGraphUnion<V,E>
- extends GraphUnion<V,E,UndirectedGraph<V,E>>
- implements UndirectedGraph<V,E>
- extends GraphUnion<V,E,UndirectedGraph<V,E>>
+
-
+
- See Also:
- Serialized Form
+ +
| +Method Summary | +|
|---|---|
+ int |
+degreeOf(V vertex)
+
++ Returns the degree of the specified vertex. |
+
| Methods inherited from class org.jgrapht.graph.GraphUnion | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Method Detail | +
|---|
+degreeOf
++public int degreeOf(V vertex)+
-
+
- Description copied from interface:
UndirectedGraph
+ - Returns the degree of the specified vertex. A degree of a vertex in an
+ undirected graph is the number of edges touching that vertex.
+
+
-
+
- Specified by:
degreeOfin interfaceUndirectedGraph<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedMaskSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedMaskSubgraph.html new file mode 100644 index 00000000..b6d0f0e3 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedMaskSubgraph.html @@ -0,0 +1,275 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UndirectedMaskSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- Graph<V,E>, UndirectedGraph<V,E> +
+
-
+
public class UndirectedMaskSubgraph<V,E>
- extends MaskSubgraph<V,E>
- implements UndirectedGraph<V,E>
- extends MaskSubgraph<V,E>
+An undirected graph that is a MaskSubgraph on another graph.
+
+ +
+
-
+
- Since: +
- July 5, 2007 +
- Author: +
- Guillaume Boulmier +
+ +
| +Constructor Summary | +|
|---|---|
UndirectedMaskSubgraph(UndirectedGraph<V,E> base,
+ MaskFunctor<V,E> mask)
+
++ |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.MaskSubgraph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+UndirectedMaskSubgraph
++public UndirectedMaskSubgraph(UndirectedGraph<V,E> base, + MaskFunctor<V,E> mask)+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedSubgraph.html new file mode 100644 index 00000000..4036a002 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedSubgraph.html @@ -0,0 +1,311 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UndirectedSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E>, UndirectedGraph<V,E> +
-
+
- Direct Known Subclasses:
- UndirectedWeightedSubgraph +
+
-
+
public class UndirectedSubgraph<V,E>
- extends Subgraph<V,E,UndirectedGraph<V,E>>
- implements UndirectedGraph<V,E>
- extends Subgraph<V,E,UndirectedGraph<V,E>>
+An undirected graph that is a subgraph on other graph. +
+ +
+
-
+
- See Also:
Subgraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
UndirectedSubgraph(UndirectedGraph<V,E> base,
+ java.util.Set<V> vertexSubset,
+ java.util.Set<E> edgeSubset)
+
++ Creates a new undirected subgraph. |
+|
| +Method Summary | +|
|---|---|
+ int |
+degreeOf(V vertex)
+
++ Returns the degree of the specified vertex. |
+
| Methods inherited from class org.jgrapht.graph.Subgraph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+UndirectedSubgraph
++public UndirectedSubgraph(UndirectedGraph<V,E> base, + java.util.Set<V> vertexSubset, + java.util.Set<E> edgeSubset)+
-
+
- Creates a new undirected subgraph.
+
+
-
+
- Parameters:
base- the base (backing) graph on which the subgraph will be based.vertexSubset- vertices to include in the subgraph. If+ nullthen all vertices are included.edgeSubset- edges to in include in the subgraph. If+ nullthen all the edges whose vertices found in the graph are + included.
| +Method Detail | +
|---|
+degreeOf
++public int degreeOf(V vertex)+
-
+
- Description copied from interface:
UndirectedGraph
+ - Returns the degree of the specified vertex. A degree of a vertex in an
+ undirected graph is the number of edges touching that vertex.
+
+
-
+
- Specified by:
degreeOfin interfaceUndirectedGraph<V,E>
-
+
- Parameters:
vertex- vertex whose degree is to be calculated. +- Returns:
- the degree of the specified vertex.
- See Also:
UndirectedGraph.degreeOf(Object)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedWeightedSubgraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedWeightedSubgraph.html new file mode 100644 index 00000000..f4a89fae --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UndirectedWeightedSubgraph.html @@ -0,0 +1,309 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UndirectedWeightedSubgraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E>, UndirectedGraph<V,E>, WeightedGraph<V,E> +
+
-
+
public class UndirectedWeightedSubgraph<V,E>
- extends UndirectedSubgraph<V,E>
- implements WeightedGraph<V,E>
- extends UndirectedSubgraph<V,E>
+An undirected weighted graph that is a subgraph on other graph. +
+ +
+
-
+
- See Also:
Subgraph, +Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
UndirectedWeightedSubgraph(WeightedGraph<V,E> base,
+ java.util.Set<V> vertexSubset,
+ java.util.Set<E> edgeSubset)
+
++ Creates a new undirected weighted subgraph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.UndirectedSubgraph | +
|---|
degreeOf |
+
| Methods inherited from class org.jgrapht.graph.Subgraph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getBase, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeEdge, removeEdge, removeVertex, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+UndirectedWeightedSubgraph
++public UndirectedWeightedSubgraph(WeightedGraph<V,E> base, + java.util.Set<V> vertexSubset, + java.util.Set<E> edgeSubset)+
-
+
- Creates a new undirected weighted subgraph.
+
+
-
+
- Parameters:
base- the base (backing) graph on which the subgraph will be based.vertexSubset- vertices to include in the subgraph. If+ nullthen all vertices are included.edgeSubset- edges to in include in the subgraph. If+ nullthen all the edges whose vertices found in the graph are + included.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableDirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableDirectedGraph.html new file mode 100644 index 00000000..4e589b01 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableDirectedGraph.html @@ -0,0 +1,287 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UnmodifiableDirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, DirectedGraph<V,E>, Graph<V,E> +
+
-
+
public class UnmodifiableDirectedGraph<V,E>
- extends UnmodifiableGraph<V,E>
- implements DirectedGraph<V,E>
- extends UnmodifiableGraph<V,E>
+A directed graph that cannot be modified. +
+ +
+
-
+
- See Also:
UnmodifiableGraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
UnmodifiableDirectedGraph(DirectedGraph<V,E> g)
+
++ Creates a new unmodifiable directed graph based on the specified backing + graph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.UnmodifiableGraph | +
|---|
addEdge, addEdge, addVertex, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.DirectedGraph | +
|---|
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+UnmodifiableDirectedGraph
++public UnmodifiableDirectedGraph(DirectedGraph<V,E> g)+
-
+
- Creates a new unmodifiable directed graph based on the specified backing
+ graph.
+
+
-
+
- Parameters:
g- the backing graph on which an unmodifiable graph is to be + created.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableGraph.html new file mode 100644 index 00000000..c355556b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableGraph.html @@ -0,0 +1,612 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UnmodifiableGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E> +
-
+
- Direct Known Subclasses:
- UnmodifiableDirectedGraph, UnmodifiableUndirectedGraph +
+
-
+
public class UnmodifiableGraph<V,E>
- extends GraphDelegator<V,E>
- implements java.io.Serializable
- extends GraphDelegator<V,E>
+An unmodifiable view of the backing graph specified in the constructor. This
+ graph allows modules to provide users with "read-only" access to internal
+ graphs. Query operations on this graph "read through" to the backing graph,
+ and attempts to modify this graph result in an
+ 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.
++ +
+
-
+
- Since: +
- Jul 24, 2003 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
UnmodifiableGraph(Graph<V,E> g)
+
++ Creates a new unmodifiable graph based on the specified backing graph. |
+|
| +Method Summary | +|
|---|---|
+ 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(java.util.Collection<? extends E> edges)
+
++ Removes all the edges in this graph that are also contained in the + specified edge collection. |
+
+ java.util.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(java.util.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. |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
containsEdge |
+
| +Constructor Detail | +
|---|
+UnmodifiableGraph
++public UnmodifiableGraph(Graph<V,E> g)+
-
+
- Creates a new unmodifiable graph based on the specified backing graph.
+
+
-
+
- Parameters:
g- the backing graph on which an unmodifiable graph is to be + created.
| +Method Detail | +
|---|
+addEdge
++public E addEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Creates a new edge in this graph, going from the source vertex to the
+ target vertex, and returns the created edge. 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
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
+eusing this graph's +EdgeFactory. For the new edge to be addede+ 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 + edgee2such thate2.equals(e). If such+ e2is found then the newly created edgeeis + abandoned, the method leaves this graph unchanged returns+ null.+
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The newly created edge if added to the graph, otherwise
+ null. - See Also:
Graph.addEdge(Object, Object)
+ +
+addEdge
++public boolean addEdge(V sourceVertex, + V targetVertex, + E e)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified edge to this graph, going from the source vertex to
+ the target vertex. More formally, adds the specified edge,
+ e, to this graph if this graph contains no edgee2+ such thate2.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.
++
- +
+-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + edge.
- See Also:
Graph.addEdge(Object, Object, Object)
+ +
+addVertex
++public boolean addVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Adds the specified vertex to this graph if not already present. More
+ formally, adds the specified vertex,
v, to this graph if + this graph contains no vertexusuch 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. ++
- +
+-
+
- Parameters:
v- vertex to be added to this graph. +- Returns:
- true if this graph did not already contain the specified + vertex.
- See Also:
Graph.addVertex(Object)
+ +
+removeAllEdges
++public boolean removeAllEdges(java.util.Collection<? extends E> edges)+
-
+
- Description copied from interface:
Graph
+ - Removes all the edges in this graph that are also contained in the
+ specified edge collection. After this call returns, this graph will
+ contain no edges in common with the specified edges. This method will
+ invoke the
Graph.removeEdge(Object)method. ++
-
+
- Specified by:
removeAllEdgesin interfaceGraph<V,E>- Overrides:
removeAllEdgesin classAbstractGraph<V,E>
-
+
- Parameters:
edges- edges to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call
- See Also:
Graph.removeAllEdges(Collection)
+ +
+removeAllEdges
++public java.util.Set<E> removeAllEdges(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes all the edges going from the specified source vertex to the
+ specified target vertex, and returns a set of all removed edges. Returns
+
nullif 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 theGraph.removeEdge(Object)method, or + theGraph.removeEdge(Object, Object)method. ++
-
+
- Specified by:
removeAllEdgesin interfaceGraph<V,E>- Overrides:
removeAllEdgesin classAbstractGraph<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- the removed edges, or
nullif no either vertex not + part of graph - See Also:
Graph.removeAllEdges(Object, Object)
+ +
+removeAllVertices
++public boolean removeAllVertices(java.util.Collection<? extends V> vertices)+
-
+
- Description copied from interface:
Graph
+ - Removes all the vertices in this graph that are also contained in the
+ specified vertex collection. After this call returns, this graph will
+ contain no vertices in common with the specified vertices. This method
+ will invoke the
Graph.removeVertex(Object)method. ++
-
+
- Specified by:
removeAllVerticesin interfaceGraph<V,E>- Overrides:
removeAllVerticesin classAbstractGraph<V,E>
-
+
- Parameters:
vertices- vertices to be removed from this graph. +- Returns:
- true if this graph changed as a result of the call
- See Also:
Graph.removeAllVertices(Collection)
+ +
+removeEdge
++public boolean removeEdge(E e)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified edge from the graph. Removes the specified edge
+ from this graph if it is present. More formally, removes an edge
+ e2such thate2.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
+nullreturns+ false.+
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>
-
+
- Parameters:
e- edge to be removed from this graph, if present. +- Returns:
trueif and only if the graph contained the + specified edge.- See Also:
Graph.removeEdge(Object)
+ +
+removeEdge
++public E removeEdge(V sourceVertex, + V targetVertex)+
-
+
- Description copied from interface:
Graph
+ - Removes an edge going from source vertex to target vertex, if such
+ vertices and such edge exist in this graph. Returns the edge if removed
+ or
nullotherwise. ++
-
+
- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>
-
+
- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge. +- Returns:
- The removed edge, or
nullif no edge removed. - See Also:
Graph.removeEdge(Object, Object)
+ +
+removeVertex
++public boolean removeVertex(V v)+
-
+
- Description copied from interface:
Graph
+ - Removes the specified vertex from this graph including all its touching
+ edges if present. More formally, if the graph contains a vertex
+ usuch thatu.equals(v), the call removes all edges + that touchuand then removesuitself. If no + suchuis 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
+nullreturns+ false.+
-
+
- Specified by:
removeVertexin interfaceGraph<V,E>- Overrides:
removeVertexin classGraphDelegator<V,E>
-
+
- Parameters:
v- vertex to be removed from this graph, if present. +- Returns:
trueif the graph contained the specified vertex; +falseotherwise.- See Also:
Graph.removeVertex(Object)
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableUndirectedGraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableUndirectedGraph.html new file mode 100644 index 00000000..f76e4cbb --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/UnmodifiableUndirectedGraph.html @@ -0,0 +1,287 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class UnmodifiableUndirectedGraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, Graph<V,E>, UndirectedGraph<V,E> +
+
-
+
public class UnmodifiableUndirectedGraph<V,E>
- extends UnmodifiableGraph<V,E>
- implements UndirectedGraph<V,E>
- extends UnmodifiableGraph<V,E>
+An undirected graph that cannot be modified. +
+ +
+
-
+
- See Also:
UnmodifiableGraph, +Serialized Form
+ +
| +Constructor Summary | +|
|---|---|
UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)
+
++ Creates a new unmodifiable undirected graph based on the specified + backing graph. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.UnmodifiableGraph | +
|---|
addEdge, addEdge, addVertex, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex |
+
| Methods inherited from class org.jgrapht.graph.GraphDelegator | +
|---|
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeWeight, toString, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| +Constructor Detail | +
|---|
+UnmodifiableUndirectedGraph
++public UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)+
-
+
- Creates a new unmodifiable undirected graph based on the specified
+ backing graph.
+
+
-
+
- Parameters:
g- the backing graph on which an unmodifiable graph is to be + created.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/WeightedMultigraph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/WeightedMultigraph.html new file mode 100644 index 00000000..9987741d --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/WeightedMultigraph.html @@ -0,0 +1,323 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class WeightedMultigraph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, UndirectedGraph<V,E>, WeightedGraph<V,E> +
+
-
+
public class WeightedMultigraph<V,E>
- extends Multigraph<V,E>
- implements WeightedGraph<V,E>
- extends Multigraph<V,E>
+A weighted multigraph. A weighted multigraph is a non-simple undirected graph + in which no loops are permitted, but multiple edges between any two vertices + are. The edges of a weighted multigraph have weights. If you're unsure about + multigraphs, see: + http://mathworld.wolfram.com/Multigraph.html. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
WeightedMultigraph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new weighted multigraph. |
+|
WeightedMultigraph(EdgeFactory<V,E> ef)
+
++ Creates a new weighted multigraph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| +Constructor Detail | +
|---|
+WeightedMultigraph
++public WeightedMultigraph(EdgeFactory<V,E> ef)+
-
+
- Creates a new weighted multigraph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ +
+WeightedMultigraph
++public WeightedMultigraph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new weighted multigraph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/WeightedPseudograph.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/WeightedPseudograph.html new file mode 100644 index 00000000..44097e70 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/WeightedPseudograph.html @@ -0,0 +1,323 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.graph
+
+Class WeightedPseudograph<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, Graph<V,E>, UndirectedGraph<V,E>, WeightedGraph<V,E> +
+
-
+
public class WeightedPseudograph<V,E>
- extends Pseudograph<V,E>
- implements WeightedGraph<V,E>
- extends Pseudograph<V,E>
+A weighted pseudograph. A weighted pseudograph is a non-simple undirected + graph in which both graph loops and multiple edges are permitted. The edges + of a weighted pseudograph have weights. If you're unsure about pseudographs, + see: + http://mathworld.wolfram.com/Pseudograph.html. +
+ +
+
-
+
- See Also:
- Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from interface org.jgrapht.WeightedGraph | +
|---|
DEFAULT_EDGE_WEIGHT |
+
| +Constructor Summary | +|
|---|---|
WeightedPseudograph(java.lang.Class<? extends E> edgeClass)
+
++ Creates a new weighted pseudograph. |
+|
WeightedPseudograph(EdgeFactory<V,E> ef)
+
++ Creates a new weighted pseudograph with the specified edge factory. |
+|
| +Method Summary | +
|---|
| Methods inherited from class org.jgrapht.graph.AbstractBaseGraph | +
|---|
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
+
| Methods inherited from class org.jgrapht.graph.AbstractGraph | +
|---|
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
+
| Methods inherited from class java.lang.Object | +
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface org.jgrapht.WeightedGraph | +
|---|
setEdgeWeight |
+
| Methods inherited from interface org.jgrapht.Graph | +
|---|
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
+
| Methods inherited from interface org.jgrapht.UndirectedGraph | +
|---|
degreeOf |
+
| +Constructor Detail | +
|---|
+WeightedPseudograph
++public WeightedPseudograph(EdgeFactory<V,E> ef)+
-
+
- Creates a new weighted pseudograph with the specified edge factory.
+
+
-
+
- Parameters:
ef- the edge factory of the new graph.
+ +
+WeightedPseudograph
++public WeightedPseudograph(java.lang.Class<? extends E> edgeClass)+
-
+
- Creates a new weighted pseudograph.
+
+
-
+
- Parameters:
edgeClass- class on which to base factory for edges
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/package-frame.html new file mode 100644 index 00000000..65d38463 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/package-frame.html @@ -0,0 +1,137 @@ + + + + + +
|
+Interfaces
+
+ +EdgeSetFactory + +MaskFunctor |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.graph +
+Implementations of various graphs. +
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| EdgeSetFactory<V,E> | +A factory for edge sets. | +
| MaskFunctor<V,E> | +A functor interface for masking out vertices and edges of a graph. | +
+ +
| +Class Summary | +|
|---|---|
| AbstractBaseGraph<V,E> | +The most general implementation of the Graph interface. |
+
| 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. | +
| 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. | +
| 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. | +
| 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. | +
| 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. | +
+Package org.jgrapht.graph Description +
+ ++Implementations of various graphs. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/package-tree.html new file mode 100644 index 00000000..43f6653b --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/graph/package-tree.html @@ -0,0 +1,237 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.graph +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.graph.AbstractGraph<V,E> (implements org.jgrapht.Graph<V,E>)
+
-
+
- org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
+
-
+
- org.jgrapht.graph.DefaultDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.DefaultDirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DirectedMultigraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.DirectedWeightedMultigraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DirectedPseudograph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.Multigraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.WeightedMultigraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.Pseudograph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.WeightedPseudograph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.SimpleDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.SimpleDirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.SimpleGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.SimpleWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DefaultDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
- org.jgrapht.graph.GraphDelegator<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
+
-
+
- org.jgrapht.graph.AsUndirectedGraph<V,E> (implements java.io.Serializable, org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.AsUnweightedDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>, java.io.Serializable) +
- org.jgrapht.graph.AsUnweightedGraph<V,E> (implements java.io.Serializable) +
- org.jgrapht.graph.AsWeightedGraph<V,E> (implements java.io.Serializable, org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DefaultListenableGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.ListenableGraph<V,E>)
+
-
+
- org.jgrapht.graph.ListenableDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.ListenableDirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.ListenableUndirectedGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.ListenableUndirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.ListenableDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
- org.jgrapht.graph.EdgeReversedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.ParanoidGraph<V,E>
- org.jgrapht.graph.UnmodifiableGraph<V,E> (implements java.io.Serializable)
+
-
+
- org.jgrapht.graph.UnmodifiableDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.UnmodifiableUndirectedGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.GraphUnion<V,E,G> (implements java.io.Serializable)
+
-
+
- org.jgrapht.graph.DirectedGraphUnion<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.UndirectedGraphUnion<V,E> (implements org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.MaskSubgraph<V,E>
-
+
- org.jgrapht.graph.DirectedMaskSubgraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.UndirectedMaskSubgraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.Subgraph<V,E,G> (implements java.io.Serializable)
+
-
+
- org.jgrapht.graph.DirectedSubgraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.DirectedWeightedSubgraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.UndirectedSubgraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.UndirectedWeightedSubgraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DirectedSubgraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
- org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
+
- org.jgrapht.graph.ClassBasedEdgeFactory<V,E> (implements org.jgrapht.EdgeFactory<V,E>, java.io.Serializable) +
- org.jgrapht.graph.ClassBasedVertexFactory<V> (implements org.jgrapht.VertexFactory<V>) +
- org.jgrapht.graph.DefaultEdge
-
+
- org.jgrapht.graph.DefaultWeightedEdge
- org.jgrapht.graph.DefaultGraphMapping<V,E> (implements org.jgrapht.GraphMapping<V,E>) +
- org.jgrapht.graph.GraphPathImpl<V,E> (implements org.jgrapht.GraphPath<V,E>) +
- org.jgrapht.graph.AbstractGraph<V,E> (implements org.jgrapht.Graph<V,E>)
+
+Interface Hierarchy +
+-
+
- org.jgrapht.graph.EdgeSetFactory<V,E>
- org.jgrapht.graph.MaskFunctor<V,E>
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/package-frame.html new file mode 100644 index 00000000..60e3dee6 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/package-frame.html @@ -0,0 +1,61 @@ + + + + + +
|
+Interfaces
+
+ +DirectedGraph + +EdgeFactory + +Graph + +GraphMapping + +GraphPath + +ListenableGraph + +UndirectedGraph + +VertexFactory + +WeightedGraph |
+
|
+Classes
+
+ +GraphHelper + +Graphs |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht +
+The front-end API's interfaces and classes, includingGraph,
+DirectedGraph and UndirectedGraph.
+
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| 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> | +A GraphPath represents a
+ path in a Graph. |
+
| 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 Summary | +|
|---|---|
| GraphHelper | +Deprecated. Use Graphs instead. |
+
| Graphs | +A collection of utilities to assist with graph manipulation. | +
+Package org.jgrapht Description +
+ +
+The front-end API's interfaces and classes, including Graph,
+DirectedGraph and UndirectedGraph.
+
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/package-tree.html new file mode 100644 index 00000000..cc88c5b6 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/package-tree.html @@ -0,0 +1,160 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.Graphs
-
+
- org.jgrapht.GraphHelper
- org.jgrapht.Graphs
+Interface Hierarchy +
+-
+
- org.jgrapht.EdgeFactory<V,E>
- org.jgrapht.Graph<V,E>
-
+
- org.jgrapht.DirectedGraph<V,E>
- org.jgrapht.ListenableGraph<V,E>
- org.jgrapht.UndirectedGraph<V,E>
- org.jgrapht.WeightedGraph<V,E>
- org.jgrapht.GraphMapping<V,E>
- org.jgrapht.GraphPath<V,E>
- org.jgrapht.VertexFactory<V>
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/AbstractGraphIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/AbstractGraphIterator.html new file mode 100644 index 00000000..b2cd7313 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/AbstractGraphIterator.html @@ -0,0 +1,606 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Class AbstractGraphIterator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.Iterator<V>, GraphIterator<V,E> +
-
+
- Direct Known Subclasses:
- CrossComponentIterator +
+
-
+
public abstract class AbstractGraphIterator<V,E>
- extends java.lang.Object
- implements GraphIterator<V,E>
- extends java.lang.Object
+An empty implementation of a graph iterator to minimize the effort required + to implement graph iterators. +
+ +
+
-
+
- Since: +
- Jul 19, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Field Summary | +|
|---|---|
+protected int |
+nListeners
+
++ |
+
| +Constructor Summary | +|
|---|---|
AbstractGraphIterator()
+
++ |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| Methods inherited from interface java.util.Iterator | +
|---|
hasNext, next |
+
| +Field Detail | +
|---|
+nListeners
++protected int nListeners+
-
+
-
+
| +Constructor Detail | +
|---|
+AbstractGraphIterator
++public AbstractGraphIterator()+
-
+
| +Method Detail | +
|---|
+setCrossComponentTraversal
++public void setCrossComponentTraversal(boolean crossComponentTraversal)+
-
+
- Sets the cross component traversal flag - indicates whether to traverse
+ the graph across connected components.
+
+
-
+
-
+
- Parameters:
crossComponentTraversal- iftruetraverses across + connected components.
+ +
+isCrossComponentTraversal
++public boolean isCrossComponentTraversal()+
-
+
- Test whether this iterator is set to traverse the graph across connected
+ components.
+
+
-
+
- Specified by:
isCrossComponentTraversalin interfaceGraphIterator<V,E>
-
+
+
- Returns:
trueif traverses across connected components, + otherwisefalse.
+ +
+setReuseEvents
++public void setReuseEvents(boolean reuseEvents)+
-
+
- Description copied from interface:
GraphIterator
+ - Sets a value the
reuseEventsflag. If the+ reuseEventsflag is set totruethis 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. ++
-
+
- Specified by:
setReuseEventsin interfaceGraphIterator<V,E>
-
+
- Parameters:
reuseEvents- whether to reuse previously fired event objects + instead of creating a new event object for each event.- See Also:
GraphIterator.setReuseEvents(boolean)
+ +
+isReuseEvents
++public boolean isReuseEvents()+
-
+
- Description copied from interface:
GraphIterator
+ - Tests whether the
reuseEventsflag is set. If the flag is + set totruethis 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. ++
-
+
- Specified by:
isReuseEventsin interfaceGraphIterator<V,E>
-
+
+
- Returns:
- the value of the
reuseEventsflag. - See Also:
GraphIterator.isReuseEvents()
+ +
+addTraversalListener
++public void addTraversalListener(TraversalListener<V,E> l)+
-
+
- Adds the specified traversal listener to this iterator.
+
+
-
+
- Specified by:
addTraversalListenerin interfaceGraphIterator<V,E>
-
+
- Parameters:
l- the traversal listener to be added.
+ +
+remove
++public void remove()+
-
+
- Unsupported.
+
+
-
+
- Specified by:
removein interfacejava.util.Iterator<V>- Specified by:
removein interfaceGraphIterator<V,E>
-
+
+
- Throws: +
java.lang.UnsupportedOperationException
+ +
+removeTraversalListener
++public void removeTraversalListener(TraversalListener<V,E> l)+
-
+
- Removes the specified traversal listener from this iterator.
+
+
-
+
- Specified by:
removeTraversalListenerin interfaceGraphIterator<V,E>
-
+
- Parameters:
l- the traversal listener to be removed.
+ +
+fireConnectedComponentFinished
++protected void fireConnectedComponentFinished(ConnectedComponentTraversalEvent e)+
-
+
- Informs all listeners that the traversal of the current connected
+ component finished.
+
+
-
+
-
+
- Parameters:
e- the connected component finished event.
+ +
+fireConnectedComponentStarted
++protected void fireConnectedComponentStarted(ConnectedComponentTraversalEvent e)+
-
+
- Informs all listeners that a traversal of a new connected component has
+ started.
+
+
-
+
-
+
- Parameters:
e- the connected component started event.
+ +
+fireEdgeTraversed
++protected void fireEdgeTraversed(EdgeTraversalEvent<V,E> e)+
-
+
- Informs all listeners that a the specified edge was visited.
+
+
-
+
-
+
- Parameters:
e- the edge traversal event.
+ +
+fireVertexTraversed
++protected void fireVertexTraversed(VertexTraversalEvent<V> e)+
-
+
- Informs all listeners that a the specified vertex was visited.
+
+
-
+
-
+
- Parameters:
e- the vertex traversal event.
+ +
+fireVertexFinished
++protected void fireVertexFinished(VertexTraversalEvent<V> e)+
-
+
- Informs all listeners that a the specified vertex was finished.
+
+
-
+
-
+
- Parameters:
e- the vertex traversal event.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html new file mode 100644 index 00000000..b910a3b1 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html @@ -0,0 +1,445 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Class BreadthFirstIterator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.Iterator<V>, GraphIterator<V,E> +
+
-
+
public class BreadthFirstIterator<V,E>
- extends CrossComponentIterator<V,E,java.lang.Object>
+A breadth-first iterator for a directed and an undirected graph. For this + iterator to work correctly the graph must not be modified during iteration. + Currently there are no means to ensure that, nor to fail-fast. The results of + such modifications are undefined. +
+ +
+
-
+
- Since: +
- Jul 19, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Nested Class Summary | +
|---|
| Nested classes/interfaces inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
CrossComponentIterator.VisitColor |
+
| +Field Summary | +
|---|
| Fields inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
nListeners |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+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. |
+
| Methods inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenData |
+
| Methods inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
addTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEvents |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+BreadthFirstIterator
++public BreadthFirstIterator(Graph<V,E> g)+
-
+
- Creates a new breadth-first iterator for the specified graph.
+
+
-
+
- Parameters:
g- the graph to be iterated.
+ +
+BreadthFirstIterator
++public BreadthFirstIterator(Graph<V,E> g, + V startVertex)+
-
+
- Creates a new breadth-first iterator for the specified graph. Iteration
+ will start at the specified start vertex and will be limited to the
+ connected component that includes that vertex. If the specified start
+ vertex is
null, iteration will start at an arbitrary vertex + and will not be limited, that is, will be able to traverse all the graph. ++
-
+
- Parameters:
g- the graph to be iterated.startVertex- the vertex iteration to be started.
| +Method Detail | +
|---|
+isConnectedComponentExhausted
++protected boolean isConnectedComponentExhausted()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+
+
-
+
- Specified by:
isConnectedComponentExhaustedin classCrossComponentIterator<V,E,java.lang.Object>
-
+
+
- Returns:
- true if there are no more uniterated vertices in the + currently iterated connected component; false otherwise.
- See Also:
CrossComponentIterator.isConnectedComponentExhausted()
+ +
+encounterVertex
++protected void encounterVertex(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Update data structures the first time we see a vertex.
+
+
-
+
- Specified by:
encounterVertexin classCrossComponentIterator<V,E,java.lang.Object>
-
+
- Parameters:
vertex- the vertex encounterededge- the edge via which the vertex was encountered, or null if the + vertex is a starting point- See Also:
CrossComponentIterator.encounterVertex(Object, Object)
+ +
+encounterVertexAgain
++protected void encounterVertexAgain(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Called whenever we re-encounter a vertex. The default implementation does
+ nothing.
+
+
-
+
- Specified by:
encounterVertexAgainin classCrossComponentIterator<V,E,java.lang.Object>
-
+
- Parameters:
vertex- the vertex re-encounterededge- the edge via which the vertex was re-encountered- See Also:
CrossComponentIterator.encounterVertexAgain(Object, Object)
+ +
+provideNextVertex
++protected V provideNextVertex()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns the vertex to be returned in the following call to the iterator
+
nextmethod. ++
-
+
- Specified by:
provideNextVertexin classCrossComponentIterator<V,E,java.lang.Object>
-
+
+
- Returns:
- the next vertex to be returned by this iterator.
- See Also:
CrossComponentIterator.provideNextVertex()
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html new file mode 100644 index 00000000..42815a4d --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html @@ -0,0 +1,559 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Class ClosestFirstIterator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.Iterator<V>, GraphIterator<V,E> +
+
-
+
public class ClosestFirstIterator<V,E>
- extends CrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>
+A closest-first iterator for a directed or undirected graph. For this + iterator to work correctly the graph must not be modified during iteration. + Currently there are no means to ensure that, nor to fail-fast. The results of + such modifications are undefined. + +
The metric for closest here is the path length from a start vertex. + 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.
++ +
+
-
+
- Since: +
- Sep 2, 2003 +
- Author: +
- John V. Sichi +
+ +
| +Nested Class Summary | +
|---|
| Nested classes/interfaces inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
CrossComponentIterator.VisitColor |
+
| +Field Summary | +
|---|
| Fields inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
nListeners |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+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 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. |
+
| Methods inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenData |
+
| Methods inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
addTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setReuseEvents |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+ClosestFirstIterator
++public ClosestFirstIterator(Graph<V,E> g)+
-
+
- Creates a new closest-first iterator for the specified graph.
+
+
-
+
- Parameters:
g- the graph to be iterated.
+ +
+ClosestFirstIterator
++public ClosestFirstIterator(Graph<V,E> g, + V startVertex)+
-
+
- Creates a new closest-first iterator for the specified graph. Iteration
+ will start at the specified start vertex and will be limited to the
+ connected component that includes that vertex. If the specified start
+ vertex is
null, iteration will start at an arbitrary vertex + and will not be limited, that is, will be able to traverse all the graph. ++
-
+
- Parameters:
g- the graph to be iterated.startVertex- the vertex iteration to be started.
+ +
+ClosestFirstIterator
++public ClosestFirstIterator(Graph<V,E> g, + V startVertex, + double radius)+
-
+
- Creates a new radius-bounded closest-first iterator for the specified
+ graph. Iteration will start at the specified start vertex and will be
+ limited to the subset of the connected component which includes that
+ vertex and is reachable via paths of length less than or equal to the
+ specified radius. The specified start vertex may not be
+ null. ++
-
+
- Parameters:
g- the graph to be iterated.startVertex- the vertex iteration to be started.radius- limit on path length, or Double.POSITIVE_INFINITY for + unbounded search.
| +Method Detail | +
|---|
+setCrossComponentTraversal
++public void setCrossComponentTraversal(boolean crossComponentTraversal)+
-
+
- Description copied from class:
AbstractGraphIterator
+ - Sets the cross component traversal flag - indicates whether to traverse
+ the graph across connected components.
+
+
-
+
- Overrides:
setCrossComponentTraversalin classAbstractGraphIterator<V,E>
-
+
- Parameters:
crossComponentTraversal- iftruetraverses across + connected components.
+ +
+getShortestPathLength
++public double getShortestPathLength(V vertex)+
-
+
- Get the length of the shortest path known to the given vertex. If the
+ vertex has already been visited, then it is truly the shortest path
+ length; otherwise, it is the best known upper bound.
+
+
-
+
- Parameters:
vertex- vertex being sought from start vertex +- Returns:
- length of shortest path known, or Double.POSITIVE_INFINITY if no + path found yet
+ +
+getSpanningTreeEdge
++public E getSpanningTreeEdge(V vertex)+
-
+
- Get the spanning tree edge reaching a vertex which has been seen already
+ in this traversal. This edge is the last link in the shortest known path
+ between the start vertex and the requested vertex. If the vertex has
+ already been visited, then it is truly the minimum spanning tree edge;
+ otherwise, it is the best candidate seen so far.
+
+
-
+
- Parameters:
vertex- the spanned vertex. +- Returns:
- the spanning tree edge, or null if the vertex either has not been + seen yet or is the start vertex.
+ +
+isConnectedComponentExhausted
++protected boolean isConnectedComponentExhausted()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+
+
-
+
- Specified by:
isConnectedComponentExhaustedin classCrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>
-
+
+
- Returns:
- true if there are no more uniterated vertices in the + currently iterated connected component; false otherwise.
- See Also:
CrossComponentIterator.isConnectedComponentExhausted()
+ +
+encounterVertex
++protected void encounterVertex(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Update data structures the first time we see a vertex.
+
+
-
+
- Specified by:
encounterVertexin classCrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>
-
+
- Parameters:
vertex- the vertex encounterededge- the edge via which the vertex was encountered, or null if the + vertex is a starting point- See Also:
CrossComponentIterator.encounterVertex(Object, Object)
+ +
+encounterVertexAgain
++protected void encounterVertexAgain(V vertex, + E edge)+
-
+
- Override superclass. When we see a vertex again, we need to see if the
+ new edge provides a shorter path than the old edge.
+
+
-
+
- Specified by:
encounterVertexAgainin classCrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>
-
+
- Parameters:
vertex- the vertex re-encounterededge- the edge via which the vertex was re-encountered
+ +
+provideNextVertex
++protected V provideNextVertex()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns the vertex to be returned in the following call to the iterator
+
nextmethod. ++
-
+
- Specified by:
provideNextVertexin classCrossComponentIterator<V,E,FibonacciHeapNode<org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>>
-
+
+
- Returns:
- the next vertex to be returned by this iterator.
- See Also:
CrossComponentIterator.provideNextVertex()
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/CrossComponentIterator.VisitColor.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/CrossComponentIterator.VisitColor.html new file mode 100644 index 00000000..4eb74d79 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/CrossComponentIterator.VisitColor.html @@ -0,0 +1,353 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | ++DETAIL: ENUM CONSTANTS | FIELD | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Enum CrossComponentIterator.VisitColor
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Comparable<CrossComponentIterator.VisitColor> +
-
+
- Enclosing class:
- CrossComponentIterator<V,E,D> +
+
-
+
protected static enum CrossComponentIterator.VisitColor
- extends java.lang.Enum<CrossComponentIterator.VisitColor>
+Standard vertex visit state enumeration. +
+ +
+
+ +
| +Enum Constant Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+static CrossComponentIterator.VisitColor |
+valueOf(java.lang.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. |
+
| Methods inherited from class java.lang.Enum | +
|---|
clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf |
+
| Methods inherited from class java.lang.Object | +
|---|
getClass, notify, notifyAll, wait, wait, wait |
+
| +Enum Constant Detail | +
|---|
+WHITE
++public static final CrossComponentIterator.VisitColor WHITE+
-
+
- Vertex has not been returned via iterator yet.
+
+
-
+
+ +
+GRAY
++public static final CrossComponentIterator.VisitColor GRAY+
-
+
- Vertex has been returned via iterator, but we're not done with all of
+ its out-edges yet.
+
+
-
+
+ +
+BLACK
++public static final CrossComponentIterator.VisitColor BLACK+
-
+
- Vertex has been returned via iterator, and we're done with all of its
+ out-edges.
+
+
-
+
| +Method Detail | +
|---|
+values
++public static CrossComponentIterator.VisitColor[] values()+
-
+
- Returns an array containing the constants of this enum type, in
+the order they are declared. This method may be used to iterate
+over the constants as follows:
+
+for (CrossComponentIterator.VisitColor c : CrossComponentIterator.VisitColor.values()) + System.out.println(c); +
++
-
+
+
- Returns:
- an array containing the constants of this enum type, in +the order they are declared
+ +
+valueOf
++public static CrossComponentIterator.VisitColor valueOf(java.lang.String name)+
-
+
- Returns the enum constant of this type with the specified name.
+The string must match exactly an identifier used to declare an
+enum constant in this type. (Extraneous whitespace characters are
+not permitted.)
+
+
-
+
- Parameters:
name- the name of the enum constant to be returned. +- Returns:
- the enum constant with the specified name +
- Throws: +
java.lang.IllegalArgumentException- if this enum type has no constant +with the specified name +java.lang.NullPointerException- if the argument is null
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | ++DETAIL: ENUM CONSTANTS | FIELD | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/CrossComponentIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/CrossComponentIterator.html new file mode 100644 index 00000000..5d2d9b59 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/CrossComponentIterator.html @@ -0,0 +1,558 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Class CrossComponentIterator<V,E,D>
++java.lang.Object ++
-
+
- Type Parameters:
V- vertex typeE- edge typeD- type of data associated to seen vertices
-
+
- All Implemented Interfaces:
- java.util.Iterator<V>, GraphIterator<V,E> +
-
+
- Direct Known Subclasses:
- BreadthFirstIterator, ClosestFirstIterator, DepthFirstIterator, TopologicalOrderIterator +
+
-
+
public abstract class CrossComponentIterator<V,E,D>
- extends AbstractGraphIterator<V,E>
+Provides a cross-connected-component traversal functionality for iterator + subclasses. +
+ +
+
-
+
- Since: +
- Jan 31, 2004 +
- Author: +
- Barak Naveh +
+ +
| +Nested Class Summary | +|
|---|---|
+protected static class |
+CrossComponentIterator.VisitColor
+
++ Standard vertex visit state enumeration. |
+
| +Field Summary | +
|---|
| Fields inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
nListeners |
+
| +Constructor Summary | +|
|---|---|
CrossComponentIterator(Graph<V,E> g,
+ V startVertex)
+
++ Creates a new iterator for the specified graph. |
+|
| +Method Summary | +|
|---|---|
+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(java.lang.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. |
+
| Methods inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
addTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEvents |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+CrossComponentIterator
++public CrossComponentIterator(Graph<V,E> g, + V startVertex)+
-
+
- Creates a new iterator for the specified graph. Iteration will start at
+ the specified start vertex. If the specified start vertex is
+ null, Iteration will start at an arbitrary graph vertex. ++
-
+
- Parameters:
g- the graph to be iterated.startVertex- the vertex iteration to be started. +- Throws: +
java.lang.IllegalArgumentException- ifg==nullor does not + containstartVertex
| +Method Detail | +
|---|
+getGraph
++public Graph<V,E> getGraph()+
-
+
-
+
+
- Returns:
- the graph being traversed
+
+ +
+hasNext
++public boolean hasNext()+
-
+
-
+
- See Also:
Iterator.hasNext()
+
+ +
+next
++public V next()+
-
+
-
+
- See Also:
Iterator.next()
+
+ +
+isConnectedComponentExhausted
++protected abstract boolean isConnectedComponentExhausted()+
-
+
- Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+
+
-
+
+
- Returns:
- true if there are no more uniterated vertices in the + currently iterated connected component; false otherwise.
+ +
+encounterVertex
++protected abstract void encounterVertex(V vertex, + E edge)+
-
+
- Update data structures the first time we see a vertex.
+
+
-
+
- Parameters:
vertex- the vertex encounterededge- the edge via which the vertex was encountered, or null if the + vertex is a starting point
+ +
+provideNextVertex
++protected abstract V provideNextVertex()+
-
+
- Returns the vertex to be returned in the following call to the iterator
+
nextmethod. ++
-
+
+
- Returns:
- the next vertex to be returned by this iterator.
+ +
+getSeenData
++protected D getSeenData(V vertex)+
-
+
- Access the data stored for a seen vertex.
+
+
-
+
- Parameters:
vertex- a vertex which has already been seen. +- Returns:
- data associated with the seen vertex or
nullif no + data was associated with the vertex. Anullreturn can also + indicate that the vertex was explicitly associated with+ null.
+ +
+isSeenVertex
++protected boolean isSeenVertex(java.lang.Object vertex)+
-
+
- Determines whether a vertex has been seen yet by this traversal.
+
+
-
+
- Parameters:
vertex- vertex in question +- Returns:
- true if vertex has already been seen
+ +
+encounterVertexAgain
++protected abstract void encounterVertexAgain(V vertex, + E edge)+
-
+
- Called whenever we re-encounter a vertex. The default implementation does
+ nothing.
+
+
-
+
- Parameters:
vertex- the vertex re-encounterededge- the edge via which the vertex was re-encountered
+ +
+putSeenData
++protected D putSeenData(V vertex, + D data)+
-
+
- Stores iterator-dependent data for a vertex that has been seen.
+
+
-
+
- Parameters:
vertex- a vertex which has been seen.data- data to be associated with the seen vertex. +- Returns:
- previous value associated with specified vertex or
+ nullif no data was associated with the vertex. A+ nullreturn can also indicate that the vertex was explicitly + associated withnull.
+ +
+finishVertex
++protected void finishVertex(V vertex)+
-
+
- Called when a vertex has been finished (meaning is dependent on traversal
+ represented by subclass).
+
+
-
+
- Parameters:
vertex- vertex which has been finished
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/DepthFirstIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/DepthFirstIterator.html new file mode 100644 index 00000000..dde69842 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/DepthFirstIterator.html @@ -0,0 +1,503 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Class DepthFirstIterator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.Iterator<V>, GraphIterator<V,E> +
+
-
+
public class DepthFirstIterator<V,E>
- extends CrossComponentIterator<V,E,CrossComponentIterator.VisitColor>
+A depth-first iterator for a directed and an undirected graph. For this + iterator to work correctly the graph must not be modified during iteration. + Currently there are no means to ensure that, nor to fail-fast. The results of + such modifications are undefined. +
+ +
+
-
+
- Since: +
- Jul 29, 2003 +
- Author: +
- Liviu Rau, Barak Naveh +
+ +
| +Nested Class Summary | +
|---|
| Nested classes/interfaces inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
CrossComponentIterator.VisitColor |
+
| +Field Summary | +|
|---|---|
+static java.lang.Object |
+SENTINEL
+
++ Sentinel object. |
+
| Fields inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
nListeners |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+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. |
+
+ java.util.Deque<java.lang.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. |
+
| Methods inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenData |
+
| Methods inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
addTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEvents |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Field Detail | +
|---|
+SENTINEL
++public static final java.lang.Object SENTINEL+
-
+
- Sentinel object. Unfortunately, we can't use null, because ArrayDeque
+ won't accept those. And we don't want to rely on the caller to provide a
+ sentinel object for us. So we have to play typecasting games.
+
+
-
+
| +Constructor Detail | +
|---|
+DepthFirstIterator
++public DepthFirstIterator(Graph<V,E> g)+
-
+
- Creates a new depth-first iterator for the specified graph.
+
+
-
+
- Parameters:
g- the graph to be iterated.
+ +
+DepthFirstIterator
++public DepthFirstIterator(Graph<V,E> g, + V startVertex)+
-
+
- Creates a new depth-first iterator for the specified graph. Iteration
+ will start at the specified start vertex and will be limited to the
+ connected component that includes that vertex. If the specified start
+ vertex is
null, iteration will start at an arbitrary vertex + and will not be limited, that is, will be able to traverse all the graph. ++
-
+
- Parameters:
g- the graph to be iterated.startVertex- the vertex iteration to be started.
| +Method Detail | +
|---|
+isConnectedComponentExhausted
++protected boolean isConnectedComponentExhausted()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+
+
-
+
- Specified by:
isConnectedComponentExhaustedin classCrossComponentIterator<V,E,CrossComponentIterator.VisitColor>
-
+
+
- Returns:
- true if there are no more uniterated vertices in the + currently iterated connected component; false otherwise.
- See Also:
CrossComponentIterator.isConnectedComponentExhausted()
+ +
+encounterVertex
++protected void encounterVertex(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Update data structures the first time we see a vertex.
+
+
-
+
- Specified by:
encounterVertexin classCrossComponentIterator<V,E,CrossComponentIterator.VisitColor>
-
+
- Parameters:
vertex- the vertex encounterededge- the edge via which the vertex was encountered, or null if the + vertex is a starting point- See Also:
CrossComponentIterator.encounterVertex(Object, Object)
+ +
+encounterVertexAgain
++protected void encounterVertexAgain(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Called whenever we re-encounter a vertex. The default implementation does
+ nothing.
+
+
-
+
- Specified by:
encounterVertexAgainin classCrossComponentIterator<V,E,CrossComponentIterator.VisitColor>
-
+
- Parameters:
vertex- the vertex re-encounterededge- the edge via which the vertex was re-encountered- See Also:
CrossComponentIterator.encounterVertexAgain(Object, Object)
+ +
+provideNextVertex
++protected V provideNextVertex()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns the vertex to be returned in the following call to the iterator
+
nextmethod. ++
-
+
- Specified by:
provideNextVertexin classCrossComponentIterator<V,E,CrossComponentIterator.VisitColor>
-
+
+
- Returns:
- the next vertex to be returned by this iterator.
- See Also:
CrossComponentIterator.provideNextVertex()
+ +
+getStack
++public java.util.Deque<java.lang.Object> getStack()+
-
+
- Retrieves the LIFO stack of vertices which have been encountered but not
+ yet visited (WHITE). This stack also contains sentinel entries
+ representing vertices which have been visited but are still GRAY. A
+ sentinel entry is a sequence (v, SENTINEL), whereas a non-sentinel entry
+ is just (v).
+
+
-
+
+
- Returns:
- stack
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/GraphIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/GraphIterator.html new file mode 100644 index 00000000..11ea06b8 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/GraphIterator.html @@ -0,0 +1,370 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Interface GraphIterator<V,E>
+-
+
- All Superinterfaces:
- java.util.Iterator<V> +
-
+
- All Known Implementing Classes:
- AbstractGraphIterator, BreadthFirstIterator, ClosestFirstIterator, CrossComponentIterator, DepthFirstIterator, TopologicalOrderIterator +
+
-
+
public interface GraphIterator<V,E>
- extends java.util.Iterator<V>
+A graph iterator. +
+ +
+
-
+
- Since: +
- Jul 31, 2003 +
- Author: +
- Barak Naveh +
+ +
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from interface java.util.Iterator | +
|---|
hasNext, next |
+
| +Method Detail | +
|---|
+isCrossComponentTraversal
++boolean isCrossComponentTraversal()+
-
+
- Test whether this iterator is set to traverse the grpah across connected
+ components.
+
+
-
+
-
+
+
- Returns:
trueif traverses across connected components, + otherwisefalse.
+ +
+setReuseEvents
++void setReuseEvents(boolean reuseEvents)+
-
+
- Sets a value the
reuseEventsflag. If the+ reuseEventsflag is set totruethis 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. ++
-
+
-
+
- Parameters:
reuseEvents- whether to reuse previously fired event objects + instead of creating a new event object for each event.
+ +
+isReuseEvents
++boolean isReuseEvents()+
-
+
- Tests whether the
reuseEventsflag is set. If the flag is + set totruethis 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. ++
-
+
-
+
+
- Returns:
- the value of the
reuseEventsflag.
+ +
+addTraversalListener
++void addTraversalListener(TraversalListener<V,E> l)+
-
+
- Adds the specified traversal listener to this iterator.
+
+
-
+
-
+
- Parameters:
l- the traversal listener to be added.
+ +
+remove
++void remove()+
-
+
- Unsupported.
+
+
-
+
- Specified by:
removein interfacejava.util.Iterator<V>
-
+
+
- Throws: +
java.lang.UnsupportedOperationException
+ +
+removeTraversalListener
++void removeTraversalListener(TraversalListener<V,E> l)+
-
+
- Removes the specified traversal listener from this iterator.
+
+
-
+
-
+
- Parameters:
l- the traversal listener to be removed.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/TopologicalOrderIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/TopologicalOrderIterator.html new file mode 100644 index 00000000..9e443d5a --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/TopologicalOrderIterator.html @@ -0,0 +1,471 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.traverse
+
+Class TopologicalOrderIterator<V,E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.Iterator<V>, GraphIterator<V,E> +
+
-
+
public class TopologicalOrderIterator<V,E>
- extends CrossComponentIterator<V,E,java.lang.Object>
+Implements topological order traversal for a directed acyclic graph. A + topological sort is a permutation p of the vertices of a graph such + that an edge (i,j) implies that i appears before j + in p (Skiena 1990, p. 208). See also + http://mathworld.wolfram.com/TopologicalSort.html. + +
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 StrongConnectivityInspector.
+ +
+
-
+
- Since: +
- Dec 18, 2004 +
- Author: +
- Marden Neubert +
+ +
| +Nested Class Summary | +
|---|
| Nested classes/interfaces inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
CrossComponentIterator.VisitColor |
+
| +Field Summary | +
|---|
| Fields inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
nListeners |
+
| +Constructor Summary | +|
|---|---|
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,
+ java.util.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. |
+|
| +Method Summary | +|
|---|---|
+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. |
+
| Methods inherited from class org.jgrapht.traverse.CrossComponentIterator | +
|---|
finishVertex, getGraph, getSeenData, hasNext, isSeenVertex, next, putSeenData |
+
| Methods inherited from class org.jgrapht.traverse.AbstractGraphIterator | +
|---|
addTraversalListener, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEvents |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+TopologicalOrderIterator
++public 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.
+ Traversal will start at one of the graph's sources. See the
+ definition of source at
+ http://mathworld.wolfram.com/Source.html.
+
+
-
+
- Parameters:
dg- the directed graph to be iterated.
+ +
+TopologicalOrderIterator
++public TopologicalOrderIterator(DirectedGraph<V,E> dg, + java.util.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. Traversal will start
+ at one of the graph's sources. See the definition of source at
+ http://mathworld.wolfram.com/Source.html.
+
+
-
+
- Parameters:
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 empty
| +Method Detail | +
|---|
+isConnectedComponentExhausted
++protected boolean isConnectedComponentExhausted()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns true if there are no more uniterated vertices in the
+ currently iterated connected component; false otherwise.
+
+
-
+
- Specified by:
isConnectedComponentExhaustedin classCrossComponentIterator<V,E,java.lang.Object>
-
+
+
- Returns:
- true if there are no more uniterated vertices in the + currently iterated connected component; false otherwise.
- See Also:
CrossComponentIterator.isConnectedComponentExhausted()
+ +
+encounterVertex
++protected void encounterVertex(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Update data structures the first time we see a vertex.
+
+
-
+
- Specified by:
encounterVertexin classCrossComponentIterator<V,E,java.lang.Object>
-
+
- Parameters:
vertex- the vertex encounterededge- the edge via which the vertex was encountered, or null if the + vertex is a starting point- See Also:
CrossComponentIterator.encounterVertex(Object, Object)
+ +
+encounterVertexAgain
++protected void encounterVertexAgain(V vertex, + E edge)+
-
+
- Description copied from class:
CrossComponentIterator
+ - Called whenever we re-encounter a vertex. The default implementation does
+ nothing.
+
+
-
+
- Specified by:
encounterVertexAgainin classCrossComponentIterator<V,E,java.lang.Object>
-
+
- Parameters:
vertex- the vertex re-encounterededge- the edge via which the vertex was re-encountered- See Also:
CrossComponentIterator.encounterVertexAgain(Object, Object)
+ +
+provideNextVertex
++protected V provideNextVertex()+
-
+
- Description copied from class:
CrossComponentIterator
+ - Returns the vertex to be returned in the following call to the iterator
+
nextmethod. ++
-
+
- Specified by:
provideNextVertexin classCrossComponentIterator<V,E,java.lang.Object>
-
+
+
- Returns:
- the next vertex to be returned by this iterator.
- See Also:
CrossComponentIterator.provideNextVertex()
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/package-frame.html new file mode 100644 index 00000000..de81ab0f --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/package-frame.html @@ -0,0 +1,64 @@ + + + + + +
|
+Interfaces
+
+ +GraphIterator |
+
|
+Classes
+
+ +AbstractGraphIterator + +BreadthFirstIterator + +ClosestFirstIterator + +CrossComponentIterator + +DepthFirstIterator + +TopologicalOrderIterator |
+
|
+Enums
+
+ +CrossComponentIterator.VisitColor |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.traverse +
+Graph traversal means. +
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| GraphIterator<V,E> | +A graph iterator. | +
+ +
| +Class Summary | +|
|---|---|
| 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 Summary | +|
|---|---|
| CrossComponentIterator.VisitColor | +Standard vertex visit state enumeration. | +
+Package org.jgrapht.traverse Description +
+ ++Graph traversal means. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/package-tree.html new file mode 100644 index 00000000..5cde3527 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/traverse/package-tree.html @@ -0,0 +1,173 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.traverse +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- org.jgrapht.traverse.AbstractGraphIterator<V,E> (implements org.jgrapht.traverse.GraphIterator<V,E>)
+
-
+
- org.jgrapht.traverse.CrossComponentIterator<V,E,D>
-
+
- org.jgrapht.traverse.BreadthFirstIterator<V,E>
- org.jgrapht.traverse.ClosestFirstIterator<V,E>
- org.jgrapht.traverse.DepthFirstIterator<V,E>
- org.jgrapht.traverse.TopologicalOrderIterator<V,E>
- org.jgrapht.traverse.CrossComponentIterator<V,E,D>
- org.jgrapht.traverse.AbstractGraphIterator<V,E> (implements org.jgrapht.traverse.GraphIterator<V,E>)
+
+Interface Hierarchy +
+-
+
- java.util.Iterator<E>
-
+
- org.jgrapht.traverse.GraphIterator<V,E>
+Enum Hierarchy +
+-
+
- java.lang.Object
-
+
- java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable)
+
-
+
- org.jgrapht.traverse.CrossComponentIterator.VisitColor
- java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable)
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/ArrayUnenforcedSet.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/ArrayUnenforcedSet.html new file mode 100644 index 00000000..46418720 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/ArrayUnenforcedSet.html @@ -0,0 +1,386 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class ArrayUnenforcedSet<E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<E>, java.util.Collection<E>, java.util.List<E>, java.util.RandomAccess, java.util.Set<E> +
+
-
+
public class ArrayUnenforcedSet<E>
- extends java.util.ArrayList<E>
- implements java.util.Set<E>
- extends java.util.ArrayList<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. Use with caution. + +
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. +
+ +
+
-
+
- Author: +
- John V. Sichi +
- See Also:
- Serialized Form
+ +
| +Field Summary | +
|---|
| Fields inherited from class java.util.AbstractList | +
|---|
modCount |
+
| +Constructor Summary | +|
|---|---|
ArrayUnenforcedSet()
+
++ |
+|
ArrayUnenforcedSet(java.util.Collection<? extends E> c)
+
++ |
+|
ArrayUnenforcedSet(int n)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ boolean |
+equals(java.lang.Object o)
+
++ |
+
+ int |
+hashCode()
+
++ |
+
| Methods inherited from class java.util.ArrayList | +
|---|
add, add, addAll, addAll, clear, clone, contains, ensureCapacity, get, indexOf, isEmpty, lastIndexOf, remove, remove, removeRange, set, size, toArray, toArray, trimToSize |
+
| Methods inherited from class java.util.AbstractList | +
|---|
iterator, listIterator, listIterator, subList |
+
| Methods inherited from class java.util.AbstractCollection | +
|---|
containsAll, removeAll, retainAll, toString |
+
| Methods inherited from class java.lang.Object | +
|---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
+
| Methods inherited from interface java.util.Set | +
|---|
add, addAll, clear, contains, containsAll, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArray |
+
| Methods inherited from interface java.util.List | +
|---|
containsAll, iterator, listIterator, listIterator, removeAll, retainAll, subList |
+
| +Constructor Detail | +
|---|
+ArrayUnenforcedSet
++public ArrayUnenforcedSet()+
-
+
+ +
+ArrayUnenforcedSet
++public ArrayUnenforcedSet(java.util.Collection<? extends E> c)+
-
+
+ +
+ArrayUnenforcedSet
++public ArrayUnenforcedSet(int n)+
-
+
| +Method Detail | +
|---|
+equals
++public boolean equals(java.lang.Object o)+
-
+
- + +
-
+
+
+ +
+hashCode
++public int hashCode()+
-
+
- + +
-
+
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/FibonacciHeap.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/FibonacciHeap.html new file mode 100644 index 00000000..8b7bd15c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/FibonacciHeap.html @@ -0,0 +1,616 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class FibonacciHeap<T>
++java.lang.Object ++
+
-
+
public class FibonacciHeap<T>
- extends java.lang.Object
+This class implements a Fibonacci heap data structure. Much of the code in
+ this class is based on the algorithms in the "Introduction to Algorithms"by
+ Cormen, Leiserson, and Rivest in Chapter 21. The amortized running time of
+ most of these methods is O(1), making it a very fast data structure. Several
+ have an actual running time of O(1). removeMin() and delete() have O(log n)
+ amortized running times because they do the heap consolidation. If you
+ attempt to store nodes in this heap with key values of -Infinity
+ (Double.NEGATIVE_INFINITY) the 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.
++ +
+
-
+
- Author: +
- Nathan Fiedler +
+ +
| +Constructor Summary | +|
|---|---|
FibonacciHeap()
+
++ Constructs a FibonacciHeap object that contains no elements. |
+|
| +Method Summary | +||
|---|---|---|
+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. |
+|
+ java.lang.String |
+toString()
+
++ Creates a String representation of this Fibonacci heap. |
+|
+static
+ |
+union(FibonacciHeap<T> h1,
+ FibonacciHeap<T> h2)
+
++ Joins two Fibonacci heaps into a new one. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+FibonacciHeap
++public FibonacciHeap()+
-
+
- Constructs a FibonacciHeap object that contains no elements.
+
+
| +Method Detail | +
|---|
+isEmpty
++public boolean isEmpty()+
-
+
- Tests if the Fibonacci heap is empty or not. Returns true if the heap is
+ empty, false otherwise.
+
+
Running time: O(1) actual
++
-
+
+
- Returns:
- true if the heap is empty, false otherwise
+ +
+clear
++public void clear()+
-
+
- Removes all elements from this heap.
+
+
-
+
+ +
+decreaseKey
++public void decreaseKey(FibonacciHeapNode<T> x, + double k)+
-
+
- Decreases the key value for a heap node, given the new value to take on.
+ The structure of the heap may be changed and will not be consolidated.
+
+
Running time: O(1) amortized
++
-
+
- Parameters:
x- node to decrease the key ofk- new key value for node x +- Throws: +
java.lang.IllegalArgumentException- Thrown if k is larger than x.key + value.
+ +
+delete
++public void delete(FibonacciHeapNode<T> x)+
-
+
- Deletes a node from the heap given the reference to the node. The trees
+ in the heap will be consolidated, if necessary. This operation may fail
+ to remove the correct element if there are nodes with key value
+ -Infinity.
+
+
Running time: O(log n) amortized
++
-
+
- Parameters:
x- node to remove from heap
+ +
+insert
++public void insert(FibonacciHeapNode<T> node, + double key)+
-
+
- Inserts a new data element into the heap. No heap consolidation is
+ performed at this time, the new node is simply inserted into the root
+ list of this heap.
+
+
Running time: O(1) actual
++
-
+
- Parameters:
node- new node to insert into heapkey- key value associated with data object
+ +
+min
++public FibonacciHeapNode<T> min()+
-
+
- Returns the smallest element in the heap. This smallest element is the
+ one with the minimum key value.
+
+
Running time: O(1) actual
++
-
+
+
- Returns:
- heap node with the smallest key
+ +
+removeMin
++public FibonacciHeapNode<T> removeMin()+
-
+
- Removes the smallest element from the heap. This will cause the trees in
+ the heap to be consolidated, if necessary.
+
+
Running time: O(log n) amortized
++
-
+
+
- Returns:
- node with the smallest key
+ +
+size
++public int size()+
-
+
- Returns the size of the heap which is measured in the number of elements
+ contained in the heap.
+
+
Running time: O(1) actual
++
-
+
+
- Returns:
- number of elements in the heap
+ +
+union
++public static <T> FibonacciHeap<T> union(FibonacciHeap<T> h1, + FibonacciHeap<T> h2)+
-
+
- Joins two Fibonacci heaps into a new one. No heap consolidation is
+ performed at this time. The two root lists are simply joined together.
+
+
Running time: O(1) actual
++
-
+
- Parameters:
h1- first heaph2- second heap +- Returns:
- new heap containing h1 and h2
+ +
+toString
++public java.lang.String toString()+
-
+
- Creates a String representation of this Fibonacci heap.
+
+
-
+
- Overrides:
toStringin classjava.lang.Object
-
+
+
- Returns:
- String of this.
+ +
+cascadingCut
++protected void cascadingCut(FibonacciHeapNode<T> y)+
-
+
- Performs a cascading cut operation. This cuts y from its parent and then
+ does the same for its parent, and so on up the tree.
+
+
Running time: O(log n); O(1) excluding the recursion
++
-
+
- Parameters:
y- node to perform cascading cut on
+ +
+consolidate
++protected void consolidate()+
-
+
-
+
+
+ +
+cut
++protected void cut(FibonacciHeapNode<T> x, + FibonacciHeapNode<T> y)+
-
+
- The reverse of the link operation: removes x from the child list of y.
+ This method assumes that min is non-null.
+
+
Running time: O(1)
++
-
+
- Parameters:
x- child of y to be removed from y's child listy- parent of x about to lose a child
+ +
+link
++protected void link(FibonacciHeapNode<T> y, + FibonacciHeapNode<T> x)+
-
+
- Make node y a child of node x.
+
+
Running time: O(1) actual
++
-
+
- Parameters:
y- node to become childx- node to become parent
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/FibonacciHeapNode.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/FibonacciHeapNode.html new file mode 100644 index 00000000..856f36fb --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/FibonacciHeapNode.html @@ -0,0 +1,316 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class FibonacciHeapNode<T>
++java.lang.Object ++
+
-
+
public class FibonacciHeapNode<T>
- extends java.lang.Object
+Implements a node of the Fibonacci heap. It holds the information necessary + for maintaining the structure of the heap. It also holds the reference to the + key value (which is used to determine the heap structure). +
+ +
+
-
+
- Author: +
- Nathan Fiedler +
+ +
| +Constructor Summary | +|
|---|---|
FibonacciHeapNode(T data,
+ double key)
+
++ Default constructor. |
+|
| +Method Summary | +|
|---|---|
+ T |
+getData()
+
++ Obtain the data for this node. |
+
+ double |
+getKey()
+
++ Obtain the key for this node. |
+
+ java.lang.String |
+toString()
+
++ Return the string representation of this object. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+FibonacciHeapNode
++public FibonacciHeapNode(T data, + double key)+
-
+
- Default constructor. Initializes the right and left pointers, making this
+ a circular doubly-linked list.
+
+
-
+
- Parameters:
data- data for this nodekey- initial key for node
| +Method Detail | +
|---|
+getKey
++public final double getKey()+
-
+
- Obtain the key for this node.
+
+
-
+
+
- Returns:
- the key
+ +
+getData
++public final T getData()+
-
+
- Obtain the data for this node.
+
+
-
+
+ +
+toString
++public java.lang.String toString()+
-
+
- Return the string representation of this object.
+
+
-
+
- Overrides:
toStringin classjava.lang.Object
-
+
+
- Returns:
- string representing this object
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/MathUtil.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/MathUtil.html new file mode 100644 index 00000000..85bfe19e --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/MathUtil.html @@ -0,0 +1,261 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class MathUtil
++java.lang.Object ++
+
-
+
public class MathUtil
- extends java.lang.Object
+Math Utilities. Currently contains the following: +
+ +
+
-
+
- Since: +
- May 30, 2005 +
- Author: +
- Assaf +
+ +
| +Constructor Summary | +|
|---|---|
MathUtil()
+
++ |
+|
| +Method Summary | +|
|---|---|
+static long |
+factorial(int N)
+
++ |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+MathUtil
++public MathUtil()+
-
+
| +Method Detail | +
|---|
+factorial
++public static long factorial(int N)+
-
+
-
+
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/ModifiableInteger.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/ModifiableInteger.html new file mode 100644 index 00000000..075ab756 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/ModifiableInteger.html @@ -0,0 +1,705 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class ModifiableInteger
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Comparable +
+
-
+
public class ModifiableInteger
- extends java.lang.Number
- implements java.lang.Comparable
- extends java.lang.Number
+The 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.
+ +
+
-
+
- Since: +
- May 27, 2004 +
- Author: +
- Barak Naveh +
- See Also:
- Serialized Form
+ +
| +Field Summary | +|
|---|---|
+ int |
+value
+
++ The int value represented by this ModifiableInteger. |
+
| +Constructor Summary | +|
|---|---|
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. |
+|
| +Method Summary | +|
|---|---|
+ int |
+compareTo(ModifiableInteger anotherInteger)
+
++ Compares two ModifiableInteger objects numerically. |
+
+ int |
+compareTo(java.lang.Object o)
+
++ Compares this ModifiableInteger object to another object. |
+
+ void |
+decrement()
+
++ Subtracts one from the value of this modifiable integer. |
+
+ double |
+doubleValue()
+
++ |
+
+ boolean |
+equals(java.lang.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. |
+
+ java.lang.Integer |
+toInteger()
+
++ Returns an Integer object representing this
+ ModifiableInteger's value. |
+
+ java.lang.String |
+toString()
+
++ Returns a String object representing this
+ ModifiableInteger's value. |
+
| Methods inherited from class java.lang.Number | +
|---|
byteValue, shortValue |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
+
| +Field Detail | +
|---|
+value
++public int value+
-
+
- The int value represented by this
ModifiableInteger. ++
-
+
| +Constructor Detail | +
|---|
+ModifiableInteger
++@Deprecated +public ModifiableInteger()+
-
+
- Deprecated. not really deprecated, just marked so to avoid mistaken use.
+
+
- !!! DON'T USE - Use the
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.
++
- !!! DON'T USE - Use the
+ +
+ModifiableInteger
++public ModifiableInteger(int value)+
-
+
- Constructs a newly allocated
ModifiableIntegerobject that + represents the specifiedintvalue. ++
-
+
- Parameters:
value- the value to be represented by the+ ModifiableIntegerobject.
| +Method Detail | +
|---|
+setValue
++public void setValue(int value)+
-
+
- Sets a new value for this modifiable integer.
+
+
-
+
-
+
- Parameters:
value- the new value to set.
+ +
+getValue
++public int getValue()+
-
+
- Returns the value of this object, similarly to
intValue(). This + getter is NOT redundant. It is used for serialization by + java.beans.XMLEncoder. ++
-
+
-
+
+
- Returns:
- the value.
+ +
+increment
++public void increment()+
-
+
- Adds one to the value of this modifiable integer.
+
+
-
+
-
+
+ +
+decrement
++public void decrement()+
-
+
- Subtracts one from the value of this modifiable integer.
+
+
-
+
-
+
+ +
+compareTo
++public int compareTo(ModifiableInteger anotherInteger)+
-
+
- Compares two
ModifiableIntegerobjects numerically. ++
-
+
-
+
- Parameters:
anotherInteger- theModifiableIntegerto be compared. +- Returns:
- the value
0if thisModifiableInteger+ is equal to the argumentModifiableInteger; a value less + than0if thisModifiableIntegeris numerically + less than the argumentModifiableInteger; and a value + greater than0if thisModifiableIntegeris + numerically greater than the argumentModifiableInteger+ (signed comparison).
+ +
+compareTo
++public int compareTo(java.lang.Object o)+
-
+
- Compares this
ModifiableIntegerobject to another object. If + the object is anModifiableInteger, this function behaves + likecompareTo(Integer). Otherwise, it throws a+ ClassCastException(asModifiableIntegerobjects are + only comparable to otherModifiableIntegerobjects). ++
-
+
- Specified by:
compareToin interfacejava.lang.Comparable
-
+
- Parameters:
o- theObjectto be compared. +- Returns:
- the value
0if the argument is a+ ModifiableIntegernumerically equal to this+ ModifiableInteger; a value less than0if the + argument is aModifiableIntegernumerically greater than + thisModifiableInteger; and a value greater than+ 0if the argument is aModifiableIntegernumerically + less than thisModifiableInteger. - See Also:
Comparable.compareTo(java.lang.Object)
+ +
+doubleValue
++public double doubleValue()+
-
+
-
+
- Specified by:
doubleValuein classjava.lang.Number
+-
+
- See Also:
Number.doubleValue()
+
+ +
+equals
++public boolean equals(java.lang.Object o)+
-
+
- Compares this object to the specified object. The result is
+ trueif and only if the argument is notnulland is + anModifiableIntegerobject that contains the same+ intvalue as this object. ++
-
+
- Overrides:
equalsin classjava.lang.Object
-
+
- Parameters:
o- the object to compare with. +- Returns:
trueif the objects are the same;false+ otherwise.
+ +
+floatValue
++public float floatValue()+
-
+
-
+
- Specified by:
floatValuein classjava.lang.Number
+-
+
- See Also:
Number.floatValue()
+
+ +
+hashCode
++public int hashCode()+
-
+
- Returns a hash code for this
ModifiableInteger. ++
-
+
- Overrides:
hashCodein classjava.lang.Object
-
+
+
- Returns:
- a hash code value for this object, equal to the primitive
+ intvalue represented by thisModifiableInteger+ object.
+ +
+intValue
++public int intValue()+
-
+
-
+
- Specified by:
intValuein classjava.lang.Number
+-
+
- See Also:
Number.intValue()
+
+ +
+longValue
++public long longValue()+
-
+
-
+
- Specified by:
longValuein classjava.lang.Number
+-
+
- See Also:
Number.longValue()
+
+ +
+toInteger
++public java.lang.Integer toInteger()+
-
+
- Returns an
Integerobject representing this+ ModifiableInteger's value. ++
-
+
-
+
+
- Returns:
- an
Integerrepresentation of the value of this + object.
+ +
+toString
++public java.lang.String toString()+
-
+
- Returns a
Stringobject 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 theInteger.toString(int)method. ++
-
+
- Overrides:
toStringin classjava.lang.Object
-
+
+
- Returns:
- a string representation of the value of this object in + base 10.
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/PrefetchIterator.NextElementFunctor.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/PrefetchIterator.NextElementFunctor.html new file mode 100644 index 00000000..9f1d171c --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/PrefetchIterator.NextElementFunctor.html @@ -0,0 +1,214 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Interface PrefetchIterator.NextElementFunctor<EE>
+-
+
- Enclosing class:
- PrefetchIterator<E> +
+
-
+
public static interface PrefetchIterator.NextElementFunctor<EE>
+
+ +
| +Method Summary | +|
|---|---|
+ EE |
+nextElement()
+
++ You must implement that NoSuchElementException is thrown on + nextElement() if it is out of bound. |
+
| +Method Detail | +
|---|
+nextElement
++EE nextElement() + throws java.util.NoSuchElementException+
-
+
- You must implement that NoSuchElementException is thrown on
+ nextElement() if it is out of bound.
+
+
-
+
+
- Throws: +
java.util.NoSuchElementException
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/PrefetchIterator.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/PrefetchIterator.html new file mode 100644 index 00000000..4237160a --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/PrefetchIterator.html @@ -0,0 +1,450 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class PrefetchIterator<E>
++java.lang.Object ++
-
+
- All Implemented Interfaces:
- java.util.Enumeration<E>, java.util.Iterator<E> +
+
-
+
public class PrefetchIterator<E>
- extends java.lang.Object
- implements java.util.Iterator<E>, java.util.Enumeration<E>
- extends java.lang.Object
+Utility class to help implement an iterator/enumerator in which the hasNext() + method needs to calculate the next elements ahead of time. + +
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();
+ }
+ }+ +
+
-
+
- Author: +
- Assaf_Lehr +
+ +
| +Nested Class Summary | +|
|---|---|
+static interface |
+PrefetchIterator.NextElementFunctor<EE>
+
++ |
+
| +Constructor Summary | +|
|---|---|
PrefetchIterator(PrefetchIterator.NextElementFunctor<E> aEnum)
+
++ |
+|
| +Method Summary | +|
|---|---|
+ 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. |
+
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+PrefetchIterator
++public PrefetchIterator(PrefetchIterator.NextElementFunctor<E> aEnum)+
-
+
| +Method Detail | +
|---|
+nextElement
++public E nextElement()+
-
+
- 1. Retrieves the saved value or calculates it if it does not exist 2.
+ Changes isGetNextLastResultUpToDate to false. (Because it does not save
+ the NEXT element now; it saves the current one!)
+
+
-
+
- Specified by:
nextElementin interfacejava.util.Enumeration<E>
-
+
+ +
+hasMoreElements
++public boolean hasMoreElements()+
-
+
- If (isGetNextLastResultUpToDate==true) returns true else 1. calculates
+ getNext() and saves it 2. sets isGetNextLastResultUpToDate to true.
+
+
-
+
- Specified by:
hasMoreElementsin interfacejava.util.Enumeration<E>
-
+
+ +
+isEnumerationStartedEmpty
++public boolean isEnumerationStartedEmpty()+
-
+
- Tests whether the enumeration started as an empty one. It does not matter
+ if it hasMoreElements() now, only at initialization time. Efficiency: if
+ nextElements(), hasMoreElements() were never used, it activates the
+ hasMoreElements() once. Else it is immediately(O(1))
+
+
-
+
-
+
+ +
+hasNext
++public boolean hasNext()+
-
+
-
+
- Specified by:
hasNextin interfacejava.util.Iterator<E>
+-
+
+
+ +
+next
++public E next()+
-
+
-
+
- Specified by:
nextin interfacejava.util.Iterator<E>
+-
+
+
+ +
+remove
++public void remove() + throws java.lang.UnsupportedOperationException+
-
+
- Always throws UnsupportedOperationException.
+
+
-
+
- Specified by:
removein interfacejava.util.Iterator<E>
-
+
+
- Throws: +
java.lang.UnsupportedOperationException
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/TypeUtil.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/TypeUtil.html new file mode 100644 index 00000000..2caae516 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/TypeUtil.html @@ -0,0 +1,272 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Class TypeUtil<T>
++java.lang.Object ++
+
-
+
public class TypeUtil<T>
- extends java.lang.Object
+TypeUtil isolates type-unsafety so that code that which uses it for + legitimate reasons can stay warning-free. +
+ +
+
-
+
- Author: +
- John V. Sichi +
+ +
| +Constructor Summary | +|
|---|---|
TypeUtil()
+
++ |
+|
| +Method Summary | +||
|---|---|---|
+static
+ |
+uncheckedCast(java.lang.Object o,
+ TypeUtil<T> typeDecl)
+
++ Casts an object to a type. |
+|
| Methods inherited from class java.lang.Object | +
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
+
| +Constructor Detail | +
|---|
+TypeUtil
++public TypeUtil()+
-
+
| +Method Detail | +
|---|
+uncheckedCast
++public static <T> T uncheckedCast(java.lang.Object o, + TypeUtil<T> typeDecl)+
-
+
- Casts an object to a type.
+
+
-
+
- Parameters:
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 tricks +- Returns:
- the result of the cast
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/WeightCombiner.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/WeightCombiner.html new file mode 100644 index 00000000..9a3e72b7 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/WeightCombiner.html @@ -0,0 +1,331 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ +
+
+org.jgrapht.util
+
+Interface WeightCombiner
++
-
+
public interface WeightCombiner
+Binary operator for edge weights. There are some prewritten operators. +
+ +
+
+ +
| +Field Summary | +|
|---|---|
+static WeightCombiner |
+FIRST
+
++ First weight. |
+
+static WeightCombiner |
+MAX
+
++ Maximum weight. |
+
+static WeightCombiner |
+MIN
+
++ Minimum weight. |
+
+static WeightCombiner |
+SECOND
+
++ Second weight. |
+
+static WeightCombiner |
+SUM
+
++ Sum of weights. |
+
| +Method Summary | +|
|---|---|
+ double |
+combine(double a,
+ double b)
+
++ Combines two weights. |
+
| +Field Detail | +
|---|
+SUM
++static final WeightCombiner SUM+
-
+
- Sum of weights.
+
+
-
+
+ +
+MIN
++static final WeightCombiner MIN+
-
+
- Minimum weight.
+
+
-
+
+ +
+MAX
++static final WeightCombiner MAX+
-
+
- Maximum weight.
+
+
-
+
+ +
+FIRST
++static final WeightCombiner FIRST+
-
+
- First weight.
+
+
-
+
+ +
+SECOND
++static final WeightCombiner SECOND+
-
+
- Second weight.
+
+
-
+
| +Method Detail | +
|---|
+combine
++double combine(double a, + double b)+
-
+
- Combines two weights.
+
+
-
+
- Parameters:
a- first weightb- second weight +- Returns:
- result of the operator
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV CLASS + NEXT CLASS | ++ FRAMES + NO FRAMES + + + + + | +||||||||
| + SUMMARY: NESTED | FIELD | CONSTR | METHOD | ++DETAIL: FIELD | CONSTR | METHOD | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/package-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/package-frame.html new file mode 100644 index 00000000..04d31d55 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/package-frame.html @@ -0,0 +1,57 @@ + + + + + +
|
+Interfaces
+
+ +PrefetchIterator.NextElementFunctor + +WeightCombiner |
+
|
+Classes
+
+ +ArrayUnenforcedSet + +FibonacciHeap + +FibonacciHeapNode + +MathUtil + +ModifiableInteger + +PrefetchIterator + +TypeUtil |
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Package org.jgrapht.util +
+Non-graph-specific data structures, algorithms, and utilities used by +JGraphT. +
+See:
+
+ Description
+
+ +
| +Interface Summary | +|
|---|---|
| PrefetchIterator.NextElementFunctor<EE> | ++ |
| WeightCombiner | +Binary operator for edge weights. | +
+ +
| +Class Summary | +|
|---|---|
| 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 that which uses it for + legitimate reasons can stay warning-free. | +
+Package org.jgrapht.util Description +
+ ++Non-graph-specific data structures, algorithms, and utilities used by +JGraphT. +
+ +
+
-
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV PACKAGE + NEXT PACKAGE | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/package-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/package-tree.html new file mode 100644 index 00000000..f325a1b1 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/org/jgrapht/util/package-tree.html @@ -0,0 +1,171 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For Package org.jgrapht.util +
+-
+
- Package Hierarchies:
- All Packages
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- java.util.AbstractCollection<E> (implements java.util.Collection<E>)
+
-
+
- java.util.AbstractList<E> (implements java.util.List<E>)
+
-
+
- java.util.ArrayList<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
+
-
+
- org.jgrapht.util.ArrayUnenforcedSet<E> (implements java.util.Set<E>) +
- java.util.ArrayList<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
+
- java.util.AbstractList<E> (implements java.util.List<E>)
+
- org.jgrapht.util.FibonacciHeap<T>
- org.jgrapht.util.FibonacciHeapNode<T>
- org.jgrapht.util.MathUtil
- java.lang.Number (implements java.io.Serializable)
+
-
+
- org.jgrapht.util.ModifiableInteger (implements java.lang.Comparable<T>) +
- org.jgrapht.util.PrefetchIterator<E> (implements java.util.Enumeration<E>, java.util.Iterator<E>) +
- org.jgrapht.util.TypeUtil<T>
- java.util.AbstractCollection<E> (implements java.util.Collection<E>)
+
+Interface Hierarchy +
+-
+
- org.jgrapht.util.PrefetchIterator.NextElementFunctor<EE>
- org.jgrapht.util.WeightCombiner
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-frame.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-frame.html new file mode 100644 index 00000000..6a8262be --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-frame.html @@ -0,0 +1,60 @@ + + + + + +
| + | +
|---|
| All Classes
+
+
+Packages
+ |
+
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-summary.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-summary.html new file mode 100644 index 00000000..dedd3bb8 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-summary.html @@ -0,0 +1,208 @@ + + + +
+ ++ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+JGraphT is a free Java class library that provides mathematical graph-theory +objects and algorithms. +
+See:
+
+ Description
+
+ +
| +Packages | +|
|---|---|
| org.jgrapht | +The front-end API's interfaces and classes, including Graph,
+DirectedGraph and UndirectedGraph. |
+
| org.jgrapht.alg | +Algorithms provided with JGraphT. | +
| 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.ext | ++Extensions and integration means to other products. | +
| org.jgrapht.generate | +Generators for graphs of various topologies. | +
| org.jgrapht.graph | +Implementations of various graphs. | +
| org.jgrapht.traverse | +Graph traversal means. | +
| org.jgrapht.util | +Non-graph-specific data structures, algorithms, and utilities used by +JGraphT. | +
+JGraphT is a free Java class library that provides mathematical graph-theory +objects and algorithms. This is an open-source java graph library that supports a +rich gallery of graphs and is designed to be powerful, extensible and easy to use. +
+Visit http://jgrapht.sourceforge.net +to download and to get the latest info on JGraphT. +
+ +
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-tree.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-tree.html new file mode 100644 index 00000000..49fdaa98 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/overview-tree.html @@ -0,0 +1,320 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Hierarchy For All Packages
+-
+
- Package Hierarchies:
- org.jgrapht, org.jgrapht.alg, org.jgrapht.alg.util, org.jgrapht.demo, org.jgrapht.event, org.jgrapht.ext, org.jgrapht.generate, org.jgrapht.graph, org.jgrapht.traverse, org.jgrapht.util
+
+Class Hierarchy +
+-
+
- java.lang.Object
-
+
- java.util.AbstractCollection<E> (implements java.util.Collection<E>)
+
-
+
- java.util.AbstractList<E> (implements java.util.List<E>)
+
-
+
- java.util.ArrayList<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
+
-
+
- org.jgrapht.util.ArrayUnenforcedSet<E> (implements java.util.Set<E>) +
- java.util.ArrayList<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
+
- java.util.AbstractList<E> (implements java.util.List<E>)
+
- org.jgrapht.graph.AbstractGraph<V,E> (implements org.jgrapht.Graph<V,E>)
+
-
+
- org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
+
-
+
- org.jgrapht.graph.DefaultDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.DefaultDirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DirectedMultigraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.DirectedWeightedMultigraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DirectedPseudograph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.Multigraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.WeightedMultigraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.Pseudograph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.WeightedPseudograph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.SimpleDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.SimpleDirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.SimpleGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.alg.BlockCutpointGraph<V,E>
- org.jgrapht.graph.SimpleWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DefaultDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
- org.jgrapht.graph.GraphDelegator<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
+
-
+
- org.jgrapht.graph.AsUndirectedGraph<V,E> (implements java.io.Serializable, org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.AsUnweightedDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>, java.io.Serializable) +
- org.jgrapht.graph.AsUnweightedGraph<V,E> (implements java.io.Serializable) +
- org.jgrapht.graph.AsWeightedGraph<V,E> (implements java.io.Serializable, org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DefaultListenableGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.ListenableGraph<V,E>)
+
-
+
- org.jgrapht.graph.ListenableDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.ListenableDirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.ListenableUndirectedGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.ListenableUndirectedWeightedGraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.ListenableDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
- org.jgrapht.graph.EdgeReversedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.ParanoidGraph<V,E>
- org.jgrapht.graph.UnmodifiableGraph<V,E> (implements java.io.Serializable)
+
-
+
- org.jgrapht.graph.UnmodifiableDirectedGraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.UnmodifiableUndirectedGraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.GraphUnion<V,E,G> (implements java.io.Serializable)
+
-
+
- org.jgrapht.graph.DirectedGraphUnion<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.UndirectedGraphUnion<V,E> (implements org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.MaskSubgraph<V,E>
-
+
- org.jgrapht.graph.DirectedMaskSubgraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>) +
- org.jgrapht.graph.UndirectedMaskSubgraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>) +
- org.jgrapht.graph.Subgraph<V,E,G> (implements java.io.Serializable)
+
-
+
- org.jgrapht.graph.DirectedSubgraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.DirectedWeightedSubgraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.UndirectedSubgraph<V,E> (implements org.jgrapht.UndirectedGraph<V,E>)
+
-
+
- org.jgrapht.graph.UndirectedWeightedSubgraph<V,E> (implements org.jgrapht.WeightedGraph<V,E>) +
- org.jgrapht.graph.DirectedSubgraph<V,E> (implements org.jgrapht.DirectedGraph<V,E>)
+
- org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
+
- org.jgrapht.traverse.AbstractGraphIterator<V,E> (implements org.jgrapht.traverse.GraphIterator<V,E>)
+
-
+
- org.jgrapht.traverse.CrossComponentIterator<V,E,D>
-
+
- org.jgrapht.traverse.BreadthFirstIterator<V,E>
- org.jgrapht.traverse.ClosestFirstIterator<V,E>
- org.jgrapht.traverse.DepthFirstIterator<V,E>
- org.jgrapht.traverse.TopologicalOrderIterator<V,E>
- org.jgrapht.traverse.CrossComponentIterator<V,E,D>
- org.jgrapht.alg.BellmanFordShortestPath<V,E>
- org.jgrapht.alg.BiconnectivityInspector<V,E>
- org.jgrapht.alg.BronKerboschCliqueFinder<V,E>
- org.jgrapht.alg.ChromaticNumber
- org.jgrapht.graph.ClassBasedEdgeFactory<V,E> (implements org.jgrapht.EdgeFactory<V,E>, java.io.Serializable) +
- org.jgrapht.graph.ClassBasedVertexFactory<V> (implements org.jgrapht.VertexFactory<V>) +
- org.jgrapht.generate.CompleteBipartiteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.demo.CompleteGraphDemo
- org.jgrapht.generate.CompleteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- java.awt.Component (implements java.awt.image.ImageObserver, java.awt.MenuContainer, java.io.Serializable)
+
-
+
- java.awt.Container
-
+
- java.awt.Panel (implements javax.accessibility.Accessible)
+
-
+
- java.applet.Applet
-
+
- javax.swing.JApplet (implements javax.accessibility.Accessible, javax.swing.RootPaneContainer)
+
-
+
- org.jgrapht.demo.JGraphAdapterDemo
- javax.swing.JApplet (implements javax.accessibility.Accessible, javax.swing.RootPaneContainer)
+
- java.applet.Applet
- java.awt.Panel (implements javax.accessibility.Accessible)
+
- java.awt.Container
- org.jgrapht.alg.ConnectivityInspector<V,E> (implements org.jgrapht.event.GraphListener<V,E>) +
- org.jgrapht.alg.CycleDetector<V,E>
- org.jgrapht.graph.DefaultEdge
-
+
- org.jgrapht.graph.DefaultWeightedEdge
- org.jgrapht.graph.DefaultGraphMapping<V,E> (implements org.jgrapht.GraphMapping<V,E>) +
- org.jgrapht.alg.DijkstraShortestPath<V,E>
- org.jgrapht.alg.DirectedNeighborIndex<V,E> (implements org.jgrapht.event.GraphListener<V,E>) +
- org.jgrapht.ext.DOTExporter<V,E>
- org.jgrapht.alg.EdmondsKarpMaximumFlow<V,E>
- org.jgrapht.generate.EmptyGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.alg.EulerianCircuit
- java.util.EventObject (implements java.io.Serializable)
+
-
+
- org.jgrapht.event.ConnectedComponentTraversalEvent
- org.jgrapht.event.EdgeTraversalEvent<V,E>
- org.jgrapht.event.GraphChangeEvent
-
+
- org.jgrapht.event.GraphEdgeChangeEvent<V,E>
- org.jgrapht.event.GraphVertexChangeEvent<V>
- org.jgrapht.event.VertexTraversalEvent<V>
- org.jgrapht.util.FibonacciHeap<T>
- org.jgrapht.util.FibonacciHeapNode<T>
- org.jgrapht.alg.FloydWarshallShortestPaths<V,E>
- org.jgrapht.ext.GmlExporter<V,E>
- org.jgrapht.ext.GraphMLExporter<V,E>
- org.jgrapht.graph.GraphPathImpl<V,E> (implements org.jgrapht.GraphPath<V,E>) +
- org.jgrapht.Graphs
-
+
- org.jgrapht.GraphHelper
- org.jgrapht.alg.HamiltonianCycle
- org.jgrapht.demo.HelloJGraphT
- org.jgrapht.generate.HyperCubeGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.ext.IntegerEdgeNameProvider<E> (implements org.jgrapht.ext.EdgeNameProvider<E>) +
- org.jgrapht.ext.IntegerNameProvider<V> (implements org.jgrapht.ext.VertexNameProvider<V>) +
- org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory<VV,EE> (implements org.jgrapht.ext.JGraphModelAdapter.CellFactory<VV,EE>, java.io.Serializable) +
- org.jgrapht.alg.KShortestPaths<V,E>
- org.jgrapht.generate.LinearGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.util.MathUtil
- org.jgrapht.ext.MatrixExporter<V,E>
- org.jgrapht.alg.NeighborIndex<V,E> (implements org.jgrapht.event.GraphListener<V,E>) +
- java.lang.Number (implements java.io.Serializable)
+
-
+
- org.jgrapht.util.ModifiableInteger (implements java.lang.Comparable<T>) +
- org.jgrapht.demo.PerformanceDemo
- org.jgrapht.util.PrefetchIterator<E> (implements java.util.Enumeration<E>, java.util.Iterator<E>) +
- org.jgrapht.generate.RandomGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE> (implements org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory<VV,EE>) +
- org.jgrapht.generate.RingGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.ScaleFreeGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.generate.StarGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- org.jgrapht.ext.StringEdgeNameProvider<E> (implements org.jgrapht.ext.EdgeNameProvider<E>) +
- org.jgrapht.ext.StringNameProvider<V> (implements org.jgrapht.ext.VertexNameProvider<V>) +
- org.jgrapht.alg.StrongConnectivityInspector<V,E>
- org.jgrapht.alg.TransitiveClosure
- org.jgrapht.event.TraversalListenerAdapter<V,E> (implements org.jgrapht.event.TraversalListener<V,E>) +
- org.jgrapht.util.TypeUtil<T>
- javax.swing.undo.UndoableEditSupport
-
+
- org.jgraph.graph.DefaultGraphModel (implements org.jgraph.graph.GraphModel, java.io.Serializable)
+
-
+
- org.jgrapht.ext.JGraphModelAdapter<V,E>
- org.jgraph.graph.DefaultGraphModel (implements org.jgraph.graph.GraphModel, java.io.Serializable)
+
- org.jgrapht.alg.VertexCovers
- org.jgrapht.alg.util.VertexDegreeComparator<V,E> (implements java.util.Comparator<T>) +
- org.jgrapht.ext.VisioExporter<V,E>
- org.jgrapht.generate.WheelGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>) +
- java.util.AbstractCollection<E> (implements java.util.Collection<E>)
+
+Interface Hierarchy +
+-
+
- org.jgrapht.EdgeFactory<V,E>
- org.jgrapht.ext.EdgeNameProvider<E>
- org.jgrapht.graph.EdgeSetFactory<V,E>
- java.util.EventListener
-
+
- org.jgrapht.event.VertexSetListener<V>
-
+
- org.jgrapht.event.GraphListener<V,E>
- org.jgrapht.event.VertexSetListener<V>
- org.jgrapht.Graph<V,E>
-
+
- org.jgrapht.DirectedGraph<V,E>
- org.jgrapht.ListenableGraph<V,E>
- org.jgrapht.UndirectedGraph<V,E>
- org.jgrapht.WeightedGraph<V,E>
- org.jgrapht.generate.GraphGenerator<V,E,T>
- org.jgrapht.GraphMapping<V,E>
- org.jgrapht.GraphPath<V,E>
- java.util.Iterator<E>
-
+
- org.jgrapht.traverse.GraphIterator<V,E>
- org.jgrapht.ext.JGraphModelAdapter.CellFactory<VV,EE>
- org.jgrapht.graph.MaskFunctor<V,E>
- org.jgrapht.util.PrefetchIterator.NextElementFunctor<EE>
- org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory<VV,EE>
- org.jgrapht.event.TraversalListener<V,E>
- org.jgrapht.VertexFactory<V>
- org.jgrapht.ext.VertexNameProvider<V>
- org.jgrapht.util.WeightCombiner
+Enum Hierarchy +
+-
+
- java.lang.Object
-
+
- java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable)
+
-
+
- org.jgrapht.traverse.CrossComponentIterator.VisitColor
- java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable)
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/package-list b/ss2010/gdi2/java/libs/jgrapht/javadoc/package-list new file mode 100644 index 00000000..4bcc1d68 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/package-list @@ -0,0 +1,10 @@ +org.jgrapht +org.jgrapht.alg +org.jgrapht.alg.util +org.jgrapht.demo +org.jgrapht.event +org.jgrapht.ext +org.jgrapht.generate +org.jgrapht.graph +org.jgrapht.traverse +org.jgrapht.util diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/resources/inherit.gif b/ss2010/gdi2/java/libs/jgrapht/javadoc/resources/inherit.gif new file mode 100644 index 00000000..c814867a Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/javadoc/resources/inherit.gif differ diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/serialized-form.html b/ss2010/gdi2/java/libs/jgrapht/javadoc/serialized-form.html new file mode 100644 index 00000000..fb8b65d3 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/serialized-form.html @@ -0,0 +1,1558 @@ + + + + + +
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+
+Serialized Form
++ +
| +Package org.jgrapht.alg | +
|---|
| +Class org.jgrapht.alg.BlockCutpointGraph extends SimpleGraph<UndirectedGraph<V,E>,DefaultEdge> implements Serializable | +
|---|
+serialVersionUID: -9101341117013163934L + +
| +Serialized Fields | +
|---|
+cutpoints
++java.util.Set<E> cutpoints+
-
+
-
+
+
+dfsTree
++DirectedGraph<V,E> dfsTree+
-
+
- DFS (Depth-First-Search) tree.
+
+
-
+
+
+graph
++UndirectedGraph<V,E> graph+
-
+
-
+
+
+numOrder
++int numOrder+
-
+
-
+
+
+stack
++java.util.Deque<E> stack+
-
+
-
+
+
+vertex2biconnectedSubgraphs
++java.util.Map<K,V> vertex2biconnectedSubgraphs+
-
+
-
+
+
+vertex2block
++java.util.Map<K,V> vertex2block+
-
+
-
+
+
+vertex2numOrder
++java.util.Map<K,V> vertex2numOrder+
-
+
-
+
+ +
| +Package org.jgrapht.demo | +
|---|
| +Class org.jgrapht.demo.JGraphAdapterDemo extends javax.swing.JApplet implements Serializable | +
|---|
+serialVersionUID: 3256444702936019250L + +
| +Serialized Fields | +
|---|
+jgAdapter
++JGraphModelAdapter<V,E> jgAdapter+
-
+
-
+
+ +
| +Package org.jgrapht.event | +
|---|
| +Class org.jgrapht.event.ConnectedComponentTraversalEvent extends java.util.EventObject implements Serializable | +
|---|
+serialVersionUID: 3834311717709822262L + +
| +Serialized Fields | +
|---|
+type
++int type+
-
+
- The type of this event.
+
+
-
+
| +Class org.jgrapht.event.EdgeTraversalEvent extends java.util.EventObject implements Serializable | +
|---|
+serialVersionUID: 4050768173789820979L + +
| +Serialized Fields | +
|---|
+edge
++java.lang.Object edge+
-
+
- The traversed edge.
+
+
-
+
| +Class org.jgrapht.event.GraphChangeEvent extends java.util.EventObject implements Serializable | +
|---|
+serialVersionUID: 3834592106026382391L + +
| +Serialized Fields | +
|---|
+type
++int type+
-
+
- The type of graph change this event indicates.
+
+
-
+
| +Class org.jgrapht.event.GraphEdgeChangeEvent extends GraphChangeEvent implements Serializable | +
|---|
+serialVersionUID: 3618134563335844662L + +
| +Serialized Fields | +
|---|
+edge
++java.lang.Object edge+
-
+
- The edge that this event is related to.
+
+
-
+
| +Class org.jgrapht.event.GraphVertexChangeEvent extends GraphChangeEvent implements Serializable | +
|---|
+serialVersionUID: 3690189962679104053L + +
| +Serialized Fields | +
|---|
+vertex
++java.lang.Object vertex+
-
+
- The vertex that this event is related to.
+
+
-
+
| +Class org.jgrapht.event.VertexTraversalEvent extends java.util.EventObject implements Serializable | +
|---|
+serialVersionUID: 3688790267213918768L + +
| +Serialized Fields | +
|---|
+vertex
++java.lang.Object vertex+
-
+
- The traversed vertex.
+
+
-
+
+ +
| +Package org.jgrapht.ext | +
|---|
| +Class org.jgrapht.ext.JGraphModelAdapter extends org.jgraph.graph.DefaultGraphModel implements Serializable | +
|---|
+serialVersionUID: 3256722883706302515L + +
| +Serialized Fields | +
|---|
+jCellsBeingAdded
++java.util.Set<E> jCellsBeingAdded+
-
+
- The following (jCells|jtElement)Being(Added|Removed) sets are used to
+ prevent bouncing of events between the JGraph and JGraphT listeners. They
+ ensure that their respective add/remove operations are done exactly once.
+ Here is an example of how jCellsBeingAdded is used when an edge is added
+ to a JGraph graph:
+
+
+ 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...
++
-
+
+
+jCellsBeingRemoved
++java.util.Set<E> jCellsBeingRemoved+
-
+
-
+
+
+jtElementsBeingAdded
++java.util.Set<E> jtElementsBeingAdded+
-
+
-
+
+
+jtElementsBeingRemoved
++java.util.Set<E> jtElementsBeingRemoved+
-
+
-
+
+
+cellFactory
++JGraphModelAdapter.CellFactory<VV,EE> cellFactory+
-
+
-
+
+
+cellToEdge
++java.util.Map<K,V> cellToEdge+
-
+
- Maps JGraph edges to JGraphT edges
+
+
-
+
+
+cellToVertex
++java.util.Map<K,V> cellToVertex+
-
+
- Maps JGraph vertices to JGraphT vertices
+
+
-
+
+
+defaultEdgeAttributes
++org.jgraph.graph.AttributeMap defaultEdgeAttributes+
-
+
-
+
+
+defaultVertexAttributes
++org.jgraph.graph.AttributeMap defaultVertexAttributes+
-
+
-
+
+
+edgeToCell
++java.util.Map<K,V> edgeToCell+
-
+
- Maps JGraphT edges to JGraph edges
+
+
-
+
+
+vertexToCell
++java.util.Map<K,V> vertexToCell+
-
+
- Maps JGraphT vertices to JGraph vertices
+
+
-
+
+
+jtGraph
++org.jgrapht.ext.JGraphModelAdapter.ShieldedGraph jtGraph+
-
+
-
+
| +Class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory extends java.lang.Object implements Serializable | +
|---|
+serialVersionUID: 3690194343461861173L + +
+
+ +
| +Package org.jgrapht.graph | +
|---|
| +Class org.jgrapht.graph.AbstractBaseGraph extends AbstractGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: -1263088497616142427L + +
| +Serialized Fields | +
|---|
+allowingLoops
++boolean allowingLoops+
-
+
-
+
+
+edgeFactory
++EdgeFactory<V,E> edgeFactory+
-
+
-
+
+
+edgeSetFactory
++EdgeSetFactory<V,E> edgeSetFactory+
-
+
-
+
+
+edgeMap
++java.util.Map<K,V> edgeMap+
-
+
-
+
+
+specifics
++org.jgrapht.graph.AbstractBaseGraph.Specifics specifics+
-
+
-
+
+
+allowingMultipleEdges
++boolean allowingMultipleEdges+
-
+
-
+
| +Class org.jgrapht.graph.AsUndirectedGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: 3257845485078065462L + +
+ +
| +Class org.jgrapht.graph.AsUnweightedDirectedGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: -4320818446777715312L + +
+ +
| +Class org.jgrapht.graph.AsUnweightedGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: 7175505077601824663L + +
+ +
| +Class org.jgrapht.graph.AsWeightedGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: -716810639338971372L + +
| +Serialized Fields | +
|---|
+weightMap
++java.util.Map<K,V> weightMap+
-
+
-
+
+
+isWeightedGraph
++boolean isWeightedGraph+
-
+
-
+
| +Class org.jgrapht.graph.ClassBasedEdgeFactory extends java.lang.Object implements Serializable | +
|---|
+serialVersionUID: 3618135658586388792L + +
| +Serialized Fields | +
|---|
+edgeClass
++java.lang.Class<T> edgeClass+
-
+
-
+
| +Class org.jgrapht.graph.DefaultDirectedGraph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3544953246956466230L + +
+ +
| +Class org.jgrapht.graph.DefaultDirectedWeightedGraph extends DefaultDirectedGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3761405317841171513L + +
+ +
| +Class org.jgrapht.graph.DefaultEdge extends org.jgrapht.graph.IntrusiveEdge implements Serializable | +
|---|
+serialVersionUID: 3258408452177932855L + +
+ +
| +Class org.jgrapht.graph.DefaultListenableGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: 3977575900898471984L + +
| +Serialized Fields | +
|---|
+graphListeners
++java.util.ArrayList<E> graphListeners+
-
+
-
+
+
+vertexSetListeners
++java.util.ArrayList<E> vertexSetListeners+
-
+
-
+
+
+reuseableEdgeEvent
++org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent<VV,EE> reuseableEdgeEvent+
-
+
-
+
+
+reuseableVertexEvent
++org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent<VV> reuseableVertexEvent+
-
+
-
+
+
+reuseEvents
++boolean reuseEvents+
-
+
-
+
| +Class org.jgrapht.graph.DefaultWeightedEdge extends DefaultEdge implements Serializable | +
|---|
+serialVersionUID: 229708706467350994L + +
| +Serialized Fields | +
|---|
+weight
++double weight+
-
+
-
+
| +Class org.jgrapht.graph.DirectedGraphUnion extends GraphUnion<V,E,DirectedGraph<V,E>> implements Serializable | +
|---|
+serialVersionUID: -740199233080172450L + +
+ +
| +Class org.jgrapht.graph.DirectedMultigraph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3258408413590599219L + +
+ +
| +Class org.jgrapht.graph.DirectedPseudograph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: -8300409752893486415L + +
+ +
| +Class org.jgrapht.graph.DirectedSubgraph extends Subgraph<V,E,DirectedGraph<V,E>> implements Serializable | +
|---|
+serialVersionUID: 3616445700507054133L + +
+ +
| +Class org.jgrapht.graph.DirectedWeightedMultigraph extends DirectedMultigraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 4049071636005206066L + +
+ +
| +Class org.jgrapht.graph.DirectedWeightedSubgraph extends DirectedSubgraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3905799799168250680L + +
+ +
| +Class org.jgrapht.graph.EdgeReversedGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: 9091361782455418631L + +
+ +
| +Class org.jgrapht.graph.GraphDelegator extends AbstractGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3257005445226181425L + +
| +Serialized Fields | +
|---|
+delegate
++Graph<V,E> delegate+
-
+
- The graph to which operations are delegated.
+
+
-
+
| +Class org.jgrapht.graph.GraphUnion extends AbstractGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: -740199233080172450L + +
| +Serialized Fields | +
|---|
+g1
++Graph<V,E> g1+
-
+
-
+
+
+g2
++Graph<V,E> g2+
-
+
-
+
+
+operator
++WeightCombiner operator+
-
+
-
+
| +Class org.jgrapht.graph.ListenableDirectedGraph extends DefaultListenableGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3257571698126368824L + +
+ +
| +Class org.jgrapht.graph.ListenableDirectedWeightedGraph extends ListenableDirectedGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3977582476627621938L + +
+ +
| +Class org.jgrapht.graph.ListenableUndirectedGraph extends DefaultListenableGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3256999969193145905L + +
+ +
| +Class org.jgrapht.graph.ListenableUndirectedWeightedGraph extends ListenableUndirectedGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3690762799613949747L + +
+ +
| +Class org.jgrapht.graph.Multigraph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3257001055819871795L + +
+ +
| +Class org.jgrapht.graph.ParanoidGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: 5075284167422166539L + +
+ +
| +Class org.jgrapht.graph.Pseudograph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3833183614484755253L + +
+ +
| +Class org.jgrapht.graph.SimpleDirectedGraph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 4049358608472879671L + +
+ +
| +Class org.jgrapht.graph.SimpleDirectedWeightedGraph extends SimpleDirectedGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3904960841681220919L + +
+ +
| +Class org.jgrapht.graph.SimpleGraph extends AbstractBaseGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3545796589454112304L + +
+ +
| +Class org.jgrapht.graph.SimpleWeightedGraph extends SimpleGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3906088949100655922L + +
+ +
| +Class org.jgrapht.graph.Subgraph extends AbstractGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3208313055169665387L + +
| +Serialized Fields | +
|---|
+edgeSet
++java.util.Set<E> edgeSet+
-
+
-
+
+
+vertexSet
++java.util.Set<E> vertexSet+
-
+
-
+
+
+base
++Graph<V,E> base+
-
+
-
+
+
+isInduced
++boolean isInduced+
-
+
-
+
| +Class org.jgrapht.graph.UndirectedGraphUnion extends GraphUnion<V,E,UndirectedGraph<V,E>> implements Serializable | +
|---|
+serialVersionUID: -740199233080172450L + +
+ +
| +Class org.jgrapht.graph.UndirectedSubgraph extends Subgraph<V,E,UndirectedGraph<V,E>> implements Serializable | +
|---|
+serialVersionUID: 3256728359772631350L + +
+ +
| +Class org.jgrapht.graph.UndirectedWeightedSubgraph extends UndirectedSubgraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3689346615735236409L + +
+ +
| +Class org.jgrapht.graph.UnmodifiableDirectedGraph extends UnmodifiableGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3978701783725913906L + +
+ +
| +Class org.jgrapht.graph.UnmodifiableGraph extends GraphDelegator<V,E> implements Serializable | +
|---|
+serialVersionUID: 3544957670722713913L + +
+ +
| +Class org.jgrapht.graph.UnmodifiableUndirectedGraph extends UnmodifiableGraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3258134639355704624L + +
+ +
| +Class org.jgrapht.graph.WeightedMultigraph extends Multigraph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3544671793370640696L + +
+ +
| +Class org.jgrapht.graph.WeightedPseudograph extends Pseudograph<V,E> implements Serializable | +
|---|
+serialVersionUID: 3257290244524356152L + +
+
+ +
| +Package org.jgrapht.util | +
|---|
| +Class org.jgrapht.util.ArrayUnenforcedSet extends java.util.ArrayList<E> implements Serializable | +
|---|
+serialVersionUID: -7413250161201811238L + +
+ +
| +Class org.jgrapht.util.ModifiableInteger extends java.lang.Number implements Serializable | +
|---|
+serialVersionUID: 3618698612851422261L + +
| +Serialized Fields | +
|---|
+value
++int value+
-
+
- The int value represented by this
ModifiableInteger. ++
-
+
+
+ + + + + +
+
+
|
++ + | +||||||||
| + PREV + NEXT | ++ FRAMES + NO FRAMES + + + + + | +||||||||
+ + + diff --git a/ss2010/gdi2/java/libs/jgrapht/javadoc/stylesheet.css b/ss2010/gdi2/java/libs/jgrapht/javadoc/stylesheet.css new file mode 100644 index 00000000..6ea9e516 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/javadoc/stylesheet.css @@ -0,0 +1,29 @@ +/* Javadoc style sheet */ + +/* Define colors, fonts and other style attributes here to override the defaults */ + +/* Page background color */ +body { background-color: #FFFFFF; color:#000000 } + +/* Headings */ +h1 { font-size: 145% } + +/* Table colors */ +.TableHeadingColor { background: #CCCCFF; color:#000000 } /* Dark mauve */ +.TableSubHeadingColor { background: #EEEEFF; color:#000000 } /* Light mauve */ +.TableRowColor { background: #FFFFFF; color:#000000 } /* White */ + +/* Font used in left-hand frame lists */ +.FrameTitleFont { font-size: 100%; font-family: Helvetica, Arial, sans-serif; color:#000000 } +.FrameHeadingFont { font-size: 90%; font-family: Helvetica, Arial, sans-serif; color:#000000 } +.FrameItemFont { font-size: 90%; font-family: Helvetica, Arial, sans-serif; color:#000000 } + +/* Navigation bar fonts and colors */ +.NavBarCell1 { background-color:#EEEEFF; color:#000000} /* Light mauve */ +.NavBarCell1Rev { background-color:#00008B; color:#FFFFFF} /* Dark Blue */ +.NavBarFont1 { font-family: Arial, Helvetica, sans-serif; color:#000000;color:#000000;} +.NavBarFont1Rev { font-family: Arial, Helvetica, sans-serif; color:#FFFFFF;color:#FFFFFF;} + +.NavBarCell2 { font-family: Arial, Helvetica, sans-serif; background-color:#FFFFFF; color:#000000} +.NavBarCell3 { font-family: Arial, Helvetica, sans-serif; background-color:#FFFFFF; color:#000000} + diff --git a/ss2010/gdi2/java/libs/jgrapht/jgrapht-jdk1.6.jar b/ss2010/gdi2/java/libs/jgrapht/jgrapht-jdk1.6.jar new file mode 100644 index 00000000..48543766 Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/jgrapht-jdk1.6.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/TGGraphLayout.jar b/ss2010/gdi2/java/libs/jgrapht/lib/TGGraphLayout.jar new file mode 100644 index 00000000..0131e899 Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/lib/TGGraphLayout.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/jgraph.jar b/ss2010/gdi2/java/libs/jgrapht/lib/jgraph.jar new file mode 100644 index 00000000..05c7c9c9 Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/lib/jgraph.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/junit.jar b/ss2010/gdi2/java/libs/jgrapht/lib/junit.jar new file mode 100644 index 00000000..674d71e8 Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/lib/junit.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/lib-readme.txt b/ss2010/gdi2/java/libs/jgrapht/lib/lib-readme.txt new file mode 100644 index 00000000..3f612600 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/lib/lib-readme.txt @@ -0,0 +1,58 @@ + ================== + Library Folder + ================== + +This folder contains jar files of libraries used by JGraphT: + +----------------------------------- +jgraph.jar (version 5.8.3.2-Munich) +----------------------------------- + +The runtime library of the JGraph project. The JGraph library is licensed under +the terms of the GNU Lesser General Public License (LGPL), as with JGraphT. + +You can find out more about JGraph and/or download the latest version from +http://www.jgraph.com. You will also find there the source code of the +JGraph library. + +Note: the JGraph jar in this folder is the build for Java 1.4. + +------------------------- +junit.jar (version 3.8.1) +------------------------- + +The runtime library of the JUnit testing framework. The JUnit library is +licensed under the terms of the IBM Common Public License. + +You can find out more about JUnit and/or download the latest version from +http://www.junit.org. You will also find there the source code of the JUnit +library. + +-------------------------------- +TGGraphLayout.jar (version 1.22) +-------------------------------- + +The layout library of the Touchgraph project. The Touchgraph library is +licensed under an Apache-style license; see TG-APACHE-LICENSE.txt. + +You can find out more about Touchgraph and/or download the latest version from +http://www.touchgraph.com. You can find the source code of the +Touchgraph library at http://sourceforge.net/projects/touchgraph. + +------------------------ +svn*.jar (version 1.0.0) +------------------------ + +The svn ant task from http://subclipse.tigris.org/svnant/svn.html + +---------------------------- +xmlunit1.0.jar (version 1.0) +---------------------------- + +The runtime library for the XMLUnit extension to JUnit. The XMLUnit +library is licensed under the terms of the BSD License. + +You can find out more about XMLUnit and/or download the latest version +from http://xmlunit.sourceforge.net. You will also find there the +source code of the xmlunit library. + diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/svnClientAdapter.jar b/ss2010/gdi2/java/libs/jgrapht/lib/svnClientAdapter.jar new file mode 100644 index 00000000..a6ce6dff Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/lib/svnClientAdapter.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/svnant.jar b/ss2010/gdi2/java/libs/jgrapht/lib/svnant.jar new file mode 100644 index 00000000..ef9563a7 Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/lib/svnant.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/lib/xmlunit1.0.jar b/ss2010/gdi2/java/libs/jgrapht/lib/xmlunit1.0.jar new file mode 100644 index 00000000..6e8ed584 Binary files /dev/null and b/ss2010/gdi2/java/libs/jgrapht/lib/xmlunit1.0.jar differ diff --git a/ss2010/gdi2/java/libs/jgrapht/license-LGPL.txt b/ss2010/gdi2/java/libs/jgrapht/license-LGPL.txt new file mode 100644 index 00000000..b1e3f5a2 --- /dev/null +++ b/ss2010/gdi2/java/libs/jgrapht/license-LGPL.txt @@ -0,0 +1,504 @@ + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + +
See + * http://mathworld.wolfram.com/DirectedGraph.html for more on directed + * graphs.
+ * + * @author Barak Naveh + * @since Jul 14, 2003 + */ +public interface DirectedGraphThis 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.
+ *
+ * @author Barak Naveh
+ * @since Jul 14, 2003
+ */
+public interface 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.
+ * + * @param sourceVertex source vertex of the edge. + * @param targetVertex target vertex of the edge. + * + * @return a set of all edges connecting source vertex to target vertex. + */ + public Set
+ * 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.
+ * + * @param sourceVertex source vertex of the edge. + * @param targetVertex target vertex of the edge. + * + * @return an edge connecting source vertex to target vertex. + */ + public E getEdge(V sourceVertex, V targetVertex); + + /** + * Returns the edge factory using which this graph creates new edges. The + * edge factory is defined when the graph is constructed and must not be + * modified. + * + * @return the edge factory using which this graph creates new edges. + */ + public EdgeFactorynull.
+ *
+ * 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.
+ * null.
+ *
+ * @throws IllegalArgumentException if source or target vertices are not
+ * found in the graph.
+ * @throws NullPointerException if any of the specified vertices is
+ * null.
+ *
+ * @see #getEdgeFactory()
+ */
+ public E addEdge(V sourceVertex, V targetVertex);
+
+ /**
+ * Adds the specified edge to this graph, going from the source vertex to
+ * the target vertex. More formally, adds the specified edge,
+ * 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.
+ * + * @param sourceVertex source vertex of the edge. + * @param targetVertex target vertex of the edge. + * @param e edge to be added to this graph. + * + * @return true if this graph did not already contain the specified + * edge. + * + * @throws IllegalArgumentException if source or target vertices are not + * found in the graph. + * @throws ClassCastException if the specified edge is not assignment + * compatible with the class of edges produced by the edge factory of this + * graph. + * @throws NullPointerException if any of the specified vertices is
+ * null.
+ *
+ * @see #addEdge(Object, Object)
+ * @see #getEdgeFactory()
+ */
+ public boolean addEdge(V sourceVertex, V targetVertex, E e);
+
+ /**
+ * Adds the specified vertex to this graph if not already present. More
+ * formally, adds the specified vertex, 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.
+ *
+ * @param v vertex to be added to this graph.
+ *
+ * @return true if this graph did not already contain the specified
+ * vertex.
+ *
+ * @throws NullPointerException if the specified vertex is
+ * null.
+ */
+ public boolean addVertex(V v);
+
+ /**
+ * Returns true if and only if this graph contains an edge going
+ * from the source vertex to the target vertex. In undirected graphs the
+ * same result is obtained when source and target are inverted. If any of
+ * the specified vertices does not exist in the graph, or if is
+ * null, returns false.
+ *
+ * @param sourceVertex source vertex of the edge.
+ * @param targetVertex target vertex of the edge.
+ *
+ * @return true if this graph contains the specified edge.
+ */
+ public boolean containsEdge(V sourceVertex, V targetVertex);
+
+ /**
+ * Returns true if this graph contains the specified edge. More
+ * formally, returns true if and only if this graph contains an
+ * edge e2 such that e.equals(e2). If the
+ * specified edge is null returns false.
+ *
+ * @param e edge whose presence in this graph is to be tested.
+ *
+ * @return true if this graph contains the specified edge.
+ */
+ public boolean containsEdge(E e);
+
+ /**
+ * Returns true if this graph contains the specified vertex. More
+ * formally, returns true if and only if this graph contains a
+ * vertex u such that u.equals(v). If the
+ * specified vertex is null returns false.
+ *
+ * @param v vertex whose presence in this graph is to be tested.
+ *
+ * @return true if this graph contains the specified vertex.
+ */
+ public boolean containsVertex(V v);
+
+ /**
+ * Returns a set of the edges contained in this graph. The set is backed by
+ * the graph, so changes to the graph are reflected in the set. If the graph
+ * is modified while an iteration over the set is in progress, the results
+ * of the iteration are undefined.
+ *
+ * The graph implementation may maintain a particular set ordering (e.g. + * via {@link java.util.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.
+ * + * @return a set of the edges contained in this graph. + */ + public Setnull.
+ */
+ public Setnull 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 {@link #removeEdge(Object)} method, or
+ * the {@link #removeEdge(Object, Object)} method.
+ *
+ * @param sourceVertex source vertex of the edge.
+ * @param targetVertex target vertex of the edge.
+ *
+ * @return the removed edges, or null if no either vertex not
+ * part of graph
+ */
+ public Setnull otherwise.
+ *
+ * @param sourceVertex source vertex of the edge.
+ * @param targetVertex target vertex of the edge.
+ *
+ * @return The removed edge, or null if no edge removed.
+ */
+ public E removeEdge(V sourceVertex, V targetVertex);
+
+ /**
+ * Removes the specified edge from the graph. Removes the specified edge
+ * from this graph if it is present. More formally, removes an edge
+ * 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.
true if and only if the graph contained the
+ * specified edge.
+ */
+ public boolean removeEdge(E e);
+
+ /**
+ * Removes the specified vertex from this graph including all its touching
+ * edges if present. More formally, if the graph contains a vertex
+ * 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.
true if the graph contained the specified vertex;
+ * false otherwise.
+ */
+ public boolean removeVertex(V v);
+
+ /**
+ * Returns a set of the vertices contained in this graph. The set is backed
+ * by the graph, so changes to the graph are reflected in the set. If the
+ * graph is modified while an iteration over the set is in progress, the
+ * results of the iteration are undefined.
+ *
+ * The graph implementation may maintain a particular set ordering (e.g. + * via {@link java.util.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.
+ * + * @return a set view of the vertices contained in this graph. + */ + public Setvertex
+ *
+ * @param vertex vertex in one of the graphs
+ * @param forward if true, uses mapping from graph1 to graph2; if false, use
+ * mapping from graph2 to graph1
+ *
+ * @return corresponding vertex in other graph, or null if none
+ */
+ public V getVertexCorrespondence(V vertex, boolean forward);
+
+ /**
+ * Gets the mapped value where the key is edge
+ *
+ * @param edge edge in one of the graphs
+ * @param forward if true, uses mapping from graph1 to graph2; if false, use
+ * mapping from graph2 to graph1
+ *
+ * @return corresponding edge in other graph, or null if none
+ */
+ public E getEdgeCorrespondence(E edge, boolean forward);
+}
+
+// End GraphMapping.java
diff --git a/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/GraphPath.java b/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/GraphPath.java
new file mode 100644
index 00000000..6bcb6715
--- /dev/null
+++ b/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/GraphPath.java
@@ -0,0 +1,105 @@
+/* ==========================================
+ * JGraphT : a free Java graph-theory library
+ * ==========================================
+ *
+ * Project Info: http://jgrapht.sourceforge.net/
+ * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
+ *
+ * (C) Copyright 2003-2008, by Barak Naveh and Contributors.
+ *
+ * This library is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or
+ * (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this library; if not, write to the Free Software Foundation,
+ * Inc.,
+ * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
+ */
+/* ----------
+ * Graph.java
+ * ----------
+ * (C) Copyright 2008-2008, by John V. Sichi and Contributors.
+ *
+ * Original Author: John V. Sichi
+ * Contributor(s): -
+ *
+ * $Id: GraphPath.java 645 2008-09-30 19:44:48Z perfecthash $
+ *
+ * Changes
+ * -------
+ * 1-Jan-2008 : Initial revision (JVS);
+ *
+ */
+package org.jgrapht;
+
+import java.util.*;
+
+
+/**
+ * A GraphPath represents a
+ * path in a {@link 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.
+ *
+ * @author John Sichi
+ * @since Jan 1, 2008
+ */
+public interface GraphPathWhether or not the returned edge list is modifiable depends on the
+ * path implementation.
+ *
+ * @return list of edges traversed by the path
+ */
+ public List The behavior of this operation is undefined if any of the specified
+ * graphs is modified while operation is in progress. The behavior of this operation is undefined if any of the specified
+ * graphs is modified while operation is in progress. See
+ * http://mathworld.wolfram.com/Graph.html for more on undirected and on
+ * directed graphs. NOTE jvs 1-Jan-2008: This is an internal data structure for use in
+ * algorithms. For returning paths to callers, use the public {@link GraphPath}
+ * interface instead.
+ *
+ * @author Guillaume Boulmier
+ * @since July 5, 2007
+ */
+abstract class AbstractPathElement
+ * null.
+ *
+ * @see Graph#addEdge(Object, Object)
+ */
+ public static
+ * null.
+ */
+ public static
+ * null.
+ */
+ public static true
+ * if the destination graph has been modified as a result of this operation,
+ * otherwise it returns false.
+ *
+ * true if and only if the destination graph has been
+ * changed as a result of this operation.
+ */
+ public static
+ * The empty path is composed only of one vertex.
+ * In this case the path has no previous path element.
+ * .
+ *
+ * Edge.
+ */
+ public Listnull if the path is empty.
+ */
+ public E getPrevEdge()
+ {
+ return this.prevEdge;
+ }
+
+ /**
+ * Returns the previous path element.
+ *
+ * @return null is the path is empty.
+ */
+ public AbstractPathElementAbstractPathElement with same target vertex.
+ *
+ * @author Guillaume Boulmier
+ * @since July 5, 2007
+ */
+abstract class AbstractPathElementListAbstractPathElement.
+ */
+ protected ArrayList
+ * null.
+ * @throws IllegalArgumentException if maxSize is negative or
+ * 0.
+ */
+ protected AbstractPathElementList(
+ GraphAbstractPathElement.
+ * @param edge edge reaching the end vertex of the created paths.
+ *
+ * @throws NullPointerException if the specified prevPathElementList or edge
+ * is null.
+ * @throws IllegalArgumentException if maxSize is negative or
+ * 0.
+ */
+ protected AbstractPathElementList(
+ GraphAbstractPathElement stored at the specified
+ * index.
+ */
+ public T get(int index)
+ {
+ return this.pathElements.get(index);
+ }
+
+ /**
+ * Returns target vertex.
+ */
+ public V getVertex()
+ {
+ return this.vertex;
+ }
+
+ /**
+ * Returns the number of paths stored in the list.
+ */
+ public int size()
+ {
+ return this.pathElements.size();
+ }
+}
+
+// End AbstractPathElementList.java
diff --git a/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/alg/BellmanFordIterator.java b/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/alg/BellmanFordIterator.java
new file mode 100644
index 00000000..d1cd6e64
--- /dev/null
+++ b/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/alg/BellmanFordIterator.java
@@ -0,0 +1,448 @@
+/* ==========================================
+ * JGraphT : a free Java graph-theory library
+ * ==========================================
+ *
+ * Project Info: http://jgrapht.sourceforge.net/
+ * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
+ *
+ * (C) Copyright 2003-2008, by Barak Naveh and Contributors.
+ *
+ * This library is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or
+ * (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this library; if not, write to the Free Software Foundation,
+ * Inc.,
+ * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
+ */
+/* -------------------------
+ * BellmanFordIterator.java
+ * -------------------------
+ * (C) Copyright 2006-2008, by France Telecom and Contributors.
+ *
+ * Original Author: Guillaume Boulmier and Contributors.
+ * Contributor(s): John V. Sichi
+ *
+ * $Id: BellmanFordIterator.java 645 2008-09-30 19:44:48Z perfecthash $
+ *
+ * Changes
+ * -------
+ * 05-Jan-2006 : Initial revision (GB);
+ * 14-Jan-2006 : Added support for generics (JVS);
+ *
+ */
+package org.jgrapht.alg;
+
+import java.util.*;
+
+import org.jgrapht.*;
+
+
+/**
+ * Helper class for {@link BellmanFordShortestPath}; not intended for general
+ * use.
+ */
+class BellmanFordIterator
+ * nMaxHops edges between the start vertex and the end vertex.
+ *
+ * @param endVertex end vertex.
+ *
+ * @return .
+ */
+ public BellmanFordPathElementtrue if at least one path has been improved during
+ * the previous pass, false otherwise.
+ */
+ public boolean hasNext()
+ {
+ if (!this.startVertexEncountered) {
+ encounterStartVertex();
+ }
+
+ return !(this.prevImprovedVertices.isEmpty());
+ }
+
+ /**
+ * Returns the list Collection of vertices whose path has been
+ * improved during the current pass.
+ *
+ * @see java.util.Iterator#next()
+ */
+ public ListEdge
+ * objects.
+ *
+ * @param vertex a vertex which has just been encountered.
+ * @param edge the edge via which the vertex was encountered.
+ *
+ * @return the cost obtained by concatenation.
+ *
+ * @see Graph#getEdgeWeight(E)
+ */
+ protected double calculatePathCost(V vertex, E edge)
+ {
+ V oppositeVertex = Graphs.getOppositeVertex(graph, edge, vertex);
+
+ // we get the data of the previous pass.
+ BellmanFordPathElementEdge of the
+ * vertex.
+ *
+ * @param vertex
+ *
+ * @return .
+ */
+ protected Iteratornull if no
+ * data was associated with the vertex.
+ */
+ protected BellmanFordPathElementnull if no
+ * data was associated with the vertex.
+ */
+ protected BellmanFordPathElement
+ * null if no data was associated with the vertex.
+ */
+ protected BellmanFordPathElementtrue if the cost has been improved,
+ * false otherwise.
+ */
+ private boolean relaxVertexAgain(V vertex, E edge)
+ {
+ assertValidEdge(edge);
+
+ double candidateCost = calculatePathCost(vertex, edge);
+
+ // we get the data of the previous pass.
+ BellmanFordPathElementtrue if the path has been improved,
+ * false otherwise. We use an "epsilon" precision to check whether
+ * the cost has been improved (because of many roundings, a formula equal to
+ * 0 could unfortunately be evaluated to 10^-14).
+ *
+ * @param candidatePrevPathElement
+ * @param candidateEdge
+ * @param candidateCost
+ *
+ * @return .
+ */
+ protected boolean improve(
+ BellmanFordPathElementEdge, or null if no path exists between the
+ * start vertex and the end vertex.
+ */
+ public Listtrue if the graph is biconnected (no cutpoint),
+ * false otherwise.
+ */
+ public boolean isBiconnected()
+ {
+ return this.blockCutpointGraph.vertexSet().size() == 1;
+ }
+}
+
+// End BiconnectivityInspector.java
diff --git a/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/alg/BlockCutpointGraph.java b/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/alg/BlockCutpointGraph.java
new file mode 100644
index 00000000..37e7e3f5
--- /dev/null
+++ b/ss2010/gdi2/java/libs/jgrapht/src/org/jgrapht/alg/BlockCutpointGraph.java
@@ -0,0 +1,365 @@
+/* ==========================================
+ * JGraphT : a free Java graph-theory library
+ * ==========================================
+ *
+ * Project Info: http://jgrapht.sourceforge.net/
+ * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
+ *
+ * (C) Copyright 2003-2008, by Barak Naveh and Contributors.
+ *
+ * This library is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or
+ * (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this library; if not, write to the Free Software Foundation,
+ * Inc.,
+ * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
+ */
+/* -------------------------
+ * BlockCutpointGraph.java
+ * -------------------------
+ * (C) Copyright 2007-2008, by France Telecom
+ *
+ * Original Author: Guillaume Boulmier and Contributors.
+ * Contributor(s): John V. Sichi
+ *
+ * $Id: BlockCutpointGraph.java 645 2008-09-30 19:44:48Z perfecthash $
+ *
+ * Changes
+ * -------
+ * 05-Jun-2007 : Initial revision (GB);
+ * 05-Jul-2007 : Added support for generics (JVS);
+ *
+ */
+package org.jgrapht.alg;
+
+import java.util.*;
+
+import org.jgrapht.*;
+import org.jgrapht.graph.*;
+
+
+/**
+ * Definition of a block of a
+ * graph in MathWorld.
+ * Definition and lemma taken from the article
+ * Structure-Based Resilience Metrics for Service-Oriented Networks:
+ *
+ *
+ *
+ *
+ * @author Guillaume Boulmier
+ * @since July 5, 2007
+ */
+public class BlockCutpointGraphtrue if the vertex is a cutpoint, false
+ * otherwise.
+ *
+ * @param vertex vertex in the initial graph.
+ */
+ public boolean isCutpoint(V vertex)
+ {
+ if (!this.graph.vertexSet().contains(vertex)) {
+ throw new IllegalArgumentException("No such vertex in the graph!");
+ }
+
+ return this.cutpoints.contains(vertex);
+ }
+
+ private void biconnectedComponentFinished(V s, V n)
+ {
+ this.cutpoints.add(s);
+
+ Set