[jira] [Updated] (FLINK-1815) Add methods to read and write a Graph as adjacency list
[ https://issues.apache.org/jira/browse/FLINK-1815?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Konstantin Knauf updated FLINK-1815: Labels: stale-assigned (was: auto-closed stale-assigned) Priority: Not a Priority (was: Minor) > 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: Library / Graph Processing (Gelly) >Affects Versions: 0.9 >Reporter: Vasia Kalavri >Assignee: Faye Beligianni >Priority: Not a Priority > Labels: stale-assigned > > 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 (v8.3.4#803005)
[jira] [Updated] (FLINK-1815) Add methods to read and write a Graph as adjacency list
[ https://issues.apache.org/jira/browse/FLINK-1815?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Flink Jira Bot updated FLINK-1815: -- Labels: stale-assigned stale-minor (was: stale-minor) > 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: Library / Graph Processing (Gelly) >Affects Versions: 0.9 >Reporter: Vasia Kalavri >Assignee: Faye Beligianni >Priority: Minor > Labels: stale-assigned, stale-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 (v8.3.4#803005)
[jira] [Updated] (FLINK-1815) Add methods to read and write a Graph as adjacency list
[ https://issues.apache.org/jira/browse/FLINK-1815?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Flink Jira Bot updated FLINK-1815: -- Labels: stale-minor (was: ) > 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: Library / Graph Processing (Gelly) >Affects Versions: 0.9 >Reporter: Vasia Kalavri >Assignee: Faye Beligianni >Priority: Minor > Labels: stale-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 (v8.3.4#803005)
[jira] [Updated] (FLINK-1815) Add methods to read and write a Graph as adjacency list
[ https://issues.apache.org/jira/browse/FLINK-1815?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Andra Lungu updated FLINK-1815: --- Assignee: Faye Beligianni (was: Andra Lungu) 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)
[jira] [Updated] (FLINK-1815) Add methods to read and write a Graph as adjacency list
[ https://issues.apache.org/jira/browse/FLINK-1815?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Vasia Kalavri updated FLINK-1815: - Assignee: Faye Beligianni 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)
