Github user xccui commented on a diff in the pull request:
https://github.com/apache/flink/pull/3284#discussion_r100455274
--- Diff: docs/dev/libs/gelly/library_methods.md ---
@@ -242,6 +242,28 @@ The algorithm takes a directed, vertex (and possibly
edge) attributed graph as i
vertex represents a group of vertices and each edge represents a group of
edges from the input graph. Furthermore, each
vertex and edge in the output graph stores the common group value and the
number of represented elements.
+## Minimum Spanning Tree
+
+#### Overview
+This is an implementation of the distributed minimum spanning tree (MST)
algorithm. A minimum spanning tree for a connected and
+undirected graph is a subset of edges with minimum possible total edge
weight that connects all the vertices without cycles.
+One of the possible use cases for MST could be laying out cables that
connect all buildings with the minimum total cable length.
+
+#### Details
+Unlike a sequential version of the algorithm, a distributed MST algorithm
is based on the message-passing model.
+We use [vertex-centric iterations](#vertex-centric-iterations) to
implement the Borůvka algorithm described in
+[this paper](http://ieeexplore.ieee.org/abstract/document/508073/). As
there are different steps inside the iteration,
--- End diff --
Yes greg, you are right. A pdf is surely better than a web site. Think it
over, I want to change the paper to
https://cs.uwaterloo.ca/~kdaudjee/comparison.pdf since it fits more.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastruct...@apache.org or file a JIRA ticket
with INFRA.
---
