[
https://issues.apache.org/jira/browse/FLINK-1815?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15536120#comment-15536120
]
Vasia Kalavri commented on FLINK-1815:
--------------------------------------
The motivation for this issue was to (1) provide an easy way to read graph data
that is stored in adjacency list format and (2) provide a way to store a graph
as an adjacency list instead of an edge list, since adjacency list format is
more compact. Why do you think we're creating our own format? Adjacency list
format is a CSV file format, i.e. each line contains a vertex following by the
list of neighbors.
Regarding the 2 last points, I guess you're referring to the PR implementation.
I haven't reviewed that, but if there is parsing functionality that we can use,
we should.
> Add methods to read and write a Graph as adjacency list
> -------------------------------------------------------
>
> Key: FLINK-1815
> URL: https://issues.apache.org/jira/browse/FLINK-1815
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.9
> Reporter: Vasia Kalavri
> Assignee: Faye Beligianni
> Priority: Minor
>
> It would be nice to add utility methods to read a graph from an Adjacency
> list format and also write a graph in such a format.
> The simple case would be to read a graph with no vertex or edge values, where
> we would need to define (a) a line delimiter, (b) a delimiter to separate
> vertices from neighbor list and (c) and a delimiter to separate the neighbors.
> For example, "1 2,3,4\n2 1,3" would give vertex 1 with neighbors 2, 3 and 4
> and vertex 2 with neighbors 1 and 3.
> If we have vertex values and/or edge values, we also need to have a way to
> separate IDs from values. For example, we could have "1 0.1 2 0.5, 3 0.2" to
> define a vertex 1 with value 0.1, edge (1, 2) with weight 0.5 and edge (1, 3)
> with weight 0.2.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
