Dfs outputs - Study guides, Class notes & Summaries

DFS outputs - ANSWER-pre array, post array, ccnum array, prev array BFS outputs - ANSWER-dist array, prev array Explore outputs - ANSWER-visited array. When to use Dijkstra's? - ANSWER-Works for both directed and undirected graphs. Must have only non-negative edge weights. Dijkstra's outputs - ANSWER-dist array, prev array Dijkstra's runtime? - ANSWER-O((n+m) log n) log n is from using the min heap (to get the lowest cost weight) When to use Bellman Ford? - ANSWER-Use when there is a ...

DFS outputs - Answer-pre array, post array, ccnum array, prev array BFS outputs - Answer-dist array, prev array Explore outputs - Answer-visited array When to use Dijkstra's? - Answer-Use on both directed and undirected graphs to find the shortest path from a source vertex to all other reachable vertices in the graph. Must have only non-negative edge weights. Dijkstra's outputs - Answer-dist array, prev array Dijkstra's time complexity - Answer-O((n+m) log n) log n is from using the m...

CS6515 Exam 2 Material Questions And 100% Correct Answers

Problem 1 1. Given an algorithm taking inputs (a) G = (V; E) a connected, undirected graph (b) w : E ! Z+ a weight function (c) T ⊆ E, a MST of G (d) e1 = fu; vg 62 E, an edge no in G (e) w1 2 Z+, a weight for e1 and outputs a MST T1 for G1 = (V; E [ fe1g) with w(e1) = w1. For full marks, your algorithm must be more efficient than computing a MST for G1 from scratch. Justify that this is the case by analysing your algorithms worst-case running time. Finally, write a detailed proof that your al...