最短路程序-2011数学建模.docVIP

最短路程序：%???Dijkstras?Shortest?Path%%???final?=?dijkstra(?A,?x,?y?)%%???Description:?returns?the?shortest?path?from?x?to?y?given?adjacency%???matrix?A.??Utilizes?Dijkstras?shortest?path?algorithm.%%???A???=???adjacency?matrix?of?the?graph?(includes?point?x?and?y)%???x???=???intial?node%???y???=???terminal?node%???IN??=???set?of?nodes?whose?shortest?path?from?x?is?known%???z,p?=???temporary?nodes%???d???=???vector?of?lengths?from?initial?point.?i.e.?d(p)?=?x?to?p%???s???=???vector?of?the?previous?node?on?a?shortest?path?for?any?node%%???Author:?Josh?Eads%???Date:?1/23/2006function?final?=?dijkstra(?A,?x,?y?)%modify?A?so?that?lengths?of?0?are?invalid?(-1)A(find(A?==?0))?=?NaN;%initialize?IN?to?include?only?xIN?=?x;%initialize?ss?=?zeros(1,length(A));%initialize?d??d(x)?(distance?to?self)d?=?zeros(1,length(A));d(x)?=?0;%loop?through?all?the?nodes?in?Afor?z?=?1:length(A)????%dont?calculate?values?already?in?IN????%if?~(find(IN?==?z))????if?~isWithin(IN,?z)????????%grab?the?distance?from?x?to?z?from?A?(-1?denotes?unreachable)????????d(z)?=?A(x,z);????????%set?the?previous?node?to?x????????s(z)?=?x;????endend%process?nodes?into?IN%while?y?isnt?in?set?IN%while?~(find(IN?==?y))while?~isWithin(IN,?y)????tempMin?=?[];????%add?the?node?not?in?IN?with?the?minimum?distance?into?IN????for?z?=?1:length(A)????????%if?z?isnt?in?IN????????%if?~(find(IN?==?z))????????if?~isWithin(IN,?z)????????????tempMin?=?[tempMin,?d(z)];????????end????end????%find?the?minimum?value?from?tempMin????p?=?min(tempMin);????????%find?the?minimum?distance?nodes????search?=?find(d?==?p);????%cycle?through?all?the?minimum?distance?nodes?until?one?not?in?IN?is????%found????for?i?=?1:length(search)????????search?=?find(d?==?p);????????%store?in?p?if?the?node?isnt?in?IN????????if(?~isWithin(IN,?search(i))?)????????????p?=?search(i);????????????break;????????end????end????????????%add?node?p?into?IN????IN?=?[IN,?p];????????%recompute?d?