https://github.com/tanuj-maheshwari/min-cost-arborescence

Minimum Cost Arborescence of a Directed Graph
https://github.com/tanuj-maheshwari/min-cost-arborescence

algorithm graph

Last synced: 6 months ago
JSON representation

Minimum Cost Arborescence of a Directed Graph

• Host: GitHub
• URL: https://github.com/tanuj-maheshwari/min-cost-arborescence
• Owner: tanuj-maheshwari
• Created: 2021-08-27T10:51:43.000Z (over 4 years ago)
• Default Branch: main
• Last Pushed: 2021-08-27T10:53:43.000Z (over 4 years ago)
• Last Synced: 2025-03-16T13:16:09.111Z (9 months ago)
• Topics: algorithm, graph
• Language: C++
• Homepage:
• Size: 4.88 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Min-Cost-Arborescence

Implemented an algorithm to calculate the Minimum Cost Arborescence of a directed graph.