I have a dataset of pairs of map coordinates, and I suspect that they could be connected to make a path. However, I'm not sure what the end points are, or if the coordinates actually make a path. I'm using the python networkx library, but it assumes you know a bit of graph theory to know what functions to use.
If I have a non-directed graph that looks like a path (a-b, b-c, c-d, ... y-z), how does graph theory describe the graph? What does it call the 'endpoints' 'a' and 'z'?