Skip to content

Instantly share code, notes, and snippets.

@TomLous TomLous/Graph.scala
Last active Apr 25, 2017

Embed
What would you like to do?
// edges are given the probabilty of the correctness of the edge
val edges: RDD[Edge[Double]] = predictedLinksDataset.rdd.map(
l => Edge(l.dossierNummer_left.toLong, l.dossierNummer_right.toLong, l.probability))
// vertices are just tuples of the dossiernummer.toLong (VertexId is typed as Long)
val vertices: RDD[(VertexId, KvKRecord)] = predictedLinksDataset.rdd.map(
k => (k.dossierNummer.toLong, k))
// the graph
val linkedGraph = Graph(vertices, edges)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.