Skip to content

Instantly share code, notes, and snippets.

@ponkin
Created August 18, 2015 20:09
find all paths with length 1
val initStep = edges.join( startVertices.map( (_, "") ) ).mapValues( _._1 )
val index = edges.map( _.swap ).persist() // we will iteratively join with this RDD
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment