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 is stopped if an accumulated > weighted-distance is reached?
I'm afraid not. > Is there any (alternative) way of > controlling which paths I get from the |all_paths| besides that |cutoff| > argument? There is no other argument to the function, which is deterministic. You could randomize the order of the edges in the graph (by removing and adding them again in a random order), which will change which paths are shown first, but would not give you a proper unbiased sampling. > Or whatever specialized logic regarding path sampling / > filtering I would have to implemented myself (just like the examples you > shared)? Would this be something you would consider adding to graph-tool? I think adding an algorithm to perform uniform sampling of paths in DAGs would be useful, but I can't promise I will find the time anytime soon to implement one. Best, Tiago -- Tiago de Paula Peixoto <ti...@skewed.de>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list graph-tool@skewed.de https://lists.skewed.de/mailman/listinfo/graph-tool
