| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Remove the minimum number of edges from the following directed graph so that there exists a topological order. Draw the new graph and find the topological order using a DFS.
No. of Nodes: 9 No. of Edges: 14
Edge List: 1-4, 1-5, 2-5, 3-6, 4-9, 5-1, 5-7, 6-5, 7-4, 8-5, 9-3, 9-6, 9-7, 9-8
How can I Draw the graph?
You have to break all cycles. 5 -> 1 -> 5 is one and 4 -> 7 -> 9 -> 4 is another. So you have to remove at least one edge from each. But I don't think the solution is unique.
So, the total number of edges to remove is two?
I didn't look closely. At least 2. Draw it and check if there are any more cycles left after you break these two.