ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

556 results

Zach's Math Zone
Graph Theory: What is a Strongly Connected Directed Graph?

In this video I explain the concept of a strongly connected directed graph, including an example.

2:46
Graph Theory: What is a Strongly Connected Directed Graph?

461 views

6 months ago

Aaron Cantu
Kosaraju's Algorithm

Video made by Aaron Cantu for CSCI 274.

9:03
Kosaraju's Algorithm

100 views

3 months ago

Mohammad Maaz Khan
Tarjans Algorithm For Finding Bridges Visualization

Tarjans Algorithm For Finding Bridges Visualization https://cp-algorithms.com/graph/bridge-searching-online.html.

0:34
Tarjans Algorithm For Finding Bridges Visualization

40 views

8 months ago

ManxKatze
CS6515 Lecture12 GR1 Strongly Connected Components

... of connected components in directed graphs and then we'll see an application of our strongly connected component algorithm ...

1:02:05
CS6515 Lecture12 GR1 Strongly Connected Components

38 views

7 months ago

Code & Canvas
Tarjan’s Algorithm Explained | Strongly Connected Components (SCCs) in Graphs

In this video, we'll dive deep into Tarjan's Algorithm – one of the most efficient ways to find Strongly Connected Components ...

26:28
Tarjan’s Algorithm Explained | Strongly Connected Components (SCCs) in Graphs

245 views

4 months ago

AmCan Tech
Topological Sort and Strongly Connected Components

This podcast reviews key concepts related to Depth First Search (DFS) algorithm and its application in topological sorting and ...

14:04
Topological Sort and Strongly Connected Components

23 views

11 months ago

Page Code
Strongly Connected Components (SCC) | Graph Theory Explained with Examples

Strongly Connected Components (SCC) | Graph Theory Explained with Examples strongly connected components | SCC graph ...

13:43
Strongly Connected Components (SCC) | Graph Theory Explained with Examples

38 views

7 months ago

Pulkit Malhotra
Tarjan's Algorithm | Strongly Connected Component | Graph Theory | Level 2 | Connectivity in Graph

Problem: https://www.geeksforgeeks.org/problems/strongly-connected-component-tarjanss-algo-1587115621/1 Code: ...

16:17
Tarjan's Algorithm | Strongly Connected Component | Graph Theory | Level 2 | Connectivity in Graph

32 views

1 month ago

vlogize
How to Compute Strongly Connected Components (SCCs) Using Kosaraju's Algorithm

Learn how to utilize `Kosaraju's Algorithm` to efficiently compute strongly connected components (SCCs) in directed graphs, ...

2:02
How to Compute Strongly Connected Components (SCCs) Using Kosaraju's Algorithm

11 views

3 months ago

Pulkit Malhotra
Kosaraju’s Algorithm | Strongly Connected Component | Graph Theory | Level 2 | Connectivity in Graph

Problem: https://www.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1 Code: ...

10:58
Kosaraju’s Algorithm | Strongly Connected Component | Graph Theory | Level 2 | Connectivity in Graph

27 views

1 month ago

Page Code
Find All Strongly Connected Components | Extended Kosaraju’s Algorithm | C++ Code

Find All Strongly Connected Components | Extended Kosaraju's Algorithm | C++ Code strongly connected components | find SCC ...

6:27
Find All Strongly Connected Components | Extended Kosaraju’s Algorithm | C++ Code

31 views

7 months ago

Anna Thomas
Strongly Connected Components in DG, Topological Sorting | CST306 | AAD MODULE 2 | KTU | Anna Thomas

AAD MODULE 2 Lecture Video 8 Link to the whiteboard: https://drive.google.com/drive/folders/15UlGwI0Gqk22UGfQwB-ZnpR9X ...

20:18
Strongly Connected Components in DG, Topological Sorting | CST306 | AAD MODULE 2 | KTU | Anna Thomas

7,807 views

8 months ago

Harsh
Flight Routes Check | CSES Graphs | Strongly Connected Components (SCC)

CSES Problem: Flight Routes Check In this video, we break down the Flight Routes Check problem from the CSES Graphs ...

48:13
Flight Routes Check | CSES Graphs | Strongly Connected Components (SCC)

26 views

1 month ago

Computer Science with Rahul
Strongly Connected Components and Algorithm | DFS  with discover and finish time

What is strongly connected components? Max strongly connected components . Time complexity analysis.

18:00
Strongly Connected Components and Algorithm | DFS with discover and finish time

7 views

1 month ago

Next LVL Programming
Why Does Kosaraju Algorithm Work? - Next LVL Programming

Why Does Kosaraju Algorithm Work? In this video, we will take a closer look at the Kosaraju algorithm, a method designed to ...

3:11
Why Does Kosaraju Algorithm Work? - Next LVL Programming

45 views

10 months ago

vlogize
How to Check if a Directed Graph is Strongly Connected Using Adjacency List?

Discover a straightforward method to determine if a directed graph represented by an adjacency list is strongly connected.

2:00
How to Check if a Directed Graph is Strongly Connected Using Adjacency List?

4 views

8 months ago

codingX krishna
Strongly Connected Components (SCC) Algorithm Explained in Java | Kosaraju’s Algorithm

In this video, I explain how to find Strongly Connected Components (SCCs) in a directed graph using Kosaraju's Algorithm, ...

19:45
Strongly Connected Components (SCC) Algorithm Explained in Java | Kosaraju’s Algorithm

47 views

7 months ago

Maddy Zhang
More DS&A, today explaining Tarjan’s algorithm!

More in the DS&A series, today explaining Trajan's algorithm to find strongly connected components of a graph!

0:59
More DS&A, today explaining Tarjan’s algorithm!

3,308 views

3 months ago

Ramkrishna Sharma
Strongly Connected Components - SCC algorithm

Hi my name is Rahm and I'd like to go over strongly connected components and the idea is that if you have a larger graph there ...

3:04
Strongly Connected Components - SCC algorithm

11 views

3 days ago

Harsh
Coin Collector | CSES Graphs | Strongly Connected Components (SCC)

CSES Problem: Coin Collector In this video, we discuss the Coin Collector problem from the CSES Graphs section. This problem ...

25:41
Coin Collector | CSES Graphs | Strongly Connected Components (SCC)

10 views

1 month ago