Graph Theory Algorithms

Learn complete overview of graph theory algorithms in computer science and mathematics.

Graph Theory Algorithms

Learn complete overview of graph theory algorithms in computer science and mathematics.
353
views
7
Saved
Share the link to this page
Copied
Share the link to this page
Copied
This is a free class
$0.00
د.إ0.00
A$0.00
৳0.00
Лв0.00
CA$0.00
CHF 0.00
kr0.00
€0.00
£0.00
HK$0.00
₪0.00
₹0.00
₩0.00
RM0.00
₦0.00
kr0.00
NZ$0.00
₱0.00
₨0.00
S$0.00
฿0.00
₺0.00
B$0.00
R0.00

About the Class

This course provides a complete introduction to Graph theory algorithms in computer science.

What will you learn in this course?

  • How to store and represent graphs on a computer?
  • Common graph theory problems seen in the wild.
  • Famous graph traversal algorithms (DFS & BFS).
  • Dijkstra's shortest path algorithm (both the lazy and eager version).
  • What a topological sort is, how to find one, and places it's used?
  • Learning about detecting negative cycles and finding shortest paths with the Bellman-Ford and Floyd-Warshall algorithms.
  • Discovering bridges and articulation points in graphs.
  • Understanding and detecting strongly connected components with Tarjan's algorithm.
  • Solving the traveling salesman problem with dynamic programming.

Author

William Fiset

Software Engineer
Share the instructor profile
Copied
Hello! My name is William, I am a software engineer at Google stationed in Mountain View California. I am a former ACM-ICPC world finalist and avid problem solver looking to share my knowledge of computer programming and problem solving. I teach courses on TabletWise/Youtube because there exists a need to create high quality content about...

Class Requirements

  • You should know computer science fundamentals (e.g., data structures, recursion, data types, classes, OOP).
  • You should have some prior programming knowledge.

What's Included

Language: English
Level: All levels
Skills: Depth First Search Algorithm, Breadth First Search Algorithm, Topological Sort Algorithm, Graph Theory, Tarjan's Algorithm, Storaging Graphs (networks), Algorithm, Floyd-Warshall, Articulation Points, Dijkstra's Algorithm, Bellman Ford's Algorithm, Finding Bridges, Acyclic Graph, Travelling Salesman Problem (TSP)
Age groups: All ages
Duration: 6 hours 31 minutes
32 Videos
7
Saves
353
Views
This class has not been saved

Sign Up

Share

Share with friends, get 20% off
Invite your friends to LearnDesk learning marketplace. For each purchase they make, you get 20% off (upto $10) on your next purchase.