Very lateral thinking! I've a feeling it would work, but unfortunately my real-life data set has 3097 vertextes and many more edges...!! I think my workstation is already going to have trouble without duplicating the work. Thanks though :)
____________In reply to Re: •Re: Calculating Shortest Paths with Graph::Directed
by arunhorne
in thread Calculating Shortest Paths with Graph::Directed
by arunhorne
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |