Re: [jgrapht-users] Implementation of AsUnweightedGraph and AsUnweightedDirectedGraph
Brought to you by:
barak_naveh,
perfecthash
From: John V. S. <js...@gm...> - 2007-09-10 16:36:35
|
Thanks Lucas, I'll check these in and think of some more items for the low-hanging-fruit list. JVS Lucas Scharenbroich wrote: > I picked up the jgrapht package this weekend for use in my University > studies and had the need to view a weighted directed graph as undirected > for performing a BreadthFirstSearch in a residual network for for an > Edmunds-Karp implementation. I saw on the WIki that these classes have > been requested often and are considered a low hanging fruit. As such, I > though I'd share my (trivial) implementation of the classes. > > It appears that the two implementations are needed because the > Disjkstra's Shorted Path implementation would not respect the edges in a > directed graph unless the graph implements the DirectedGraph interface. > > Feedback is welcome. As I said, I've only been using the library for a > few hours and am interested in learning it so I can contribute some code > back. > > -Lucas |