search

roy-t / AStar

A fast 2D path finding library based on the A* algorithm. Works with both grids and graphs. Supports any .NET variant that supports .NETStandard 2.0 or higher. This library has no external dependencies. The library is licensed under the MIT license.
http://roy-t.nl
MIT License
340 stars 60 forks source link

Question : Bidirectional graph search #48

Closed PascalSoftwares closed 1 year ago

PascalSoftwares commented 2 years ago

In some cases, two nodes are connected with two directional arcs that have different costs (i.e uphill / downhill). Can this scenario be configured in your library?

roy-t commented 2 years ago

Hey, unfortunately not right now since the connect method on a node creates both edges. I think it could be an easy addition. Would happily accept a Pull Request.

From: PascalSoftwares @.> Sent: Wednesday, April 13, 2022 4:19:24 PM To: roy-t/AStar @.> Cc: Subscribed @.***> Subject: [roy-t/AStar] Question : Bidirectional graph search (Issue #48)

In some cases, two nodes are connected with two directional arcs that have different costs (i.e uphill / downhill). Can this scenario be configured in your library?

— Reply to this email directly, view it on GitHubhttps://github.com/roy-t/AStar/issues/48, or unsubscribehttps://github.com/notifications/unsubscribe-auth/AAEYIEUXVN3AYHQJGFBG5D3VE3JWZANCNFSM5TK2PPQA. You are receiving this because you are subscribed to this thread.Message ID: @.***>