Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Is it true that the heaviest edge in a directed graph can not be in the MST of that graph?
I don't think it is true because we might end up with a heaviest edge that is not part of a cycle.
Can anyone confirm?
No, it is not true. Consider a graph with 2 vertices and an edge between them. This is the heaviest edge, and it will be in the minimum spanning tree of $G$.
Required, but never shown