Representing Special Graphs
This generated surface maps a learner-facing curriculum unit to its canonical source routes.
Curriculum surface
- Open learner-facing unit
- Curriculum path:
content/curriculum/foundations/semester-02-algorithms/module-03-graph-algorithms/concepts/cluster-01-graph-models-and-representations/03-representing-special-graphs-supporting.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-03-graph-algorithms - Unit kind:
concept - Curation level:
generated_default
Learning objectives
- Explain Representing Special Graphs in the language of the current curriculum, not just the source book.
- Apply Representing Special Graphs to one concrete learner task or example inside this semester.
- Use
competitive-programming,introduction-to-algorithms-clrs,the-algorithm-design-manualas a selective source of truth when the learner-facing explanation is not enough.
Prerequisites
- The earlier concept pages and practice tasks in the current module.
Source books
competitive-programmingintroduction-to-algorithms-clrsthe-algorithm-design-manual
Source routes
Competitive Programming
- /books/competitive-programming/chapter-04-overview-and-motivation via
Competitive Programming 4.7.1: Directed acyclic graphs,Competitive Programming 4.7.2: Tree,Competitive Programming 4.7.4: Bipartite graphs,Competitive Programming 4.7: Special graphs
Introduction To Algorithms Clrs
- /books/introduction-to-algorithms-clrs/chapter-05-the-hiring-problem via
CLRS Appendix B.5: Trees