- How to view Leda demos, look at the source code and
compile programs using Leda. Instructions
- Continue the
list of graph theoretical concepts.
- Depth First Search on directed and undirected
graphs. DFS tree (or forest).
- Linear time algorithms for deciding connectivity of an
undirected graph; finding directed cycles in a digraph; deciding
if the graph is bipartite.
- Tree edges, back edges, forward edges, cross edges. Visiting time.
- Reading: textbook, Ch. 11.4, 11.5, 11.6. Next time: 11.7