please help

Revision en1, by tumaryui, 2019-03-18 17:22:06

the problem:

Given graph, find out the minimum number of edges that have to be deleted so that the given graph becomes disconnected.


The first line of input contains two integers 2 ≤ N ≤ 1000 (the number of vertices) and 1 ≤ M ≤ 2000 (the number of edges).

The following M lines describe the connections

link to the original:

Thanks in advance

Tags #graph


  Rev. Lang. By When Δ Comment
en1 English tumaryui 2019-03-18 17:22:06 458 Initial revision (published)