Содержание
- 2. Definitions Bridge – an edge of a graph whose deletion increases the number of connected components.
- 3. Example - Bridges
- 4. Example – Cut Vertices
- 5. Definitions for Depth-First-Search in undirected graph Tree edge – edge to unvisited vertex. Back edge –
- 6. Algorithm - Bridges
- 7. Implementation - Bridges void dfs(int v, int p = -1) { used[v] = true; tin[v] =
- 8. Algorithm – Cut Vertices
- 9. Implementation – Cut Vertices void dfs(int v, int p = -1) { used[v] = true; tin[v]
- 11. Скачать презентацию