Logo 
Search:

C++ Programming FAQ

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

What is an Indegree in dfs (data file structure)?

  Shared By: Sophia Hughes    Date: Nov 21    Category: C++ Programming    Views: 685

Answer:

The total number of edges which are subset of set E of given graph G which is having V as terminal node is called indegree.

Share: 
 
 
 
 

Didn't find what you were looking for? Find more on What is an Indegree 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: