1.

How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?

A. M+N-C
B. M-N-C
C. M-N+C
D. M+N+C
Answer» D. M+N+C


Discussion

No Comment Found