Best Explanation of Graphs in C++ I've seen. Thorough and easy to understand. The complexities were the icing on the cake, you've saved me a lot of time and research! Better than many of my university lectures.
These are treasures. You explained almost every concept that I found missing on other youtube videos. Really looking forward to your other Algorithm videos sir. Maybe Greedy Strategy next?
@@arisaif already subscribed. Saif, can you please some videos about various searching methods in C++ as per your convenience? That would be very helpful.
I want to create a graph G = ( V , E ) be a network, being V the set of nodes (| V | = n ), and E the set of edges in C++ and read my instances including a various number of nodes ( n=10 , n=15 , n=20, ....) . On the other word it should generate automatically a graph with a given number of nodes. How can I do that?
what about representing graphs with incidence matrix and distance matrix? do you have a video about them as well? iirc if you transpond incidence matrix vertexes turn around (I only read that in an exam and remembered it, never saw it done :) )
Distance matrix is very similar to adjacency matrix except that instead of 0, 1, the entries take the weights of the edges between the two nodes. In an incident matrix the rows are the nodes and the columns are the edges, so the size would be |V|.|E| compared to |V|^2 in adjacency matrix. When |E| is small, it takes less memory than the adjacency matrix. However, I have not really seen that many practical applications for incidence matrix.
@@arisaif wait so distance matrix is only for weighted graph then, you cannot represet normal graph with it? It appears you cannot even represent undirected graph with it?
Thanks! If you liked my contents, please consider subscribing to my channel :) I don't know any book that is focused on the implementation. I tried to gather various alternatives in this video. Most books that I know focus on the graph theory itself not necessarily on the implementation.
Best content ever. No one explained the implementation of graphs using C++ in such detail. Thanks a lot, Mr. Ari 👌
Best Explanation of Graphs in C++ I've seen. Thorough and easy to understand. The complexities were the icing on the cake, you've saved me a lot of time and research! Better than many of my university lectures.
I guess I'm pretty randomly asking but do anybody know a good place to stream new movies online ?
@Deandre Emmitt flixportal :P
@Edison Morgan thanks, I signed up and it seems like a nice service =) Appreciate it !!
@Deandre Emmitt You are welcome =)
This video is phenomenal! What an underrated channel. Keep up the good work!
These are treasures. You explained almost every concept that I found missing on other youtube videos. Really looking forward to your other Algorithm videos sir. Maybe Greedy Strategy next?
Glad you like them!
Thank you, Ari for the video. This is exactly what I was looking for.
Excellent content, thanks for putting this up!
Excellent video Asif. I always struggled with graph theory n you have made that go away. Thanks a lot
Happy to help :)
Please consider subscribing to my channel.
@@arisaif already subscribed. Saif, can you please some videos about various searching methods in C++ as per your convenience? That would be very helpful.
Thank you Arif. Your explanation was great! It helped me a lot.
I want to create a graph G = ( V , E ) be a network, being V the set of nodes (| V | = n ), and
E the set of edges in C++ and read my instances including a various number of nodes ( n=10 , n=15 , n=20, ....) . On the other word it should generate automatically a graph with a given number of nodes. How can I do that?
I am happy the way you teach
Glad you liked it!
thanks for nicely presented content. Can you maybe write some articles or videos on the std::string and its various encoding, e.g. wchar_t etc?
Can you please tell me ( :)Colon sign is used for what
Which part are you referring to?
what about representing graphs with incidence matrix and distance matrix?
do you have a video about them as well?
iirc if you transpond incidence matrix vertexes turn around (I only read that in an exam and remembered it, never saw it done :) )
Distance matrix is very similar to adjacency matrix except that instead of 0, 1, the entries take the weights of the edges between the two nodes.
In an incident matrix the rows are the nodes and the columns are the edges, so the size would be |V|.|E| compared to |V|^2 in adjacency matrix. When |E| is small, it takes less memory than the adjacency matrix. However, I have not really seen that many practical applications for incidence matrix.
@@arisaif wait so distance matrix is only for weighted graph then, you cannot represet normal graph with it?
It appears you cannot even represent undirected graph with it?
Thanks mate. Btw do you recommend any book about graph theory from the implementation point of view ?
Thanks! If you liked my contents, please consider subscribing to my channel :)
I don't know any book that is focused on the implementation. I tried to gather various alternatives in this video. Most books that I know focus on the graph theory itself not necessarily on the implementation.
The video is really cool, but it is imposible to have an odd nuber of odd-degree verticles
I think it is incorrect.hey how do you put an argument in a vector.
Which part are you referring to?