The code is an implementation of a recursive Edmond's Branching Algorithm to find the minimum cost arborescence of a directed & weighted graph.
Please refer to the txt file for more details of the code, along with input & output formats.
I have implemented this code as a part of the course CS201 : Data Strcutures at IIT Ropar.