|
|
|
| Perl Monk, Perl Meditation | |
| PerlMonks |
Re^3: Graph weighted_verticesby Zen (Deacon) |
| on Oct 16, 2009 at 17:54 UTC ( [id://801607]=note: print w/replies, xml ) | Need Help?? |
|
Imagine three nodes (e.g. cities), A, B, C. A and B are connected by multiple paths. B and C have 1 path. A and C have one path. If the question is, given paths of equal length, which two adjacent cities are most important (population?), edge weighting is irrelevant. Edge weighting isn't bad, but remember edges are defined by two nodes- not 1- which can differentiate a problem definition.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||