This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: GraphsGraph 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 Closuretransitive closure of G called G*use DFS for every vertex and make paths from root to every vertex reacheduse Floyd Warshal Algorithm Topological SortImplementationExamples Shortest Path Algorithm (Dijkstra)ImplementationExamples Minimum Spanning TreepropertiesPrim Jarnick AlgorithmExamples Materials to StudyClass NotesPrevius ExamsStudy GuideProjects...
View
Full
Document
This note was uploaded on 02/02/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue.
 Fall '08
 Staff
 Data Structures, Sort

Click to edit the document details