Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re^2: Graph modules

by lima1 (Curate)
on May 19, 2008 at 14:01 UTC ( #687390=note: print w/replies, xml ) Need Help??


in reply to Re: Graph modules
in thread Graph modules

Yes, but there are better solutions than running N * (N+1)/2 times Dijkstra... (google All Pairs Shortest Path Problem)

I'd be surprised if the boost library has not all the required functionality. It's probably just not implemented in the Perl bindings. If speed is an issue, then maybe just use the C++ library directly, otherwise try Graph as suggested.

Update: Graph also returns a "random" shortest graph.

Replies are listed 'Best First'.
Re^3: Graph modules
by nosbod (Scribe) on May 19, 2008 at 15:34 UTC
    Indeed, boost does have an implementation of the betweenness centrality measure. It might be the way to go, thanks

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (7)
As of 2021-04-16 00:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?