You might also try an adjacency matrix for your datastructure, which is basically a two dimensional array of node identifiers, and where there's an intersection (or arc, or edge in graph lingo) you place a marker. Graph::Base uses a variant of this as its underlying implementation, so the implementation in Graph::Traversal would be useful if you pursue this route.
In reply to Re: Graph traversal--shortest path?
by djantzen
in thread Graph traversal--shortest path?
by porkpilot
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |