I'm searching for a certain pathfinding algorithm which considers a certain sort of branch in the network. However, I find it difficult to define my search term as I do not know how this certain kind of edge is named. Have a look at the image, the red circled branch.
How to name a branch of which one of the two nodes is only single connected, in other words, one node is integrated in the network by only one connection?
Usually, in a network, most nodes are more or less 'intersections', meaning they connect two edges. However, in the image, you see that one edge 'sticks out', like a street ending in nowhere.
How to name this sort of edge?
Sorry, if the answer to this question may be to some of you very natural, I'm very new to this topic. This question relates to my other question ('Yen's or Eppstein for path with intermediate destinations with 'dead ends'?').