140 likes | 147 Views
Some graphs you may have met under different circumstances. Course prerequisites. Topological sort gives order to take classes. Maze. Depth first search – Web as graph. Avoid loops: don’t repeat nodes. Use some kind of Set ADT. Electronic circuits. Edges labelled (resistors, switch, etc)
E N D
Course prerequisites • Topological sort gives order to take classes
Depth first search – Web as graph • Avoid loops: don’t repeat nodes. • Use some kind of Set ADT
Electronic circuits • Edges labelled (resistors, switch, etc) • Analyze Zasha’s incompetence in EE
Proofs – best case correct sorting by comparison • List is x1,…,x8 • Edge is comparison • <7 edges graph not connected • Connected componentscould be on either side.How would the algorithmknow?
TA assignments • Bipartite graph – 2 node types (TAs and Courses) • Maximal matching (assign as many TAs to as many courses as possible)