GitHub user ankurdave reopened a pull request:
https://github.com/apache/spark/pull/1307
[SPARK-2374] Path pattern matching for GraphX
Based on a
[request](http://apache-spark-user-list.1001560.n3.nabble.com/Graphx-traversal-and-merge-interesting-edges-td8788.html)
on the mailing list, I wrote a simple implementation of path pattern matching
for GraphX. It accepts patterns in the form of sequences of edge matchers, then
iteratively propagates partial pattern matches to find all matching paths in
the graph.
Though this is only an initial implementation and there are many
opportunities for optimization, having this algorithm in the library expands
the scope of GraphX beyond ML-like algorithms into graph traversal.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/ankurdave/spark PatternMatching
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/1307.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #1307
----
commit bc546a22066365122b2cbf4402946b88ee81de7b
Author: Ankur Dave <[email protected]>
Date: 2014-07-05T09:46:34Z
Add graphx.lib.PatternMatching
commit 9332a4927a065e2e5217a4256a5bc12a127ca97b
Author: Ankur Dave <[email protected]>
Date: 2014-07-05T10:16:20Z
Fix comment error
----
---
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]
