[Bioperl-l] Using Graph?

[Heikki Lehvaslaiho]

On Monday 11 November 2002 06:06, Nathan \(Nat\) Goodman wrote:

> The all-pairs-shortest-path and transitive-closure methods do not handle
> undirected graphs correctly.  As Heikki reported, the
> single-source-shortest-path algorithms often (but not always) hang and
> eventually use up all of memory.  From my brief testing, it seems the
> single-source-shortest-path algorithms give the correct answer when they do
> not hang, including on undirected graphs.
>
> If Heikki wants, I’m willing to take over the bug song-and-dance with the
> developer.  Seems only fair….

Nat,

Please feel free to take over. 

Have a look at the bug list for Graph at CPAN and see if the fix I propose for 
single-source-shortest path methods is adequate:

http://rt.cpan.org/NoAuth/Bugs.html?Dist=Graph

	-Heikki

-- 
______ _/      _/_____________________________________________________
      _/      _/                      http://www.ebi.ac.uk/mutations/
     _/  _/  _/  Heikki Lehvaslaiho          heikki@ebi.ac.uk
    _/_/_/_/_/  EMBL Outstation, European Bioinformatics Institute
   _/  _/  _/  Wellcome Trust Genome Campus, Hinxton
  _/  _/  _/  Cambs. CB10 1SD, United Kingdom
     _/      Phone: +44 (0)1223 494 644   FAX: +44 (0)1223 494 468
___ _/_/_/_/_/________________________________________________________