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.
-
Notifications
You must be signed in to change notification settings - Fork 0
vikrams169/Min-Cost-Arborescence-on-a-Directed-Weighted-Graph
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A recursive implementation of Edmond's Branching Algorithm to find the minimum cost arboroscence on a directed & weighted graph.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published