Tutorialspoint

10th Anniversary Sale Use code GRAND10 for extra 10% off

Graph Theory Algorithms

person icon William Fiset

4.2

Graph Theory Algorithms

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

updated on icon Updated on Jun, 2024

language icon Language - English

person icon William Fiset

English [CC]

category icon Teaching & Academics,Engineering,Algorithms

Lectures -33

Duration -6.5 hours

4.2

price-loader

Training 5 or more people ?

Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.

Course Description

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

Topics covered in these videos include: 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, and finally solving the travelling salesman problem with dynamic programming.

Who this course is for:

  • Anybody ready for a deep dive into graph theory

Goals

  • Storage and representation of graphs (networks) on a computer
  • Common graph theory problems
  • Breadth first search algorithm
  • Depth first search algorithm
  • Dijkstra's algorithm
  • Topological sort algorithm
  • Shortest/longest path on a acyclic graph
  • Bellman Ford's algorithm
  • Floyd-Warshall all pairs shortest path algorithm
  • Finding bridges/articulation points
  • Finding strongly connected components (Tarjan's)
  • Travelling salesman problem (TSP)

Prerequisites

  • Exposure to computer science fundamentals (e.g: data structures, recursion, data types, classes, OOP)
  • Some prior programming knowledge
Graph Theory Algorithms

Curriculum

Check out the detailed breakdown of what’s inside the course

Graph Theory Algorithms
32 Lectures
  • play icon Graph Theory Introduction 14:24 14:24
  • play icon Problems in Graph Theory 09:59 09:59
  • play icon Depth First Search algorithm 10:39 10:39
  • play icon Breadth First Search algorithm 07:45 07:45
  • play icon Breadth First Search grid shortest path 16:50 16:50
  • play icon Dijkstra's shortest path algorithm 24:31 24:31
  • play icon Dijkstra's shortest path algorithm | source code 09:11 09:11
  • play icon Topological sort algorithm 14:04 14:04
  • play icon Shortest/longest path on a Directed Acyclic Graph (DAG) 10:14 10:14
  • play icon Bellman-Ford algorithm 15:16 15:16
  • play icon Floyd-Warshall all pairs shortest path algorithm 15:55 15:55
  • play icon Floyd-Warshall all pairs shortest path algorithm | source code 09:28 09:28
  • play icon Bridges & Articulation points 20:16 20:16
  • play icon Bridges & Articulation points | source code 09:22 09:22
  • play icon Tarjan's strongly connected components algorithm 17:00 17:00
  • play icon Tarjan's strongly connected components algorithm | source code 07:11 07:11
  • play icon Travelling Salesman problem 20:48 20:48
  • play icon Travelling Salesman problem | source code 13:32 13:32
  • play icon Existence of Eulerian path and circuits 09:40 09:40
  • play icon Eulerian path algorithm 15:34 15:34
  • play icon Eulerian path source code 08:17 08:17
  • play icon Max Flow Ford Fulkerson | Network Flow 13:05 13:05
  • play icon Max Flow Ford Fulkerson | source code 17:28 17:28
  • play icon Unweighted bipartite matching | Network flow 11:21 11:21
  • play icon Mice and Owls | Network Flow 08:27 08:27
  • play icon Elementary Math | Network Flow 10:44 10:44
  • play icon Edmonds Karp | Network Flow 09:31 09:31
  • play icon Edmonds Karp | Network Flow | Source Code 05:47 05:47
  • play icon Capacity Scaling | Network Flow 10:09 10:09
  • play icon Capacity Scaling | Network Flow | Source Code 06:23 06:23
  • play icon Dinic's Algorithm | Network Flow 11:39 11:39
  • play icon Dinic's Algorithm | Network Flow | Source Code 09:26 09:26

Instructor Details

William Fiset

William Fiset


Course Certificate

Use your certificate to make a career change or to advance in your current career.

sample Tutorialspoint certificate

Our students work
with the Best

Related Video Courses

View More

Annual Membership

Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses

Subscribe now
Annual Membership

Online Certifications

Master prominent technologies at full length and become a valued certified professional.

Explore Now
Online Certifications

Talk to us

1800-202-0515