本文整理汇总了Java中edu.uci.ics.jung.graph.Hypergraph.getSuccessors方法的典型用法代码示例。如果您正苦于以下问题：Java Hypergraph.getSuccessors方法的具体用法？Java Hypergraph.getSuccessors怎么用？Java Hypergraph.getSuccessors使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类edu.uci.ics.jung.graph.Hypergraph的用法示例。
在下文中一共展示了Hypergraph.getSuccessors方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: labelDistances
import edu.uci.ics.jung.graph.Hypergraph; //导入方法依赖的package包/类
/**
* Computes the distances of all the node from the starting root nodes. If there is more than one root node
* the minimum distance from each root node is used as the designated distance to a given node. Also keeps track
* of the predecessors of each node traversed as well as the order of nodes traversed.
* @param graph the graph to label
* @param rootSet the set of starting vertices to traverse from
*/
public void labelDistances(Hypergraph<V,E> graph, Set<V> rootSet) {
initialize(graph,rootSet);
int distance = 1;
while (true) {
List<V> newList = new ArrayList<V>();
for(V currentVertex : mCurrentList) {
if(graph.containsVertex(currentVertex)) {
for(V next : graph.getSuccessors(currentVertex)) {
visitNewVertex(currentVertex,next, distance, newList);
}
}
}
if (newList.size() == 0) break;
mCurrentList = newList;
distance++;
}
for(V v : mUnvisitedVertices) {
distanceDecorator.put(v,new Integer(-1));
}
}