Question

u= capacity c = cost u=10 c=2 u=9 c=3 u=15 c=1 source -> 0 u=5 c=6 3 u=10 c=1 4 sink u=5 c=5 u=10 c=3 I need to transport k=13 objects from source to sink. Can anyone help me to solve this problem by SPFA - shortest Path faster Algorithm and give me an image / explain for me step by step? Thank you!

          u= capacity
c = cost
u=10
c=2
u=9
c=3
u=15
c=1
source -> 0
u=5
c=6
3
u=10
c=1
4 sink
u=5
c=5
u=10
c=3
I need to transport k=13 objects from source to sink.
Can anyone help me to solve this problem by SPFA - shortest Path faster Algorithm
and give me an image / explain for me step by step? Thank you!

u= capacity
c = cost
u=10
c=2
u=9
c=3
u=15
c=1
source -> 0
u=5
c=6
3
u=10
c=1
4 sink
u=5
c=5
u=10
c=3
I need to transport k=13 objects from source to sink.
Can anyone help me to solve this problem by SPFA - shortest Path faster Algorithm
and give me an image / explain for me step by step? Thank you!

Added by Aaron Y.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Steven Clarke

Step 1

To solve the problem I must know the nodes and every directed edge with capacity (u) and cost (c). - If you want me to run this on your exact graph, please re-post a clear list like: "S -> A u=10 c=2", "A -> B u=9 c=3", …, and confirm source, sink and k. Show more…

Show all steps