CMSC-341, Spring 1999, Sections 101 and 201
Lecture Synopsis
25. Disjoint Set
[Previous Lecture]
[Next Lecture]
- A few more things about graphs:
- Definitions (for directed graphs)
- Strongly connected
- Weakly connected
- Proofs (for undirected graphs)
- The sum of the degrees of all vertices is equal to twice the
number of edges.
- The number of vertices with odd degree is even.
- Disjoint Set ADT
- Description of data elements (disjoint sets)
- Operations
[Previous Lecture]
[Next Lecture]
Last modified on
Tuesday May 4, 1999 (17:40:04 EDT)
by
Alan Baumgarten
email: abaumg1@cs.umbc.edu
Back up
to Spring 1999 CMSC-341 Section 1 and 2 Homepage