[Bioperl-l] Breadth-First Search Algorithm - BFS

Jose Mª Glez Izarzugaza Glez-Izarzugaza at lycos.es
Thu Feb 26 22:55:21 EST 2004

Hello everyone,

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 (the algorithm itself) in Perl but I got absolutely lost. 

Can anyone help me?

Thanks in advance,

PS: Please, send me only-text mails

More information about the Bioperl-l mailing list