yangxk1 commented on PR #773: URL: https://github.com/apache/incubator-graphar/pull/773#issuecomment-3639793463
> adjacency list can be involved when deleting a node, do you need to add a test for that? @sapienza88 Very interesting question! But I think there is **no need to consider deleting the associated edge(adjacency list) when deleting a node.** First of all, graphar provides an API for the [table view](https://github.com/apache/incubator-graphar/blob/146eb6159dc3df14f15f1ea6f91584d561b4507f/cpp/examples/mid_level_reader_example.cc). In this view, users do not need to care whether the node associated with the edge exists. In addition, GraphAr provides the ability to read on demand. In some algorithms, only edge information is needed without reading node information. For example, in the SSSP algorithm, I only need to read the edge table and obtain its src\dst\weight. I do not need to read the property information of the node. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
