[
https://issues.apache.org/jira/browse/FLINK-4965?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Flink Jira Bot updated FLINK-4965:
----------------------------------
Labels: algorithm auto-deprioritized-major auto-unassigned stale-minor
(was: algorithm auto-deprioritized-major auto-unassigned)
I am the [Flink Jira Bot|https://github.com/apache/flink-jira-bot/] and I help
the community manage its development. I see this issues has been marked as
Minor but is unassigned and neither itself nor its Sub-Tasks have been updated
for 180 days. I have gone ahead and marked it "stale-minor". If this ticket is
still Minor, please either assign yourself or give an update. Afterwards,
please remove the label or in 7 days the issue will be deprioritized.
> AllPairsShortestPaths
> ---------------------
>
> Key: FLINK-4965
> URL: https://issues.apache.org/jira/browse/FLINK-4965
> Project: Flink
> Issue Type: New Feature
> Components: Library / Graph Processing (Gelly)
> Affects Versions: 1.2.0
> Reporter: Greg Hogan
> Priority: Minor
> Labels: algorithm, auto-deprioritized-major, auto-unassigned,
> stale-minor
>
> Add a Gelly implementation of {{AllPairsShortestPaths}} to complement the
> existing {{SingleSourceShortestPaths}}.
> Flink algorithms excel at processing big, sparse data. APSP is big, really
> big, but not at all sparse. Considering only undirected graphs, each
> component of size {{n}} will have {{n choose 2}} shortest paths (1,000
> vertices => ~million paths, 1,000,000 vertices => ~trillion shortest paths).
> Considerations are directed vs undirected and weighted vs unweighted graphs.
> The actual shortest path (not merely the distance) is required for follow-on
> algorithms such as betweenness centrality.
--
This message was sent by Atlassian Jira
(v8.20.1#820001)
