Learn · NPTEL

Course10610846837 lectures

Introduction to Graph Algorithms

Prof. C Pandu Rangan · IISc Bangalore

Start with lecture 1 At NPTEL

About

A Computer is basically an information processing system and this means it can be used for solving only abstract mathematical problems. That is why, solving a Real World Problem (RWP) by using a computer, begins with a formulation of the RWP as a Mathematical problem in an appropriate mathematical domain. For example, privacy and security problems are formulated as cryptographic problems in Number Theory, Elliptic Curves and Linear Algebra.

Mathematical domains such as combinatorics, Geometry, Sets and Relations, Number Theory, Stringology and Graph Theory are among most frequently used domains to arrive at mathematical problems that are equivalent to the real-world problems.

In this course we focus on basic graph algorithms. Problems arising in communication networks, social networks and transportation networks are naturally modelled as problems on graphs. Graph algorithms are among the extensively investigated and applied topics in computer science.

Intended audience: UG/PG Students

Prerequisites: Discrete Mathematics, Graph Theory, Basics of Programming and Data Structures

Lectures

Week 1 Introduction and Principles of Algorithms

  1. Introduction and Principles of Algorithms YouTube
  2. Principles of Algorithms (Part 2) YouTube
  3. Introduction to Graphs YouTube
  4. Undirected Graph YouTube

Week 2 Shortest Path Algorithms and problems

  1. Algorithms for finding Shortest Path YouTube
  2. Algorithms for finding Shortest Path Part 2 YouTube
  3. Single source shortest path problem YouTube
  4. Properties of shortest path distances YouTube
  5. Properties of shortest path distances Part 2 YouTube

Week 3 Bellman Equations

  1. Belman Equation YouTube
  2. Shortest Path Trees YouTube
  3. Bounded Walks and Paths YouTube
  4. Bounded Walks and Paths 2 YouTube

Week 4 Bellman Ford and Dijkstra Algorithm

  1. Bellman Ford P1 YouTube
  2. Bellman Ford P2 YouTube
  3. Dijkstra Algorithm YouTube
  4. Dijkstra Algorithm P2 YouTube
  5. Dijkstra Algorithm P3 YouTube

Week 5 All Pair Shortest Path

  1. All Pair Shortest Path YouTube
  2. All Pair Shortest Path 2 YouTube
  3. All Pair Shortest Path 3&4 YouTube
  4. All Pair Shortest Path 5 YouTube

Week 6 Prims and Kruskal's Algorithm

  1. Prims Algorithm YouTube
  2. Prims Algorithm P2 YouTube
  3. Kruskal's Algorithm YouTube
  4. Kruskal's Algorithm 2 YouTube
  5. Kruskal's Algorithm 3 YouTube

Week 7 DFS and Cut Vertex

  1. DFS YouTube
  2. DFS YouTube
  3. Algorithm for Cut Vertex YouTube
  4. Iterative DFS YouTube
  5. DFS in Directed Graph YouTube

Week 8 Strong Connected Components & BFS

  1. Strong Connected Components YouTube
  2. Strong Connected Components Part 2 YouTube
  3. Strong Connected Components Part 3 YouTube
  4. Strong Connected Components Part 4 YouTube
  5. BFS YouTube

Syllabus and materials

At NPTEL, as the course publishes them.

Credits and licence

Institution
IISc Bangalore
Department
Computer Science and Engineering
Teacher
Prof. C Pandu Rangan
Level
Undergraduate
Language
English
Subjects
Computer science, Engineering
Source
NPTEL
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed