How to find the MST of a directed graph with vertices that has no entering edges?
-
eg: http://upload.wikimedia.org/wikipedia/commons/6/67/Semantic_Net.svg what method to be followed to find the MST when there are vertices with no entering edges?
-
Answer:
I'm a little rusty on my CS (mostly just program now), but MST = minimus spanning tree, right? If there is only one node with no entering edges, then that is your start node. However when there are more than one then it is impossible. Likewise, if there is only one node with no exiting edges then it must be your end point, but if there are more than one it is impossible.
Madurang... at Yahoo! Answers Visit the source
Related Q & A:
- How To Find The Owner Of A Mobile Number?Best solution by Yahoo! Answers
- How to find connected components of a random graph?Best solution by Mathematics
- How to find the volume of a parallelepiped?Best solution by Yahoo! Answers
- How to find the value of a stock?Best solution by Yahoo! Answers
- How to find the author of a quote?Best solution by Yahoo! Answers
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.