0

essentially I have a multigraph where each edge has its own identity and the weight of each edge is dependent upon some starting input. I have created a dijkstra-based search algorithm that can detect the shortest path from start to destination, however for my use case the most optimal path may actually be multiple paths. For example, if my starting input is 1000, the weights are calculated and assigned and will return the shortest route. but it may be more efficient to split the starting input among several routes. I have a multigraph[[0,2,2,2],[2,0,0,1],[2,0,0,2],[2,1,2,0]] where the numbers represent the number of edges connecting nodes ABCD. the most efficent route from a to b might be to send 500 along one of the edges connecting A to B and 500 along the other edge, or even to send 500 from A to D then to B etc depending on the starting input. is there any resources describing algorithms that might help?

c0der
  • 18,467
  • 6
  • 33
  • 65
getJiggy
  • 1
  • An illustration may help to understand the question. For algorithms consider https://math.stackexchange.com/ – c0der Jan 18 '22 at 05:06
  • You need to clarify what the objective is, and what the various terms mean (e.g., what does "split the starting input" mean?). In any case, the answer is probably: Use maximum flow. – j_random_hacker Jan 19 '22 at 11:21
  • Please consider formatting your text a little. A little more spacing, punctuation and capital letters go a long way towards making a post more readable and easier to follow. – Kjartan Jan 28 '22 at 12:52

0 Answers0