Files
commons-graph/src/java/org/apache/commons/graph/visualize/DaVinciVisualizer.java
T
jvanzyl 22c091063c - fixing the lic
- applying patches submitted by David Dixon-Peugh:

I've moved some over.  (Its still in the org/apache/commons/graph
package.)

I added a package "algo" off of the graph package.  This is designed
to hold various graph algorithms.  Graphs have lots of neet things
you can do with them, unfortunately, they don't really fit neatly
into a nice OO design.  (At least I can't see a good connection.)

Changes:

Edge.java
WeightedEdge.java
(org/apache/commons/graph)

These two classes were changed to implement Comparable.  This allows
them to be sorted, and to be dropped into a PriorityQueue.

New Files:

DirectedGraph.java
UndirectedGraph.java
(org/apache/commons/graph)

There are some algorithms which demand either Directed or Undirected
graphs.  These classes allow us to have static type checking for those
algorithms.


Label.java
(org/apache/commons/graph)

There are many algorithms in graph theory which require a marking of
groups.  This label basically has some pointers which it snaps whenever
it is referenced.  It brings running times of some algorithms down close
to O(V + E) rather than O(VlgV + E).


MinimumSpanningForest.java
(org/apache/commons/graph/algo)

This file implements a MinimumSpanningForest algorithm over any graphs.
It uses a PriorityQueue from org/apache/commons/collection.


Sort.java
(org/apache/commons/graph/algo)

This file implements a Topological Sort on directed graphs.  It has some
problems if there is a back edge in the graph.  (Currently it ignores
back edges.  I hope to have it throw a BackEdgeException in the future.)


BackEdges.java
(org/apache/commons/graph/algo)

This file identifies back edges in a Directed Graph, when starting from
a particular vertex.


GraphException.java
BackEdgeException.java
(org/apache/commons/graph/exception)

These are basic exceptions that can be thrown from the graph package.


TestBackEdges.java
TestSort.java
TestMinimumSpanningTree.java

These are JUnit tests for the algorithms provided in this package.
No tests are provided for the Exceptions, Label, Directed and Undirected
classes  (Although Label really should have one.  If Label isn't
working, you get some really nasty bugs.)

--------------------------

Well, this should keep you busy for a while.

Let me know if there are any changes you would like me to make.

DDP

PR:
Obtained from:
Submitted by:
Reviewed by:


git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph/trunk@144589 13f79535-47bb-0310-9956-ffa450edef68
2002-01-16 20:38:30 +00:00

172 lines
6.0 KiB
Java

package org.apache.commons.graph.visualize;
/* ====================================================================
* The Apache Software License, Version 1.1
*
* Copyright (c) 2001 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Apache" and "Apache Software Foundation" and
* "Commons" must not be used to endorse or promote products
* derived from this software without prior written permission. For
* written permission, please contact apache@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* "Commons", nor may "Apache" appear in their name, without
* prior written permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation. For more
* information on the Apache Software Foundation, please see
* <http://www.apache.org/>.
*/
import java.io.OutputStream;
import org.apache.commons.graph.GraphConstants;
import org.apache.commons.graph.Edge;
import org.apache.commons.graph.Graph;
import org.apache.commons.graph.Sequential;
import org.apache.commons.graph.Vertex;
/**
* Visualizes directed graphs into the
* <A HREF="http://www.informatik.uni-bremen.de/~inform/forschung/daVinci/daVinci.html">
* DaVinci</A> format. It can only be used for directed graphs and does not support
* labeled edges very well, unfortunately. They have to be simulated via dummy vertices.
*
* Traverses graph with the Sequential visitor, since it uses invariants of that algorithm.
*
* @version $Id: DaVinciVisualizer.java,v 1.3 2002/01/16 20:38:30 jvanzyl Exp $
* @author <A HREF="http://www.inf.fu-berlin.de/~dahm">M. Dahm</A>
*/
public class DaVinciVisualizer extends GraphVisualizer implements GraphConstants {
private Graph graph;
private int no_edges, edges;
private int no_vertices, vertices;
/**
* @param out stream to print output to
* @param verbose toggle verbosity of output
*/
public DaVinciVisualizer(OutputStream out, int verbose) {
super(out, verbose);
}
public void discoverGraph(Graph g) {
graph = g;
no_vertices = g.getNoVertices();
vertices = 0;
out.println("[");
}
public void finishGraph(Graph g) {
out.println("]");
out.close();
}
public void discoverVertex(Vertex v) {
String label = convertString(v.toString(verbose));
//System.out.println("vertex:" + v.getIdent() + ":" + v);
println(1, "l(\"" + v.getIdent() + "\",");
println(1, "n(\"anything\", [");
println(2, "a(\"OBJECT\", \"" + label + "\"),");
println(2, "a(\"FONTSTYLE\", \"bold\"),");
println(2, "a(\"FONTFAMILY\", \"courier\")],");
println(1, "["); // array of successor nodes
no_edges = graph.getNoEdges(v);
edges = 0;
}
public void finishVertex(Vertex v) {
String str = (vertices < no_vertices - 1)? "]))," : "]))";
println(1, str);
vertices++;
}
private static int label_counter=0;
private final String getEdgeAttribute() {
if(graph.isDirected())
return "";
else
return "a(\"_DIR\", \"none\"";
}
public void discoverEdge(Edge e) {
int u = graph.getSource(e).getIdent();
int v = graph.getTarget(e).getIdent();
String label = convertString(e.toString(verbose));
if(label.equals("")) {
print(2, "l(\"" + u + "->" + v + "\", e(\"\", [" + getEdgeAttribute() +
"], r(\"" + v + "\")))");
} else { // Simulate labeled edge with intermediate node
String dummy = "label" + label_counter++; // Dummy name for intermediate node
print(2, "l(\"" + u + "->" + dummy + "\", e(\"\", [a(\"_DIR\", \"none\")], " +
"l(\"" + dummy + "\", n(\"anything\",[a(\"OBJECT\", \"" + label +
"\"), a(\"_GO\", \"text\")], [l(\"" + dummy + "->" + v +
"\", e(\"\",[" + getEdgeAttribute() + "], r(\"" + v + "\")))]))))");
//System.out.println(graph.getTarget(e).getIdent() + ":" + graph.getTarget(e));
}
}
public void finishEdge(Edge e) {
if(edges < no_edges - 1)
out.println(", ");
else
out.print('\n');
edges++;
}
/**
* Visualize graph g with this Visualizer.
*
* @param g graph to visualize
* @param start node to start at
*/
public void visualize(Graph g, Vertex start) {
new Sequential(this).start(g);
}
}