Summary
Full Transcript
In this video we will understand the working of print neighbours of a vertex operation. This operation prints/returns all immediate neighbours of a vertex. in Graph DS 2 vertices are considered as neighbors if there is a direct edge/link/connection between them. --------------------------------------------------------------------------------------------- Graph Theory - https://simplesnippets.tech/what-is-a-graph-data-structure-important-graph-terms-properties/ Graph Full C++ Code Implementation - https://simplesnippets.tech/graph-implementation-adjacency-matrix-vs-adjacency-list-full-c-program-code/ Full DSA playlist - https://www.youtube.com/watch?v=XCyuHSJS7XE&list=PLIY8eNdw5tW_zX3OCzX7NJ8bL1p6pWfgG Full C++ Programming for Beginners Course - https://www.youtube.com/watch?v=AKNGgAXTark&list=PLIY8eNdw5tW_o8gsLqNBu8gmScCAqKm2Q --------------------------------------------------------------------------------------------- Support Simple Snippets by Donations - Google Pay UPI ID - tanmaysakpal11@okicici PayPal - paypal.me/tanmaysakpal11 --------------------------------------------------------------------------------------------- Timecodes - 00:00 Recap 01:02 Introduction & what this operation does 05:40 Print Neighbour Operation Pseudocode 09:02 Print Neighbour C++ Code --------------------------------------------------------------------------------------------- Simple Snippets Official Website - http://simplesnippets.tech/ Simple Snippets on Facebook - https://www.facebook.com/simplesnippets/ Simple Snippets on Instagram - https://www.instagram.com/simplesnippets/ Simple Snippets on Twitter - https://twitter.com/simplesnippet Simple Snippets Google Plus Page - https://plus.google.com/+SimpleSnippets Simple Snippets email ID - [email protected] For More Technology News, Latest Updates and Blog articles visit our Official Website - http://simplesnippets.tech/ #graphdatastructure #dsa #datastructures
