>
> From: Jacob Vanderplas <[email protected]>
>
> Hi Eric,
> I think this sort of enhancement might fit better in scipy: much of the
> sparse graph package is back-ported from there.
>
> Regarding your specific problem: you might try using the ``dijkstra()``
> function directly and passing the list of nodes you're interested in to the
> ``indices`` parameter. This will use Dijkstra's algorithm to compute
> shortest paths for only those nodes (though for each of them it computes
> shortest paths to all other nodes in the graph).
I see what you mean -- this is indeed closer to what I need, I'll talk to
the scipy folks. Thanks!
Cheers,
Eric
------------------------------------------------------------------------------
October Webinars: Code for Performance
Free Intel webinars can help you accelerate application performance.
Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most from
the latest Intel processors and coprocessors. See abstracts and register >
http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk
_______________________________________________
Scikit-learn-general mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
