Hi @ all
I want to ask what is the meaning of vertex values and vertex states in the context of graph processing theory.
More precisely, I am looking to calculate / recover the neighbouring vertices from a vertex in directed graph. What minimum information will be required?
I am studying some related stuff and the author repeatedly using the terms vertex value and vertex state, but I am unable to understand the meaning of these.
Thank you for your guidance.