From: Perry G. <pe...@st...> - 2002-04-18 17:38:12
|
> Now, the next interesting question is how much of the standard graph > algorithms can be implemented with ufuncs and array operations (which > I guess is the key to performance) and not straight for-loops... After > all, some of them are quite sequential. > I'm not sure about that (not being very familiar with graph algorithms). If you can give me some examples (perhaps off the mailing list) I could say whether they are easily cast into ufunc or library calls. Perry |