com.touchgraph.graphlayout.graphelements
Class GESUtils
java.lang.Object
com.touchgraph.graphlayout.graphelements.GESUtils
- public class GESUtils
- extends java.lang.Object
GESUtils is a set of functions that return information about a GraphEltSet
- Version:
- 1.21 $Id: GESUtils.java,v 1.1.1.1 2004/02/06 08:44:05 keesj Exp $
- Author:
- Alexander Shapiro
Method Summary |
static java.util.Hashtable |
calculateDistances(GraphEltSet ges,
Node focusNode,
int radius)
|
static java.util.Hashtable |
calculateDistances(GraphEltSet ges,
Node focusNode,
int radius,
int maxAddEdgeCount,
int maxExpandEdgeCount,
boolean unidirectional)
Returns a hashtable of Node-Integer pairs, where integers are the minimum
distance from the focusNode to any given Node, and the Nodes in the Hashtable
are all within radius distance from the focusNode. |
static java.util.Collection |
getLargestConnectedSubgraph(GraphEltSet ges)
A temporary function that returns the largest connected subgraph in a GraphEltSet. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
GESUtils
public GESUtils()
calculateDistances
public static java.util.Hashtable calculateDistances(GraphEltSet ges,
Node focusNode,
int radius,
int maxAddEdgeCount,
int maxExpandEdgeCount,
boolean unidirectional)
- Returns a hashtable of Node-Integer pairs, where integers are the minimum
distance from the focusNode to any given Node, and the Nodes in the Hashtable
are all within radius distance from the focusNode.
Nodes with edge degrees of more then maxAddEdgeCount are not added to the hashtable, and those
with edge degrees of more then maxExpandEdgeCount are added but not expanded.
If unidirectional is set to true, then edges are only follewed in the forward direction.
calculateDistances
public static java.util.Hashtable calculateDistances(GraphEltSet ges,
Node focusNode,
int radius)
getLargestConnectedSubgraph
public static java.util.Collection getLargestConnectedSubgraph(GraphEltSet ges)
- A temporary function that returns the largest connected subgraph in a GraphEltSet.
Copyright © 2003-2004 SourceForge. All Rights Reserved.