Unified Typesetting API M1-20040817

de.inghuimische.uta.util
Class JDigraphAdapter

java.lang.Object
  extended byde.inghuimische.uta.util.JDigraphAdapter
All Implemented Interfaces:
GraphAdapter

public class JDigraphAdapter
extends Object
implements GraphAdapter

The adapter that connects UTA with the JDigraph library. This library is available under the BSD license (see http://jdigraph.sourceforge.net and license below).

This is the current default adapter. I have also implemented adapters for the JGraphT library (tested & works, LGPL) as well as for the Jung library (not tested at all, BSD license). These are not included in the official distribution but available on request.

Future versions of UTA may or may not do their own shortest path calculation. This would remove some overhead. Currently I'm just to lazy (apart from the lean time) to write my own algorithm.

JDigraph is redistributed in binary from, so here the license:

 Copyright (c) 2001, 2002, 2003 David Walend 
 All rights reserved.

 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions are met:
 
 Redistributions of source code must retain the above copyright notice, this
 list of conditions and the following disclaimer.
 
 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.
 
 Neither the name of the JDigraph Project, walend.net, nor the names of its
 contributors may be used to endorse or promote products derived from this
 software without specific prior written permission from David Walend. 
 
 Credits in redistributions in source or binary forms must include a link to
 http://jdigraph.sourceforge.net .
 
 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 ``AS IS'' AND ANY EXPRESS 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 REGENTS OR 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.
 
 =================================================================================
 
 For more information and the latest version of this software, please see
 http://jdigraph.sourceforge.net and David Walend
 dfw1@cornell.edu.
 

Author:
Christian Ziesemer

Field Summary
protected  net.walend.measured.CEPathMeter pathMeter
           
protected  net.walend.digraph.MutableLMCEDigraph realGraph
           
 
Constructor Summary
JDigraphAdapter()
           
 
Method Summary
 UTAGraph getGraph()
          Returns the graph to put nodes in.
 ShortestPathAlgorithm getShortestPathAlgorithm()
          Returns the shortest path algorithm to use when searching for the shortest path.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

realGraph

protected net.walend.digraph.MutableLMCEDigraph realGraph

pathMeter

protected net.walend.measured.CEPathMeter pathMeter
Constructor Detail

JDigraphAdapter

public JDigraphAdapter()
Method Detail

getGraph

public UTAGraph getGraph()
Description copied from interface: GraphAdapter
Returns the graph to put nodes in.

Specified by:
getGraph in interface GraphAdapter
Returns:
The graph to put nodes in.

getShortestPathAlgorithm

public ShortestPathAlgorithm getShortestPathAlgorithm()
Description copied from interface: GraphAdapter
Returns the shortest path algorithm to use when searching for the shortest path.

Specified by:
getShortestPathAlgorithm in interface GraphAdapter
Returns:
The shortest path algorithm to use when searching for the shortest path.

Unified Typesetting API M1-20040817


An inghuimische.de project.
Copyright (C) 2004 Christian Ziesemer; See the Mozilla Public License for more details.