Joseph K. Bradley created SPARK-7257:
----------------------------------------
Summary: Find nearest neighbor satisfying predicate
Key: SPARK-7257
URL: https://issues.apache.org/jira/browse/SPARK-7257
Project: Spark
Issue Type: New Feature
Components: GraphX
Reporter: Joseph K. Bradley
Priority: Minor
It would be useful to be able to find nearest neighbors satisfying predicates.
E.g.:
* Given one or more starting vertices, plus a predicate.
* Find the closest vertex or vertices satisfying the predicate.
This is different from ShortestPaths in that ShortestPaths searches for a fixed
(small) set of vertices, rather than all vertices satisfying a predicate (which
could be a large set).
It could be implemented using BFS from the initial vertex/vertices, though
faster implementations might also search from vertices satisfying the predicate.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
