graph cut algorithm ,graph cut algorithm

最小费用有向树问题的一种贪心算法实现，采用的是逆邻接表的存储结构，然后求出有向图的最小费用树-Minimum cost directed tree problems, a greedy algorithm, using the inverse adjacency table storage structure, and then calculated the minimum cost directed graph tree