This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Graphs-Graph Terminology a. Adjacent vertices, degree of vertex b. Path, simple path, cycle, connected graph- Complete Graph- Spanning Tree- Data Structures for graphs a. edge list b. adjacency list c. adjacency matrix- Depth First Search a. recursive b. use a stack- Breadth First Search a. visit vertices at a distance of 1, then 2, then 3, b. use a queue Transitive Closure-transitive closure of G called G*-use DFS for every vertex and make paths from root to every vertex reached-use Floyd Warshal Algorithm Topological Sort-Implementation-Examples Shortest Path Algorithm (Dijkstra)-Implementation-Examples Minimum Spanning Tree-properties-Prim Jarnick Algorithm-Examples Materials to Study-Class Notes-Previus Exams-Study Guide-Projects...
View Full Document