Can someone please give me an example where the minimum spanning tree obtained is not the shortest path distance between two vertices.
Please help.
Can someone please give me an example where the minimum spanning tree obtained is not the shortest path distance between two vertices.
Please help.
Check out the diagram in this article.
Minimum spanning tree - Wikipedia, the free encyclopedia
1. Get rid of gets(). Never ever ever use it again. Replace it with fgets() and use that instead.
2. Get rid of void main and replace it with int main(void) and return 0 at the end of the function.
3. Get rid of conio.h and other antiquated DOS crap headers.
4. Don't cast the return value of malloc, even if you always always always make sure that stdlib.h is included.
Okay if all the edges are unique then will the minimum spanning tree obtained be be the same as the shortest path tree?
I think it's the same
Am i correct?
