rvhuang / linq-to-astar Goto Github PK

I am looking to use this library for a GIS project. In this case I have a a list of cities with x,y coordinates. I also have a list of connections between two cities. Each connection has a weight based on the geodesic distance between the two points. Looking to get shortest path between two given cities with alternate routings as well.

First, is this type of problem possible with the library and if so is there an example I could use as a template? Second, do the algorithms have a setting for the max number of connections used in a possible solution? Say for example, a max of 3 connections are allowed in a solution.

Many Thanks.

Add an A* algorithm alternative implementation that will override the depth (level) of a node. (Current implementation does not override)

The NuGet package will support SourceLink in future, after SourceLink's general release is out.

Support ElementAt() and ElementAtOrDefault() that allow users to avoid unwanted object allocations.

The candidate list reported by ObservableRecursiveBestFirstSearch<TFactor, TStep> does not include candidates that are expanded in the last recursion.

Before 1.0.0 release, following renaming tasks need to be done:

• Rename main namespace from LinqToAStar to Heuristic.Linq.
• Rename sub-namespace Core to Algorithms.
• Use Heuristic.Linq as assembly name and NuGet package ID.

Implement Jump Point Search (JPS).

In some cases Extensions methods are not called when using LINQ expressions in *.cshtml files. This is because Razor only supports one type parameter whereas Extensions needs two.

Support Take() and TakeWhile() methods that allow users to avoid unwanted object allocations.

In some cases, current implementation of A* algorithm will not end if map boundary check is not presented in LINQ expression. The AStar.Run() method needs to be reviewed.

Need to inspect IterativeDeepeningAStar<TResult, TStep> class.

Support Skip() and SkipWhile() methods that allow users to avoid unwanted object allocations.