d*z
发帖数: 150 | 1
It seems true, but u have not prove it.
First it is easy to proove that if we split the graph into
two subgraph A and B,
that the count of edges from A to B is the same as the count
of edges from B to A. Because we can split all edges into
four classes. Edges from A to A, from A to B, from B to A,
and from B to B. Because the count of edges from a vertex
of A is equal to the count of edges to a vertex. That means
Count(A to A)+Count(A to B) == Count(A to A) + Count(B to
A).
If there's a vertex |
|
