有没有办法以确定的顺序遍历 Guava Graph?
我试图通过这个测试来做到这一点:
import com.google.common.graph.ElementOrder;
import com.google.common.graph.Graph;
import com.google.common.graph.GraphBuilder;
import com.google.common.graph.Traverser;
import java.util.Random;
public class TestGraph {
private static final Random random = new Random();
static class Node { //Node class with volatile hashcode
private final int hashcode = random.nextInt();
private final String name;
public Node(String name) {this.name = name; }
@Override public String toString() {return name; }
@Override public int hashCode() {return hashcode;}
}
public static void main(String argv[]) {
Node root = new Node("root");
Graph<Node> graph = GraphBuilder.directed()
.nodeOrder(ElementOrder.insertion())
.<Node>immutable()
.putEdge(root, new Node("one"))
.putEdge(root, new Node("two"))
.putEdge(root, new Node("three"))
.build();
//Print the nodes in traversal order.
Traverser.forGraph(graph).depthFirstPostOrder(root)
.forEach(x->System.out.println(x));
}
}
每次它以不同的顺序进行评估。我认为根本原因是图表后继者没有排序。