Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data. Trees and Graphs: Basics can be taken for academic credit as part of CU Boulder鈥檚 Master of Science in Data Science (MS-DS) degree offered on the 糖心vlog官网观看 platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder鈥檚 departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at /degrees/master-of-science-data-science-boulder.
Graphs and Their Representations
Loading...
Skills You'll Learn
Computational Thinking, Algorithms, Tree Maps, Graph Theory, Network Analysis, Data Structures, Analysis, Python Programming
Reviews
4.6 (163 ratings)
- 5 stars75.46%
- 4 stars17.17%
- 3 stars4.29%
- 2 stars1.22%
- 1 star1.84%
HG
May 3, 2023
This course is definitely hard but for some good reason. It stretches the mind of the learner/student to achieve algorithmic nirvana.
MH
Jan 2, 2023
Excellent content. Lectures along with textbook provide student with working knowledge of trees and graphs.
From the lesson
Basics of Graphs and Graphs Traversals
In this module, you will learn about graphs and various basic algorithms on graphs such as depth first/breadth first traversals, finding strongly connected components, and topological sorting.
Taught By
Sriram Sankaranarayanan
Professor