Github user srowen commented on a diff in the pull request:
https://github.com/apache/spark/pull/11290#discussion_r53566042
--- Diff:
graphx/src/main/scala/org/apache/spark/graphx/lib/TriangleCount.scala ---
@@ -27,25 +28,47 @@ import org.apache.spark.graphx._
* The algorithm is relatively straightforward and can be computed in
three steps:
*
* <ul>
- * <li>Compute the set of neighbors for each vertex
- * <li>For each edge compute the intersection of the sets and send the
count to both vertices.
+ * <li> Compute the set of neighbors for each vertex
--- End diff --
Nit: the `<li>` should be closed if you're writing HTML tags
---
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 [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
