I'm trying to decide whether running bellman ford to give me the graph instead of returning true/false (similar to what we did in exercise#5 )
will return ALL shortest paths from source S to some edge V or a a SINGLE path from S to v?
for example — graph with s,u,v
s —> u w:0
s —> v w:1
u —> v w:1
will bellman ford return me the enitre graph or choose one path from s to v?