Re: [jgrapht-users] reverse-cost for UndirectedGraphs
Brought to you by:
barak_naveh,
perfecthash
From: John S. <js...@gm...> - 2021-10-29 11:54:52
|
Hi Mario, I think you are describing a "mixed graph", which we allow you to construct via the union of an undirected and directed graph; but most of our algorithms don't know what to do with such a beast, so it's not a terribly useful concept yet. The problematic workaround is a directed graph with opposing edge pairs simulating undirected edges. I don't believe there's currently anything in the way of algorithms being improved to support mixed graphs; this would be a great GSoC project if we are able to participate in that again in the future. There's one open bug for the current inability to directly instantiate a mixed graph: https://github.com/jgrapht/jgrapht/issues/1039 This also requires quite a bit of work under the hood. On Tue, Oct 26, 2021 at 1:35 PM Mario Basa <mar...@gm...> wrote: > Is it possible to assign a reverse-cost along with the usual edge cost in > UndirectedGraphs? This is to simulate one-way passages in a road network. > > Thanks a lot. > > Mario. > > _______________________________________________ > jgrapht-users mailing list > jgr...@li... > https://lists.sourceforge.net/lists/listinfo/jgrapht-users > |