[SPARK-7244] Find vertex sequences satisfying predicates

• Type: New Feature
• Status: Closed
• Priority: Minor
• Resolution: Won't Fix
• Component/s: GraphX
• Assignee: Unassigned
• Reporter: Joseph K. Bradley
• Created: 29/Apr/15 19:09
• Updated: 24/Jan/17 06:41
• Resolved: 24/Jan/17 06:41

Description

It would be useful to be able to search graphs (efficiently) based on a sequence of predicates, and to return matching contiguous subsequences of vertices. The returned info should probably be an RDD. This could also be called motif-finding.