That nearly does it... its adds the 2 missing 1's, i.e. the self-referencing nodes... couldn't handle the 3 (E1-E1) part... will look into that. Thanks
____________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: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |