An example of these in real life can be found in a (*) road map, where the cities and other junctures and destinations can be viewed as nodes and the highways and roads can be viewed as edges.
To find the shortest distance from a node to all other nodes in this structure, Dijkstra's algorithm is performed. These can be directed, where edges can only take certain paths from node to node and they can also be weighted where different edges have different values when traversed.  An example of these in real life can be found in a (*) road map, where the cities and other junctures and destinations can be viewed as nodes and the highways and roads can be viewed as edges. For 10 points name this abstract data structure, closely related to a tree, that shares a name with a diagram that can come in line and bar varieties.
To find the shortest distance from a node to all other nodes in this structure, Dijkstra's algorithm is performed.
{Graph}s [SM]