[DirectedMinimumSpanningTreeChuLiuEdmondsAlgorithm.docxVIP

Directed Minimum Spanning Tree: Chu-Liu/Edmonds Algorithm我们的现代数据库大作业要求实现一个图查询系统，包括基于属性的子图查询、可达性查询（可选）、最短路径查询（可选）、TopK最短路径查询（可选）、图形化展示（可选）等功能。分成子图同构查询小组以及可达性及TopK路径查询小组。小组长之前研究了Efficiently answering reachability queries on very large directed graphs这篇论文，关于Path-tree计算可达性的，其中需要构造最大生成树(无需固定root)，于是负责打酱油的我就开始琢磨单连通有向图的最大生成树算法Edmonds Algorithm了。??Edmonds Algorithm介绍Solving The Directed MST ProblemChu and Liu [2], Edmonds [3], and Bock [4] have independently given efficient algorithms for finding the MST on a directed graph. The Chu-Liu and Edmonds algorithms are virtually identical; the Bock algorith