Logo 
Search:

C++ Programming FAQ

Submit Interview FAQ
Home » Interview FAQ » C++ ProgrammingRSS Feeds

What is adjacent nodes in dfs (data file structure)?

  Shared By: Rosie Hughes    Date: Oct 03    Category: C++ Programming    Views: 586

Answer:

The member nodes of V of a graph connected by the member of edge E is called adjacent nodes.

Share: 
 
 
 
 

Didn't find what you were looking for? Find more on What is adjacent nodes in dfs (data file structure)? Or get search suggestion and latest updates.


Your Comment
  • Comment should be atleast 30 Characters.
  • Please put code inside [Code] your code [/Code].


Tagged: