该博客讨论了一种简单的有向图问题，要求在保持图简单的情况下，找出最多能添加多少条边而不形成强连通图。给出了输入输出格式及样例，并提出了思路：首先计算最大可能的边数，然后考虑如何确保添加边后不形成强连通图，即通过强连通分量的性质减少边数。最后提到了利用 Tarjan 算法和缩点来解决这个问题。
Strongly connected
Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple directed graph. Also, after you add these edges, this graph must NOT be strongly connected.
A simple directed graph is a directed graph having no multiple edges or graph loops.
A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they point.
Input
The first line of date is an integer T, which is the number of the text cases.
Then T cases follow, each case starts of two numbers N and M, 1<=N<=100000, 1<=M<=100000, representing the number of nodes and the number of edges, then M lines follow. Each line contains two integers x and y, means that there is a edge from x to y.
Output
最低0.47元/天 解锁文章
2208
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
