Delete all the edges that have an edge weight smaller than 0.4 and then run a standard shortest path algorithm.
T. On 11/01, Ragia Ibrahim wrote: > Hello, > kindly how can get shortest path form node v to all other nodes on the graph > on condition depends on edge weight, for example get the path were edge > weight is grater than .4 > thanks in advance > Ragia > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help -- T. _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
