4

I've been studying Branch and Bound's graph algorithm and I hear it always finds the optimal path because it uses previously found solutions to find others

However, I haven't been able to find a proof of why it finds the optimal path. (In fact, most sites kind of do a bad job generalizing the algorithm itself.)

What is the proof that this algorithm always finds the optimal path in the case of a graph with 1 or more goal nodes?

Comments are not for extended discussion; this conversation has been moved to chat.

– nbro – 2020-05-26T16:34:59.150