Loading ...
Sorry, an error occurred while loading the content.
 

Re: [PBML] Breadth-Fist Search Algorithm - BFS

Expand Messages
  • Txema Glez Izarzugaza
    I had already found the same modules, BUT as I m quite newbye with Perl i don t know how to use them. I need a subrutine,if possible, with the algorithm
    Message 1 of 2 , Feb 27, 2004
      I had already found the same modules, BUT as I'm quite newbye with Perl i
      don't know how to use them. I need a subrutine,if possible, with the
      algorithm itself. (and preferibly nothing else) to change it and addapt it
      to my task.

      Anyway... MANY THANKS!

      Alquemius


      ----- Original Message -----
      From: "zsdc" <zsdc@...>
      To: <perl-beginner@yahoogroups.com>
      Sent: Friday, February 27, 2004 11:28 AM
      Subject: Re: [PBML] Breadth-Fist Search Algorithm - BFS


      >
      > Txema Glez Izarzugaza wrote:
      >
      > > I'm working with a graph and I need to calculate the values of C and L,
      to do so, I need an algorithm to calculate the distance to the other
      elements.
      > >
      > > A good one is BFS algorithm.
      > >
      > > I tried to write the script in Perl but I got absolutely lost.
      >
      > See http://search.cpan.org/modlist/Data_and_Data_Types/Graph
      >
      > --
      > ZSDC
      >
      >
      >
      >
      > Unsubscribing info is here:
      http://help.yahoo.com/help/us/groups/groups-32.html
      > Yahoo! Groups Links
      >
      >
      >
      >
      >
      >
      >
      >
    Your message has been successfully submitted and would be delivered to recipients shortly.