Register

shortest path algo

774 views
1 votes
1 votes
TRUE / FALSE Explain Please..

An undirected graph is said to be Hamiltonian if it has a cycle containing all the vertices. Any DFS tree on a Hamiltonian graph must have depth V − 1.
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

0 votes
0 votes
0 answers
1
Vaishnavi01 asked Nov 19, 2018
304 views
Shortest Path
User Avatar
0 votes
0 votes
1 answer
2
saumya mishra asked Nov 6, 2018
278 views
shortest path
Can shortest path contains positive weight cycle???Please explain with examples.
Can shortest path contains positive weight cycle???Please explain with examples.
User Avatar
1 votes
1 votes
3 answers
4
Abhisek Saha asked Jun 26, 2017
1,134 views
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ?a) run dijkstra's ...
User Avatar
Link Copied!