[
https://issues.apache.org/jira/browse/SPARK-6978?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Sean Owen resolved SPARK-6978.
------------------------------
Resolution: Won't Fix
> GraphX: Compute all the direct and indirect relations for each vertex
> ---------------------------------------------------------------------
>
> Key: SPARK-6978
> URL: https://issues.apache.org/jira/browse/SPARK-6978
> Project: Spark
> Issue Type: New Feature
> Components: GraphX
> Affects Versions: 1.3.0
> Reporter: Carlos Balduz
> Priority: Minor
> Attachments: VertexConnections.scala
>
>
> Right now you can only get the direct connections of each vertex in a graph
> using collectNeighbors or collectNeighborIds. However, it would be very
> useful to be able to also get all the indirect connections of each vertex,
> with the degree of each of these connections.
> I have implemented this using Pregel, you call VertexConnections and specify
> the graph and the maximum degree you wish to retrieve (this second parameter
> is optional, if not specified it will retrieve every connection) and returns
> a map where for each key (degree) it contains a collection with all of the
> vertices.
> I am not very familiar with Scala, so I am pretty sure the code could be
> improved.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
