Start and end edge

[blahami2]

Start and end edge must be taken into account due to possible turn restrictions

• add information about the edge to the input
• set it as predecessor and accordingly at the end :exclamation:
• when building path, drop the first and last edge if it matches the input data (for the rest application to remain the same)

[blahami2]

Information added

[blahami2]

Tests changed

[blahami2]

Dijkstra, A*

• when the node is found, its edge is validated via the turntables, only then it is considered a final node

CH

• bidirectional Dijkstra - node added as a predecessor

[blahami2]

Dijkstra, A*

• first edge omitted when traversing the path

CH

• bidirectional Dijkstra - omitting both start and end

[blahami2]

Done