TreesGiven: an undirected graph.
How many edges must you remove to make it a tree? (or a forest of trees?)
N ≤ 1000.
OutputThe minimum number of edges you have to remove.
3 0 1 1 1 0 1 1 1 0
Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M
Added: Jun 28, 2013
- Graph Theory
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3