New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

definition of neigh is redundant? #63

Open

ericprud opened this issue May 29, 2024 · 0 comments

ericprud commented May 29, 2024

Up top in Terminology we have:

neigh(G, n) is the neighbourhood of the node n in the graph G.
neigh(G, n) = arcsOut(G, n) ∪ arcsIn(G, n).

5.3.2 has:

For a node n of the graph G, we define neigh(n) as the set of triples adjacent to n in the graph; these are the triples that have n either as subject or as object.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment