@Override public Number[] getValues(Graph graph) { DirectedGraph dgraph = (DirectedGraph) graph; List<Integer> values = new ArrayList<>(dgraph.getNodeCount()); for (Node n : dgraph.getNodes()) { int degree = dgraph.getInDegree(n); values.add(degree); } return values.toArray(new Number[0]); }
@Override public Number[] getValues(Graph graph) { DirectedGraph dgraph = (DirectedGraph) graph; List<Integer> values = new ArrayList<>(dgraph.getNodeCount()); for (Node n : dgraph.getNodes()) { int degree = dgraph.getOutDegree(n); values.add(degree); } return values.toArray(new Number[0]); }
@Override protected void refresh() { if (graph.getNodeCount() > 0) { int minV = Integer.MAX_VALUE; int maxV = Integer.MIN_VALUE; for (Node n : graph.getNodes()) { int degree = graph.getOutDegree(n); minV = Math.min(degree, minV); maxV = Math.max(degree, maxV); } min = minV; max = maxV; } } }
@Override protected void refresh() { if (graph.getNodeCount() > 0) { int minV = Integer.MAX_VALUE; int maxV = Integer.MIN_VALUE; for (Node n : graph.getNodes()) { int degree = graph.getInDegree(n); minV = Math.min(degree, minV); maxV = Math.max(degree, maxV); } min = minV; max = maxV; } } }
@Override public Number[] getValues(Graph graph) { DirectedGraph dgraph = (DirectedGraph) graph; List<Integer> values = new ArrayList<>(dgraph.getNodeCount()); for (Node n : dgraph.getNodes()) { int degree = 0; for (Edge e : dgraph.getOutEdges(n)) { if (dgraph.getMutualEdge(e) != null) { degree++; } } values.add(degree); } return values.toArray(new Number[0]); }
NodeIterable iter = graph.getNodes(); for (Node u : iter) { if (index[indices.get(u)] == 0) {
for (Node node : graph.getNodes()) { distances.put(node, Double.POSITIVE_INFINITY); nodeCount++;