[jgrapht-users] pathfinding: edge weight dependent on path-taken-so-far

[Robert F. <fle...@gm...>]

Sorry if this has already been asked/answered on the list.

When finding the shortest path between two vertices in a directed graph, is
there any way for the weight of an edge to be dependent on which other
edges are in the path? E.g. as a way to implement mutually exclusive edges.

Example: an intersection of two roads, controlled by stoplights. At any
given moment, traffic is allowed through in one direction. *Because* of
that, the other paths through that intersection are unavailable (i.e. very
high weight).

Thanks!
Robert