Does the minimal spanning tree of a graph give the shortest distance between any

Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?

Question Posted / raju kumar

No Answer is Posted For this Question
Be the First to Post Answer

More Data Structures Interview Questions

What are the basic data structures?

Is null a binary search tree?

What is the difference between collection and collections?

What are the major data structures used in the following areas : network data model & hierarchical data model?

Is a list an array?

What are the four characteristics of algorithms?

What is binary tree and its properties?

Is vector synchronized?

How efficient is bubble sort?

How can I search for data in a linked list?

What are b tree keys?

What is the minimum number of queues that can be used to implement a priority queue?

For more Data Structures Interview Questions Click Here