How to remove edges with the weights under the specified limit form a graphshortestpath

Hi all,

I am trying to find out ways to remove edges with weights under specified limit form a graphshortestpath. What I mean is: before running the algorithm to find the shortest path between the s and d, it is better to remove the links that does not satisfies the bandwidth requirements form the graph. Assuming the weights victor represents links bandwidth. Appreciate your help.

Thanks

Hassan

[Jan]

What is your question?

[arash.ir]

I have the same question

we have some nodes and some paths between some of them

what function should we use when we want to remove the path which we had found (followed by a goal for example between x and y )

because we need to update a matrix and remove the connection between those nodes in topology matrix