auto g1 = Graph!(int, void, Yes.isDirected)([1, 2, 3]); g1 ~= g1.edge(1, 1); g1 ~= g1.edge(1, 2); g1 ~= g1.edge(2, 2); g1 ~= g1.edge(2, 3); assert(g1.inDegree(1) == 1); assert(g1.outDegree(1) == 2); assert(g1.inDegree(2) == 2); assert(g1.outDegree(2) == 2); assert(g1.inDegree(3) == 1); assert(g1.outDegree(3) == 0);
Get the in/out degree of node n.