@Test public void degree_isolatedNode() { addNode(N1); assertThat(graph.degree(N1)).isEqualTo(0); }
@Test public void degree_nodeNotInGraph() { try { graph.degree(NODE_NOT_IN_GRAPH); fail(ERROR_NODE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertNodeNotInGraphErrorMessage(e); } }
@Override public int degree(N node) { checkNotNull(node, "node"); checkArgument(delegate.nodes().contains(node), NODE_NOT_IN_TREE, node); return delegate.degree(node); }
protected MutableGraph<N> initializeGraph() { MutableGraph<N> graph = GraphBuilder.undirected().build(); nodes = new ArrayList<N>(nodeCount); for (int i = 0; i < nodeCount; i++) { N node = nodeFactory.get(); graph.addNode(node); nodes.add(node); } while (graph.edges().size() < edgeCount) { N u = nodes.get((int) (mRandom.nextDouble() * nodeCount)); N v = nodes.get((int) (mRandom.nextDouble() * nodeCount)); if (!u.equals(v)) { // no self-loops graph.putEdge(u, v); } } double maxDegree = 0; for (N v : graph.nodes()) { maxDegree = Math.max(graph.degree(v), maxDegree); } mMaxDegree = maxDegree; return graph; }
@Test public void degree_isolatedNode() { addNode(N1); assertThat(graph.degree(N1)).isEqualTo(0); }
@Test public void degree_nodeNotInGraph() { try { graph.degree(NODE_NOT_IN_GRAPH); fail(ERROR_NODE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertNodeNotInGraphErrorMessage(e); } }