fslaborg / Graphoscope

A pragmatic approach to network science.
http://fslab.org/Graphoscope/
MIT License
14 stars 6 forks source link

Consistency in definition for retrieving incoming and outgoing edges/neighbours in DiGraph #41

Closed LibraChris closed 1 year ago

LibraChris commented 1 year ago

Discussed in https://github.com/fslaborg/Graphoscope/discussions/40

Originally posted by **general-rishkin** August 29, 2023 For a `DiGraph` **G**, to retrieve the incoming neighbours of a node (say, node 1), you write: `1 |> DiGraph.getInEdges G ` whereas to retrieve the outgoing neighbours, you write: `G |> DiGraph.getOutEdges 1` It would be more consistent to select either: ``` 1 |> DiGraph.getInEdges G 1 |> DiGraph.getOutEdges G ``` OR ``` G |> DiGraph.getInEdges 1 G |> DiGraph.getOutEdges 1 ```