GeeksforGeeks » Algorithms
Second minimum spanning tree
(1 post)-
Is there a way to find the second minimum spanning tree in less than O(V^2)? If yes can you supply the theorem or algorithm
Reply
You must log in to post.
-
Welcome
- All permutations of a given string
- Memory Layout of C Programs
- Understanding “extern” keyword in C
- Median of two sorted arrays
- Tree traversal without recursion and without stack!
- Structure Member Alignment, Padding and Data Packing
- Intersection point of two Linked Lists
- Lowest Common Ancestor in a BST.
- Check if a binary tree is BST or not
- Sorted Linked List to Balanced BST
-
Hot Topics
Algorithm algorithms Amazon Aptitiude Aptitude Array Arrays Behavior Bit Magic BST C++ CPuzzles Data Structure Data Structures DBMS Design Design Pattern GATE Graph interview interview questions Java Linked List Linked Lists ljw Microsoft Networking Object Oriented Operating System Operating Systems puzzle Queue Recursion Sorting Stack Strings Terminology Testing Tree Trees -
Loading
Follow @GeeksforGeeks
Subscribe
Popular Blog Posts