ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

197 results

MIT OpenCourseWare
Lecture 16: Dijkstra

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Srini Devadas ...

51:26
Lecture 16: Dijkstra

319,770 views

12 years ago

MIT OpenCourseWare
13. Dijkstra

MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Jason Ku View the complete course: https://ocw.mit.edu/6-006S20 ...

57:22
13. Dijkstra

38,362 views

4 years ago

Abdul Bari
Shortest Path Algorithms (Dijkstra and Bellman-Ford)  - Simplified

Shortest path algorithms, Dijkstra and Bellman-Ford algorithm. Algorithms explained with multiple examples, in a different way.

26:13
Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified

260,214 views

8 years ago

MIT OpenCourseWare
Lecture 18: Speeding up Dijkstra

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Srini Devadas ...

53:16
Lecture 18: Speeding up Dijkstra

108,577 views

12 years ago

Sohum Hulyalkar
Dijkstra's Intuition, Algorithm, and Runtime — Content Review

So the problem that Dijkstra's algorithm is trying to solve is that we want to find the shortest paths from a given start vertex to all ...

30:34
Dijkstra's Intuition, Algorithm, and Runtime — Content Review

900 views

3 years ago

Fundamental Algorithms: Design and Analysis
Dijkstra

... this is also order of log v, so this is basically order of v log v, okay, so this is the time complexity for Dijkstra algorithm, thank you.

29:07
Dijkstra

2,409 views

9 years ago

CS Algorithms & Challenges
743. Network Delay Time —Dijkstra (Min Heap) vs. SPFA (Queue): 🔄 Which One Should You Use?

Struggling with LeetCode 743: Network Delay Time? In this video, we explore two powerful shortest path algorithms — Dijkstra's ...

29:04
743. Network Delay Time —Dijkstra (Min Heap) vs. SPFA (Queue): 🔄 Which One Should You Use?

25 views

9 months ago

Stanford Algorithms
11   4   Dijkstra 's Algorithm  Implementation and Running Time 26 min
26:28
11 4 Dijkstra 's Algorithm Implementation and Running Time 26 min

14,300 views

8 years ago

Stanford Algorithms
11   1   Dijkstra 's Shortest Path Algorithm 21 min
20:46
11 1 Dijkstra 's Shortest Path Algorithm 21 min

18,174 views

8 years ago

MIT OpenCourseWare
Lecture 23: Computational Complexity

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...

51:12
Lecture 23: Computational Complexity

535,097 views

12 years ago

Simons Institute for the Theory of Computing
An O(n) time algorithm for finding Hamilton cycles with high probability

12th Innovations in Theoretical Computer Science Conference (ITCS 2021) http://itcs-conf.org/ An O(n) time algorithm for finding ...

23:31
An O(n) time algorithm for finding Hamilton cycles with high probability

456 views

4 years ago

Simons Institute for the Theory of Computing
MIP* = RE

Thomas Vidick (Caltech) Simons Institute 10th Anniversary Symposium In his reflections on the symposium, Prasad Raghavendra ...

56:30
MIP* = RE

2,112 views

Streamed 3 years ago

freeCodeCamp.org
Algorithms Course - Graph Theory Tutorial from a Google Engineer

This full course provides a complete introduction to Graph Theory algorithms in computer science. Knowledge of how to create ...

6:44:40
Algorithms Course - Graph Theory Tutorial from a Google Engineer

1,807,226 views

6 years ago

CS50
CS50x 2025 - Lecture 3 - Algorithms

Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, ...

2:06:35
CS50x 2025 - Lecture 3 - Algorithms

310,797 views

Streamed 1 year ago

nptelhrd
Mod-01 Lec-04 All Pair Shortest Path

Computer Algorithms - 2 by Prof. Shashank K. Mehta,Department of Computer Science and Engineering,IIT Kanpur.For more ...

1:01:16
Mod-01 Lec-04 All Pair Shortest Path

6,082 views

11 years ago

MIT OpenCourseWare
Lecture 13: Breadth-First Search (BFS)

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...

50:48
Lecture 13: Breadth-First Search (BFS)

726,089 views

12 years ago

Codebagel
Top 7 Algorithms for Coding Interviews Explained SIMPLY

Today we'll be covering the 7 most important algorithms you need to ace your coding interviews and land a job as a software ...

21:22
Top 7 Algorithms for Coding Interviews Explained SIMPLY

598,208 views

3 years ago

MIT OpenCourseWare
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...

51:47
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

2,881,083 views

12 years ago

DAA with Geeta Chhikara
# Design and analysis of Algorithms, # Important Questions on Time Complexity Analysis

Design and Analysis of Algorithms This video is important for all students of Computer Science appearing in ...

36:18
# Design and analysis of Algorithms, # Important Questions on Time Complexity Analysis

616 views

4 years ago

MIT OpenCourseWare
Lecture 17: Bellman-Ford

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Srini Devadas ...

48:51
Lecture 17: Bellman-Ford

201,576 views

12 years ago