G-1. Introduction to Graph | Types | Different Conventions Used

In case you are thinking to buy courses, please check below:

---------------------------------------------------------------------------------------------------------------------------

[takeUforward]

Lets continue the habit of commenting “understood” if you got the entire video.

Do follow me at Instagram: striver_79

[rishusingh]

I have completed entire dp series, tree series and now i have completed this whole series and i have just come back to give feed back of all the series .LOOK ON THE ENTIRE YOUTUBE NO ONE CAN TEACH DSA BETTER THAN HIM AND HIS SERIES ON GRAPH, DP, TREE ARE PURE GOLD AND I HAD TAKEN 10000+ PAID COURSES NO ONE CAN BEAT HIS SERIES.
THANK YOU STRIVER

[stith_pragya]

Thank You So Much for this wonderful video....🙏🙏🙏

[skblabla]

I am a mother of 6 year old and working as a Senior Engineer in Melbourne, I have big plans to join the top tech firms here and this channel is getting immensely helpful. As I am having very limited time in a day and I am trying to do few question per day. I have a timeline of 8 -12 months before my big move. Commenting here to know more from people like me who find very limited time to skill up and to also keep myself reminded of the 8-12 months timeline ..lol :D

[gauravpoosarla]

Thank you, Raj, for providing us with such amazing content. I have learnt all the advanced topics from your channel only. Your SDE sheet and the entire video series which you have made on various topics have helped me immensely in getting a good understanding of these topics and ultimately, I got a good placement. Once again, thank you very much!!

[TravelTracksByDebo]

Hello guys I hope you are doing good wala part is missing bhaiya 🥺🥺... rest understood bhaiya ❤️

[prajwalpraja]

Anybody starting this series just know 1 thing, THIS IS UNDENIABLY A GOLDMINE
Each and every concept is taught with utmost detail. You would not want to look into others' Graph series once you complete this.
Thank you so much Striver.

[rohanduggal]

Please don't leave YouTube your health and career comes first we understand take a long break but please don't leave 🙏🙏 you are our inspiration get well soon

[simakeshri]

Understood.. please add some question in the description related to topic of video to solve . 🙏🙏

[nitkarshchourasia]

🎯 Key points for quick navigation:

00:03 *🚀 Introduction to the graph series, covering types of graphs and their conventions.*
00:29 *🔄 Explanation of undirected graphs (no arrows) and directed graphs (with arrows).*
01:00 *🔵 Nodes or vertices are represented by numbers without a specific order.*
01:53 *🌐 Edges connect nodes and can be undirected (bi-directional) or directed.*
02:34 *📊 An undirected graph has edges that can go in both directions between nodes.*
03:03 *🔁 A directed graph has directed edges where the direction matters.*
03:45 *🔄 Directed graphs can also have bi-directional edges, making it possible to have cycles.*
04:10 *♻️ Introduction to cycles in graphs, defined as a path that starts and ends at the same node.*
05:06 *🌀 Cycles indicate if a graph is cyclic or acyclic (no cycles).*
06:44 *🚫 Directed acyclic graphs (DAGs) have no cycles and are important in graph theory.*
07:50 *🚶 Definition of a path in a graph, where all nodes must be reachable and appear only once.*
09:27 *🧮 The degree of a node in an undirected graph is the number of edges attached to it.*
11:18 *🔄 In directed graphs, in-degree is the number of incoming edges, and out-degree is the number of outgoing edges.*
12:30 *⚖️ Introduction to edge weights, where edges can have different weights or assumed unit weights if not specified.*
13:11 *👍 Wrap-up of the video, encouraging viewers to like, subscribe, and check out other series on the channel.*

Made with HARPA AI

[venkat.sairam]

🎯 Key Takeaways for quick navigation:

00:03 📚 *Introduction to Graph Types*
- Graphs can be categorized into undirected and directed graphs based on the presence of arrows indicating edges.
- Nodes or vertices are the basic building blocks of a graph and can be numbered in any order.
- Edges in an undirected graph represent bidirectional connections between nodes.
03:03 🔄 *Directed Graphs*
- Directed graphs have directed edges, indicating one-way connections between nodes.
- In a directed acyclic graph (DAG), there are no cycles, meaning you cannot start at a node and return to it.
- Multiple directed edges between the same nodes are possible, creating bi-directional connections.
04:10 ↩ *Graphs and Cycles*
- A graph doesn't have to be circular; it can be an open structure with nodes and edges.
- Cycles in a graph occur when you start at a node and return to that node via a path.
- Multiple cycles can exist in a graph, and they define whether a graph is cyclic or acyclic.
07:50 📏 *Degrees in a Graph*
- In an undirected graph, the degree of a node is the number of edges connected to it.
- The total degree of an undirected graph is twice the number of edges.
- In directed graphs, nodes have in-degrees (incoming edges) and out-degrees (outgoing edges).
12:30 🏋 *Edge Weights*
- Edge weights represent numerical values assigned to edges in a graph.
- In problem-solving, edge weights are used to calculate distances or costs.
- If edge weights are not specified, they are assumed to be unit weights (weight = 1).

Made with HARPA AI

[saravanansubbiah]

understood bhaiya, I like your work. One small request from my side, could you please upload videos related to binary search algorithm (v.v.v.v important), DP with trees, DP with graphs, DP with digits, DP with bitmasking and greedy algorithm. These topics scares me a lot. I know your busy schedule, but please consider my request and do it ASAP. Thanks in advance.

[girishbhargava]

Thanks a ton for these amazing series. They say people are addicted to web series, whereas Striver's community is addicted to these sorts of series. Striver, please tell, approx how many videos will be in there in this series ??

[Sonu-iopn]

Bhaiya Audio, and Video quality is good. It would be great if we view you on a square on bottom right corner of screen.

[aditikulkarni]

Raj, this series is a goldmine!
I have watched 50 videos till now and was able to code the solutions on my own in one go for each problem!
There are such complex explanations for some problems on the internet, but your explanations are super simplified & easy to understand!
Thank you so so much for this content! ❤ sending you best wishes!

[gsampath]

11 th floor of taking is one of the advantage to avoid noise

[siddhantdwivedi]

First thing I do after waking up is watching your video and i really loved it. You are the reason I started doing coding thanku so much striver!! #understood

[tinitheviralfever]

How will this series be different from prev graph series?
BTW. Thank you Sir for your videos! ❤

[Rajat_maurya]

Bhaiya in all your upcoming videos will you be on one side of the video like this?

[nitinkumar]

Bhaiya left topics cover kar dijiye
Table of Content of Previous Graph Series by Striver :
✅ --> Covered
❌---> Not Covered

✅BFS
✅DFS
✅Dijkstra
✅Bell man ford
❌Floyd- warshall
✅Kosarajus For SCC (2 times DFS)
❌Tarjans For SCC (1 time DFS Only)
✅Tarjans For Bridges
✅Tarjans For Articulation Point
✅Disjoint set (Union-Find)
✅Topological sort
✅Using Queue + BFS (Kahn's Algo)
✅Using Stack + DFS
✅MST using Prim's Algo
✅MST using Kruskal's Algo
✅Number of connected components (DFS and BFS)
✅Shortest Path in Undirected Graph with Unit Weights (Using BFS)
✅Shortest Path in Weighted Directed Acyclic Graph (DAG) (UsingToposort DFS + BFS)
✅Detect Cycle in Undirected Graph (DFS and BFS)
✅Detect Cycle in Directed Graph (DFS and BFS)
✅Find Bridges in a Graph (Cut Edge)
✅Find Articulation Vertex/Point in a Graph (Cut Vertex)