[
https://issues.apache.org/jira/browse/FLINK-5243?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16974179#comment-16974179
]
Dinesh Balachandran commented on FLINK-5243:
--------------------------------------------
Hi [~greghogan]. I am new here and looking for a beginner level contribution.
It appears that issue is still open.
I was thinking of implementing an example to output the "collaborative
distance" like the Erdos number and Bacon number. Essentially, setup a
BipartiteGraph, get the top or bottom projection and then use the GSA single
shortest path algorithm from the library package to get the degree of
separation/collaborative distance. In fact I have created a local working
version of this already.
Let me know your thoughts. Thanks.
> Implement an example for BipartiteGraph
> ---------------------------------------
>
> Key: FLINK-5243
> URL: https://issues.apache.org/jira/browse/FLINK-5243
> Project: Flink
> Issue Type: Sub-task
> Components: Library / Graph Processing (Gelly)
> Reporter: Ivan Mushketyk
> Priority: Major
> Labels: beginner
>
> Should implement example for BipartiteGraph in gelly-examples project
> similarly to examples for Graph class.
> Depends on this: https://issues.apache.org/jira/browse/FLINK-2254
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
