CMSC-341, Spring 1999, Sections 101 and 201
Lecture Synopsis
21. Graphs
[Previous Lecture]
[Next Lecture]
- Overview of Graph Problems
- Connectedness
- Shortest Path
- Spanning Tree
- Toplogical Sorting
- Definitions
- Graph
- Directed graph (digraph)
- Adjacent to, from
- Degree, in-degree, out-degree
- Path
- Cycle
- Acyclic graph
- Connected
- Tree
- Implementations
- Adjacency Matrix
- Adjacency List
[Previous Lecture]
[Next Lecture]
Last modified on
Tuesday April 20, 1999 (12:19:14 EDT)
by
Alan Baumgarten
email: abaumg1@cs.umbc.edu
Back up
to Spring 1999 CMSC-341 Section 1 and 2 Homepage