[
https://issues.apache.org/jira/browse/FLINK-5243?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16852672#comment-16852672
]
Jasleen Kaur commented on FLINK-5243:
-------------------------------------
[~greghogan] Thanks for your reply. I was planning to implement
[https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm] using GSA of
Flink gelly. Unfortunately those api's are not there for bipartite graph. Even
if I use Flink's top & bottom projections( to apply GSA) that will not give
the correct adjacency list. I guess using Graph data structure for implementing
bipartite matching would be easier. I will spend some more time on this over
the weekend.
> 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
(v7.6.3#76005)
