jkosior / circlesalgorithmnodejs

CirclesAlgorithmNodeJs

Question

You recive 2D Cartesian coordinate system with drawn circles.

Is it possible to go from A to B and always be inside one of circles?

What would be the shortest path and how long it is?

Input

How many circles? {integer}

For each of circle {x: integer y: integer r:integer}

Starting point {x:integer y:integer}

Finishing point {x:integer y:integer}

Output

possible - "bezpieczny przelot jest możliwy" - safe flight possible

impossible - "bezpieczny przelot nie jest możliwy" - safe flight impossible

shortest path - "najkrótsza trasa"

shortest path length - "całkowita trasa przelotu"