Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Graph weighted_vertices

by Zen (Deacon)
on Oct 16, 2009 at 17:54 UTC ( #801607=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Graph weighted_vertices
in thread Graph weighted_vertices

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.


Comment on Re^3: Graph weighted_vertices

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://801607]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2015-08-29 09:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The oldest computer book still on my shelves (or on my digital media) is ...













    Results (343 votes), past polls