Exam 2 Algorithms - Graph Connectivity and Max Flow
DFS - Input - ANSWER-a graph, G = (V, E) DFS- Output - ANSWER-vertices labeled with pre/post order numbers DFS - Runtime - ANSWER-O(|V|+|E|) Explore - Input - ANSWER-a graph, G = (V, E) and a starting vertex v Explore - Output - ANSWER-visited[u] is set to true for all vertices reachable from v Explore - Runtime - ANSWER-O(|E|) SCC - Input - ANSWER-a graph G = (V, E) SCC - Output - ANSWER-SCCs of G in reverse topological order (sink is output first) SCC - Runtime - ANSWER-O(|V| + |E|) Kruskal - Input - AN
Geschreven voor
- Instelling
- Eam 2 Algorithms - Graph Connectivity and Max Flo
- Vak
- Eam 2 Algorithms - Graph Connectivity and Max Flo
Documentinformatie
- Geüpload op
- 20 maart 2024
- Aantal pagina's
- 2
- Geschreven in
- 2023/2024
- Type
- Tentamen (uitwerkingen)
- Bevat
- Vragen en antwoorden
Onderwerpen
-
exam 2 algorithm
-
exam 2 algorithms graph connectivity and max flo
Ook beschikbaar in voordeelbundel