4 LaTeX edited Dec 7 '18 at 14:12 David Richerby 75.3k1717 gold badges117117 silver badges209209 bronze badges I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$V_1,V_2,V_3,\dots,V_n$$$$v_1,v_2,\dots,v_r$$ be the nodes on a graph with distance $$d_1,d_2,d_3,\dots,d_n$$$$d_1,d_2,\dots,d_r$$ to the end node and $$V$$(end) be the the end node,$$v$$. I want the shortest $$d$$ to $$V$$(end)$$v$$. I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$V_1,V_2,V_3,\dots,V_n$$ be the nodes on a graph with distance $$d_1,d_2,d_3,\dots,d_n$$ to the end node and $$V$$(end) be the the end node, I want the shortest $$d$$ to $$V$$(end). I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$v_1,v_2,\dots,v_r$$ be the nodes on a graph with distance $$d_1,d_2,\dots,d_r$$ to the end node $$v$$. I want the shortest $$d$$ to $$v$$. 3 Formatted details & title of the question. edited Dec 7 '18 at 13:14 xskxzr 5,08233 gold badges1111 silver badges3737 bronze badges I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$V1,V2,V3..Vn$$$$V_1,V_2,V_3,\dots,V_n$$ be the nodes on a graph with distance $$d1,d2,d3,..dn$$$$d_1,d_2,d_3,\dots,d_n$$ to the end node and $$V$$(end) be the the end node, I want the shortest $$d$$ to $$V$$(end). I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$V1,V2,V3..Vn$$ be the nodes on a graph with distance $$d1,d2,d3,..dn$$ to the end node and $$V$$(end) be the the end node, I want the shortest $$d$$ to $$V$$(end). I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$V_1,V_2,V_3,\dots,V_n$$ be the nodes on a graph with distance $$d_1,d_2,d_3,\dots,d_n$$ to the end node and $$V$$(end) be the the end node, I want the shortest $$d$$ to $$V$$(end). 2 Formatted details & title of the question. edit approved Dec 7 '18 at 13:14 Mr. Sigma. 76177 silver badges2626 bronze badges I am looking for an algorithm to find the shortest distance from multiple nodes to one end node.For For example let V1,V2,V3..Vn$$V1,V2,V3..Vn$$ be the nodes on a graph with distance d1,d2,d3,..dn$$d1,d2,d3,..dn$$ to the end node and V$$V$$(end) be the the end node,i I want the shortest d$$d$$ to V$$V$$(end). I am looking for an algorithm to find the shortest distance from multiple nodes to one end node.For example let V1,V2,V3..Vn be the nodes on a graph with distance d1,d2,d3,..dn to the end node and V(end) be the the end node,i want the shortest d to V(end). I am looking for an algorithm to find the shortest distance from multiple nodes to one end node. For example let $$V1,V2,V3..Vn$$ be the nodes on a graph with distance $$d1,d2,d3,..dn$$ to the end node and $$V$$(end) be the the end node, I want the shortest $$d$$ to $$V$$(end). 1 asked Dec 7 '18 at 12:43