| # | Name | Solutions | Type |
|---|---|---|---|
| 1 | Find path | \ | Easy |
| 2 | Linear Scanning Algorithm | c++11/14 | Hard |
| x | Other problems | c++11/14 | Easy - Hard |
No.1 Title: given bidirectional edges, with start point and end point, find the shortest path from the start to end. ([email protected])
A - B
A - C
A - D
B - C
B - E
E - F
F - A
F - B
With above input, we expect a shortest path from A - E:
Your are required to write codes to parsing input and print computed output onto console for testing.
It is important to locate a point within non-convex geometry. Try to implement an algorithm to verify wether a point inside or outside an arbitrary geometry.
See the codes