Question : Bidirectional graph search

[PascalSoftwares]

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]

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: @.***>