Floyd warshall algorithm - Study guides, Class notes & Summaries

How do you tell if a graph has negative edges? - ANSWER-when fitting graph on a table, if the number of moves decreases the w() from edge to edge, then there is a negative edge; check from 1 to n Why are all pairs Dist(y,z) n^2? - ANSWER-Because it builds a two dim table! What is the run time of bellman ford algorithm? How about if you had to do it for all edges? - ANSWER-O(nm) O(n^2m) Floyd-Warshall run time? - ANSWER-O(n^3) What is the base case for the bellman ford algorithm? - ANSWE...

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...

Question: 01. Which type of connectivity is required for VPLS? a) full mesh b) partial mesh c) star d) bus e) ring Answer: a) full mesh Question: 02. EIGRP uses which algorithm to build a routing table? a) Dijkstra's algorithm b) Floyd-Warshall algorithm c) Diffusing Update Algorithm d) Johnson's algorithm Answer: c) Diffusing Update Algorithm Question: 03. What is the purpose of an OTV edge device? a) connect to other data centers b) con...

Explore a comprehensive collection of Data Structures and Algorithms notes, thoughtfully curated to boost your understanding of fundamental computer science concepts. Delve into efficient data organization, search, and manipulation techniques. Gain insights into algorithmic paradigms, sorting, searching, and graph traversal strategies. Elevate your problem-solving prowess and coding skills through concise, clear, and well-structured notes. Unveil the secrets of optimized code and unleash your po...