Added implementations:

|-- Finding if the edge is in MST in linear time (without actually finding MST)
\-- Finding minimal bottleneck spanning tree in linearithmic time