Lecture 85: Introduction to Graphs || Creation and Implementation

In this Video, we are going to learn about Graphs in C++ & its Implementation.

There is a lot to learn, Keep in mind “ Mnn bhot karega k chor yrr apne se nahi hoga ya maza nahi aara, Just ask 1 question “ Why I started ? “

Questions Links:

- Graph Implementation:

Do provide you feedback in the comments, we are going to make it best collectively.

Connect with me here:

Telegram Group Link: Love Babbar CODE HELP

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

#DSABusted #LoveBabbar

[softwarefoodiee]

For all those who are wondering how vector<int>v[n] became a 2D vector this comment is for you !!!

It creates a static array of N vectors of the first type i.e. v[0] is now a whole new and different vector than v[1] which is totally different than v[2] and so on. If you want to push a value into the 1st vector that is v[0], you will do it by v[0].push _ back(val) . To access that element you will call it by v[0][0] (kind of a 2d matrix, isn't it?!). So, basically it is an array of initially empty vectors to which you can add elements. These are very useful while you want to implement graphs where each node has it's own vector and the nodes to which it is joined are pushed into that particular node's vector.

I hope you get the point!

[KACodes]

Thanks understand that the pace of course will decrease due to workload and Unacademy course please don't let the consistency break
Thanks again

[jaydwarkadhish]

सर आपकी महेनत को सलाम हे सर आपकी चैनल से बहुत कुछ सीखना मिलता है ।👏👏😇😇😇😇😇😇😇😇💗 सर मेरी तरफ से आपकी वीटीयो को ⭐⭐⭐⭐⭐

[yuvrajjha]

Babbar Sir Plz🙏 continue adding notes 📝 as u were uploading previously becoz it makes more fast to understand video and also helps in revision.

[suplavpandey]

vector v(N) creates a vector of integers with size N. This means that the vector v will have N elements, all initialized to the default value of the integer type (0).

On the other hand, vector v [N] creates an array of N vectors. This means that you have an array of vectors, where each vector can have its own size and elements.

In summary, vector v(N) creates a single vector of size N, while vector v [N] creates an array of N vectors.

[adityatomar]

I watched both two ads, so that i contribute a lit bit to his income. amazing content.

[jhordd]

Most awaited topic kbhi kbhi lg rha tha beech mai bhaiya ab saare topics nhi krva payenge bcz of unacademy but this video bhaiya keep it up!! with your #imaandaari

[yashkochar]

00:04 Graph is a type of data structure.
02:19 Understanding the graph and its implications
06:27 Weighted and unweighted graph
08:44 Understanding cyclic graphs and their characteristics
13:22 Zero was invented and is globally recognized.
15:48 The video discusses various topics including the concept of free horse ads and the importance of Azhar and Zero collections.
20:16 The direction determines the path of the graph.
22:28 Print the list mentioned in the video
27:13 Create a graph using the given data
29:04 This is about columns and development bodies juice.

[raihan_]

time compl. for addEdge = O(m) and printing = O(n*m) jitna maine samjha abhi tak. Space complexity = O(m+n)

[Unkown]

I am just speechless course is just amazing bhaiya ...KEEP IT UP

[nishkarshkumar]

Time and space complexity for adjacency matrix is O(n^2) where n is the no of vertices. while for adjacency list time complexity is O(m) and space complexity is O(n+m) where n is no of vertices and m is no of edges.

[ayushgupta]

Thank you bhaiya a lot!
On lecture 85 with full motivation !

[suraj_patwa]

Greatest Video in Youtube this is really true

[keshavgambhir]

Thanks a lot bhaiya. Koi doubt nahi hai this is the best DSA course on yt

[kushalgupta]

For AdjList:-
Add Edge T.C: O(m) and S.C: O(n+m)
Print Edge T.C: O(n*m) and S.C: O(1)

[thecinderella]

0:10 did anyone notice the graph heading written in tricolor?

[pavandugaje]

Bahut behtarin tarikese se sikhaya he. Great 👍

[prashantbirajdar]

nice sir maza a gaya ekdum asani se samaj aya subkuch ...ekdum badhiyaa..thanku and love u sir...

[praveensingh]

time complexity: in printing edges o (n*m) in adding edges o(m) .. in both cases space complexity o(m)

[maou_raizen]

much much respect for you what you have been doing.