Register

MadeEasy Test Series: Algorithms - Graph Algorithms

• edited by
368 views
0 votes
0 votes

 

According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!!

like 11-12-12 then for second square 4 times 13 so c(4,2) any two of then lead to me @ answer @6.

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
3
sumit chakraborty asked Jan 11, 2018
430 views
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Consider the following graph and sequences given below : Given answer for no of DFS traversal was 2 : S1 and S2. How S2 is a DFS traversal ?
Consider the following graph and sequences given below :Given answer for no of DFS traversal was 2 : S1 and S2.How S2 is a DFS traversal ?
User Avatar
2 votes
2 votes
0 answers
4
jaig asked Jan 10, 2018
332 views
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
For a directed graph, the absence of back edges in a DFS tree can have cycle. true or fale.please explain with an example.
For a directed graph, the absence of back edges in a DFS tree can have cycle.true or fale.please explain with an example.
User Avatar
Link Copied!