#### CSC252a

Fall 2000

Ileana Streinu

#
Lecture 16

- Finish Topological sorting. Implementation of "zero
in-degree" algorithm in linear time. Topological sorting based on
DFS.
- Breadth-first search (BFS). Application: deciding if a graph
is bipartite.
- Biconnected components. Characterization theorem for cut
points. Next Th we'll finish the algorithm for biconnected
components, which is based on this theorem and on an application
of DFS.