D.4: Graph Theory
From
Poul.murtha (Talk | contribs) |
m (→Discrete Math Learning modules) |
||
| Line 23: | Line 23: | ||
D.4.6 Compare and contrast different graph algorithms in terms of efficiency and | D.4.6 Compare and contrast different graph algorithms in terms of efficiency and | ||
types of problems that can be solved. | types of problems that can be solved. | ||
| + | |||
| + | <br/><br/> | ||
| + | ---- | ||
| + | {{HS Discrete Math (CS0)/ChapNav}} | ||
| + | ---- | ||
| + | [[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | ||
Revision as of 07:40, 2 August 2010
Discrete Math Learning modules
D.4 Graph Theory: Understand how graphs of vertices joined by edges can model relationships and be used to solve a wide variety of problems.
D.4.1 Use graphs to model and solve problems such as shortest paths, vertex coloring, critical paths, routing, and scheduling problems.
D.4.2 Convert from a graph to an adjacency matrix and vice versa.
D.4.3 Use directed graphs, spanning trees, rooted trees, binary trees, or decision trees to solve problems.
D.4.4 Demonstrate understanding of algorithms such as depth-first and breadth-first walk of a tree or maximal matching.
D.4.5 Use matching or bin-packing techniques to solve optimization and other problems.
D.4.6 Compare and contrast different graph algorithms in terms of efficiency and types of problems that can be solved.
