this is a directed graph
One ‘node row’ consists of latitude,longitude (not shown) and the first edgeID which is the firat Edge ? in or out edge ?
yes, and optionally some more like elevation and turn cost information, see BaseGraph.java. The node property indices are annotated via
N_SOMETHING and the edge properties are like
E_SOMETHING, for edge properties also look into EdgeAccess
edge A-A (Self-Loop edge) isvalid?
from node 0, first get edge 0-3, if i want to get edge about 0 , so I should traverse from nextA（because node 0 is at nodeA）? is that ??
yes, this is correct