: [graph-tool] Re: All Pairs Shortest Path with limitations
Hi Stephan,
On Wed, Nov 24, 2021 at 5:58 PM Monecke, Stephan
wrote:
>
> Hi Aleks!
>
>
> The multiprocessing module is what I'm currently using as a workaround until
> something other pops up - I just throw it in
emory).
Best,
Aleks
On Wed, Nov 24, 2021 at 3:32 PM Monecke, Stephan
wrote:
>
> Hi Tiago and the list,
>
>
>
> my algorithm is still _infeasibly_ slow and > 90 % of the run-time results
> from shortest_path().
>
>
> Do you have any idea on how this could be
th N
pairs random sub-sampling and source / target being lists.
Thanks a ton!
Stephan
________
Von: Monecke, Stephan
Gesendet: Donnerstag, 18. November 2021 14:59
An: Main discussion list for the graph-tool project
Betreff: [graph-tool] Re: All Pairs Shortest Path with
>Am 17.11.21 um 19:22 schrieb Monecke, Stephan:
>> The main reason is that shortest_distance() has a "single source, all
>> targets" mode but no "single target, all sources" mode (the reverse) - as
>> soon as "source" is empty, it defaults to
Aleks
On Wed, Nov 17, 2021 at 3:55 PM Monecke, Stephan
wrote:
>
> Hi together,
>
>
>
> I have a question on how you would tackle the following:
>
>
> I have a graph and want to calculate all possible shortest paths but exclude
> a few nodes as starting / stop
Hi together,
I have a question on how you would tackle the following:
I have a graph and want to calculate all possible shortest paths but exclude a
few nodes as starting / stopping positions.
I can not filter out those vertices, since paths should be allowed to pass them
- just not start
Hi together!
I just noticed that vertices that had been saved within an external list are
not being updated when filtering the graph:
>>> G.set_edge_filter( G.edge_properties[ 'e_isbus'], inverted=True)
>>> G.set_vertex_filter(G.vertex_properties['v_isbus'], inverted=True)
>>> print( [ int
!
Von: Tiago de Paula Peixoto
Gesendet: Donnerstag, 11. November 2021 11:05
An: graph-tool@skewed.de
Betreff: [graph-tool] Re: Core dump
Am 11.11.21 um 10:47 schrieb Monecke, Stephan:
> Any ideas on how I can debug this?
>
Yes: try to isolate the problem by constructing a m
Hi together,
I have an algorithm whose results incl. the graph I save to disk at the end.
When I load it again, on some vertices, shortest_distance() crashes python:
```
munmap_chunk(): invalid pointer
Aborted (core dumped)
```
Any ideas on how I can debug this?
All the property maps are int
On my test graph with 4201 nodes and 9683 edges I already tried a quick test
with both:
I need ~ 70 random (source, target) node pairs to approximate the real mean of
all pairs shortest path with an error of about 1 %.
This is about 40 % of the run-time of all pairs shortest path.
Using sing
Hi!
I use graph_tool.topology.shortest_distance for an all pairs shortest path
calculation, what is the main run-time footprint of my algorithm and way to
large.
How would you speed it up / tackle this?
I tried to sub-sample with manual source, target pairs but that's terribly
inefficient
11 matches
Mail list logo
