Am 20.04.20 um 19:30 schrieb Franco Peschiera:
> I fear this will not be as efficient as just getting a lot of paths via
> |all_paths|. Do you think this makes sense for sampling with preferences
> on edges?
I'll refrain from judging whether it makes sense. It's up to you to
decide for yourself wh
nsion? I guess I can always test the python version
and see how it goes…
thanks!
Franco
> Date: Wed, 15 Apr 2020 10:59:51 +0200
> From: Tiago de Paula Peixoto
> To: graph-tool@skewed.de
> Subject: Re: [graph-tool] efficient random sampling of paths between
> two nodes
>
Am 15.04.20 um 10:42 schrieb Franco Peschiera:
> I now would like to test giving edges a weight in order for that
> |cutoff| argument to use it. I know the |shortest_distance| function
> accepts weights of edges in order to do Dijkstra. Could the same be done
> with |all_paths| such that the search
ago de Paula Peixoto
> To: Main discussion list for the graph-tool project
>
> Subject: Re: [graph-tool] efficient random sampling of paths between
> two nodes
> Message-ID:
> Content-Type: text/plain; charset=utf-8
>
> Am 23.03.20 um 22:14 schrieb Fra
Am 23.03.20 um 22:14 schrieb Franco Peschiera:
> Hello Tiago,
>
> First of all, thanks for your time.
>
> I see what you mean by having a biased logic that would prefer shorter
> paths to longer ones, I had not thought about that.
>
> Regarding the self-reference part, I think it would not be a
Hello Tiago,
First of all, thanks for your time.
I see what you mean by having a biased logic that would prefer shorter
paths to longer ones, I had not thought about that.
Regarding the self-reference part, I think it would not be a problem
because of the structure of my particular (directed) gr
Am 21.03.20 um 17:44 schrieb Franco Peschiera:
> Since I could potentially do many iterations (and samplings), I would
> like to have an unbiased sampling method for the Y paths without having
> to enumerate them all.
>
> One option is to do the sampling during the construction of the paths. I
>
Good day to all,
I wrote an initial message (through the issues site) asking about the
possibility of using the all_paths to random sample paths between two nodes
in a graph.
It was pointed out that the: 1. The algorithm is deterministic and that 2.
It’s not possible to adapt it to iterate in a u
Good day to all,
(repeated because chose wrong email address).
I wrote an initial message (through the issues site) asking about the
possibility of using the all_paths to random sample paths between two nodes
in a graph.
It was pointed out that the: 1. The algorithm is deterministic and that 2.
