Ellipses

[JamesCraster]

This PR adds matching of source and target vertices to the networkx graph, uses the elliptical bounding box method to limit the graph size, and applies dijkstra's algorithm to produce the shortest path between the source and target.

Type of change

• [ ] Bug fix
• [x] New feature
• [ ] Documentation
• [x] New algorithm

Additional dependencies

Tests

How has the code been tested?

Issues fixes

List any issues this closes:

Checklist

Please ensure you have done the following:

• [ ] Code conforms to the projects style guidelines

• [ ] New code documented using google docstyle

• [ ] Updated documentation of any changed code

• [ ] Any additional dependencies have been added to the appropriate location (e.g. setup.py or requirements.txt)

• [ ] Unit tests written and passing. Tests should prove that fix is effective or new feature works as expected

• [ ] Code needs to run on the cluster? Tag database administrator in the pull request review to configure.

Reviewer

[PatrickOHara]

If source_lat == target_lat will this break due to divide by 0?

Add a quick test.

[JamesCraster]

If source_lat == target_lat will this break due to divide by 0?

Add a quick test.

This occurs if source_long = target_long, in which case it should be that theta = pi/2