A packet in C++ which helps finding minimum spanning tree. It is subset of connected edge-weighted graph that connects all vertices together without cycles and minimum total edge weight
A C++ packet which performs Dijkstra Algorithm. Helps find the most optimal path (least cost path) in a graph (uni-directional or bi-directional) from a source point to rest of the points.
The packet eases your work by converting Infix expression to a corresponding Postfix expression structure in C++ and finally evaluating the result of the expression.