1. Some graphs you may have met under different circumstances.

2. Course prerequisites
Topological sort gives order to take classes

3. Maze

4. Depth first search – Web as graph
Avoid loops: don’t repeat nodes.
Use some kind of Set ADT

5. Electronic circuits Edges labelled (resistors, switch, etc)
Analyze Zasha’s incompetence in EE

6. Programs – unreachable code
main function
printf(“hello world”)
BitStream
WriteBit
ReadBit
FlushBits
GotoBitnum
class Huffman
BuildTree
SaveToFile
LoadFromFile
class Heap
DeleteMin
Insert
RemoveAll

7. (small part of) Java class hierarchy

8. Computer Networks

9. TA assignments Bipartite graph – 2 types (TAs and Courses)
Maximal matching (only 3 courses have TAs, only 3 TAs used)

10. Six degrees of Kevin Bacon

11. Six degrees of Kevin Bacon