用Dijkstra算法求附图中从点a到其它各节点的最短路径，并用图示表示算法中每一次的执行情况～ 利用Dijkstra算法求下图中从顶点1到其它各顶点间的最短...
\u7528Dijkstra\u7b97\u6cd5\u6c42\u56fe\u4e2d\u4ece\u9876\u70b9a\u5230\u5176\u4ed6\u5404\u9876\u70b9\u95f4\u7684\u6700\u77ed\u8def\u5f84\uff0c\u5e76\u5199\u51fa\u6267\u884c\u7b97\u6cd5\u8fc7\u7a0b\u4e2d\u5404\u6b65\u7684\u72b6\u6001\u3002\u770b\u770b\u4e25\u851a\u654f\u7684\u6570\u636e\u7ed3\u6784\u89c6\u9891\u5427
\u91cc\u9762\u8bf4\u7684\u5f88\u6e05\u695a
v1\u5230v2\uff1a10\u4e3a\u6700\u77ed\u8def\u5f84\uff1b
v1\u5230v3\uff1a7\u4e3a\u6700\u77ed\u8def\u5f84\uff1b
v1\u5230v4\uff1a8\u4e3a\u6700\u77ed\u8def\u5f84\uff1b
v1\u5230v5\uff1av1-> v2 -> v5 =10+6= 16\uff1bv1v3v5=7+9=16;v1v4v6v5=8+5+2=15; 15\u4e3a\u6700\u77ed\u8def\u5f84\uff1b
v1\u5230v6\uff1av1v2v3v6=10+2+9=21\uff1bv1v3v6=7+9=16\uff1bv1v4v6=8+5=13\uff1b13\u4e3a\u6700\u77ed\u8def\u5f84\uff1b
v1\u5230v7\uff1av1v2v5v7=10+6+20=36\uff1bv1v3v5v7=7+9+20=36\uff1bv1v3v6v7=7+9+30=46\uff1b
v1v4v6v7=8+5+30=42\uff1bv1v4v6v5v7=35\uff1b35\u4e3a\u6700\u77ed\u8def\u5f84
Dijkstra\uff1a
\u6c42\u5355\u6e90\u3001\u65e0\u8d1f\u6743\u7684\u6700\u77ed\u8def\u3002\u65f6\u6548\u6027\u8f83\u597d\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO\uff08V*V+E\uff09\u3002\u6e90\u70b9\u53ef\u8fbe\u7684\u8bdd\uff0cO\uff08V*lgV+E*lgV\uff09=>O\uff08E*lgV\uff09\u3002\u5f53\u662f\u7a00\u758f\u56fe\u7684\u60c5\u51b5\u65f6\uff0c\u6b64\u65f6E=V*V/lgV\uff0c\u6240\u4ee5\u7b97\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u53ef\u4e3aO\uff08V^2\uff09\u3002\u82e5\u662f\u6590\u6ce2\u90a3\u5951\u5806\u4f5c\u4f18\u5148\u961f\u5217\u7684\u8bdd\uff0c\u7b97\u6cd5\u65f6\u95f4\u590d\u6742\u5ea6\uff0c\u5219\u4e3aO\uff08V*lgV + E\uff09\u3002
\u4ee5\u4e0a\u5185\u5bb9\u53c2\u8003\uff1a\u767e\u5ea6\u767e\u79d1-\u6700\u77ed\u8def\u5f84\u7b97\u6cd5
结果如下图：
用Dijkstra算法求附图中从点a到其它各节点的最短路径，并用图示表示算法中每一次的执行情况～
Dijkstra算法我会，但都是用表格表示的，不会图示表示
2 9 5 9 13
吖，这啥题啊
绛旓細绗1姝ワ細浠嶢鐐瑰嚭鍙戯紝鍒ゆ柇姣忎釜鐐瑰埌A鐐圭殑璺緞锛堝鏋滆鐐逛笉鑳界洿杩濧鐐瑰垯璺濈鍊间负鏃犵┓澶э紝濡傛灉璇ョ偣鑳藉拰A鐩磋繛鍒欐槸褰撳墠鐨勬潈鍊硷級锛璁＄畻瀹屼箣鍚庢妸A鐐逛笂鑹诧紝缁撴灉濡備笅鍥:绗2姝ワ細浠庨櫎A鐐逛箣澶栫殑鐐规煡鎵惧埌璺濈A鐐规渶杩戠殑鐐笴锛屼粠C鐐瑰嚭鍙戞煡鎵惧叾閭昏繎鐨勮妭鐐癸紙闄ゅ幓宸蹭笂鑹茬殑鐐癸級锛屽苟閲嶆柊璁＄畻C鐐圭殑閭昏繎鐐硅窛绂籄鐐圭殑鍊...
绛旓細v1v4v6v7=8+5+30=42锛泇1v4v6v5v7=35锛35涓烘渶鐭矾寰 Dijkstra锛氭眰鍗曟簮銆佹棤璐熸潈鐨勬渶鐭矾銆傛椂鏁堟ц緝濂斤紝鏃堕棿澶嶆潅搴︿负O锛圴*V+E锛夈傛簮鐐瑰彲杈剧殑璇濓紝O锛圴*lgV+E*lgV锛=>O锛圗*lgV锛夈傚綋鏄█鐤忓浘鐨勬儏鍐垫椂锛屾鏃禘=V*V/lgV锛屾墍浠绠楁硶鐨勬椂闂村鏉傚害鍙负O锛圴^2锛夈傝嫢鏄枑娉㈤偅濂戝爢浣滀紭鍏堥槦鍒...
绛旓細杩厠鏂姞锛Dijkstra锛绠楁硶(鏈鐭矾寰勭畻娉)鏄敱鑽峰叞璁＄畻鏈虹瀛﹀鑹惧吂鏍悸疯开绉戞柉褰诲彂鐜扮殑銆傜畻娉曡В鍐崇殑鏄湁鍚鍥句腑浠绘剰涓や釜椤剁偣涔嬮棿鐨勬渶鐭矾寰勯棶棰樸備妇渚嬫潵璇达紝濡傛灉鍥句腑鐨勯《鐐硅〃绀哄煄甯傦紝鑰岃竟涓婄殑鏉冮噸琛ㄧず钁楀煄甯傞棿寮杞﹁缁忕殑璺濈銆 杩鏂交绠楁硶鍙互鐢ㄦ潵鎵惧埌涓や釜鍩庡競涔嬮棿鐨勬渶鐭矾寰勩傝开绉戞柉褰荤畻娉曠殑杈撳叆鍖呭惈浜嗕竴...
绛旓細缁撴灉濡備笅鍥撅細
绛旓細杩澃鏂壒鎷(Dijkstra)绠楁硶鏍稿績锛 鎸夌収璺緞闀垮害閫掑鐨勬搴忎骇鐢熸渶鐭矾寰勩傝开鏉版柉鐗规媺(Dijkstra)绠楁硶姝ラ锛氾紙姹傚浘涓v0鍒皏8鐨勬渶鐭矾寰勶級骞堕潪涓涓嬪瓙姹傚嚭v0鍒皏8鐨勬渶鐭矾寰勶紝鑰屾槸 涓姝ヤ竴姝ユ眰鍑哄畠浠箣闂撮《鐐圭殑鏈鐭矾寰 锛岃繃杩囩▼涓兘鏄 鍩轰簬宸茬粡姹傚嚭鐨勬渶鐭矾寰勭殑鍩虹涓婏紝姹傚緱鏇磋繙椤剁偣鐨勬渶鐭矾寰勶紝鏈缁堝緱鍑烘簮...
绛旓細璺緞鎼滅储涓父鐢ㄧ殑Dijkstra绠楁硶鏄湪鍥捐〃涓壘鍒板崟婧愭渶鐭矾寰勭殑鏂规硶銆侱ijkstra绠楁硶鏄绠楁満绉戝涓潪甯歌憲鍚嶅拰閲嶈鐨勭畻娉曚箣涓锛屼富瑕佺敤浜庤В鍐冲浘璁轰腑鐨勫崟婧愭渶鐭矾寰勯棶棰樸傝繖閲岀殑“鍗曟簮”鎸囩殑鏄粠涓涓寚瀹氱殑璧峰鑺傜偣锛堟垨绉颁负“婧”鑺傜偣锛夊嚭鍙戯紝鎵惧埌鍒拌揪鍥句腑鎵鏈夊叾浠栬妭鐐圭殑鏈鐭矾寰勩傝繖涓畻娉曠殑...
绛旓細鍦ㄤ笂鍥句腑锛岀矇绾㈣壊鐨勭粨鐐规槸鍒濆缁撶偣锛岃摑鑹茬殑鏄洰鏍囩偣锛岃岀被鑿卞舰鐨勬湁鑹插尯鍩熷垯鏄Dijkstra绠楁硶鎵弿杩囩殑鍖哄煙銆傞鑹叉渶娣＄殑鍖哄煙鏄偅浜涚鍒濆鐐规渶杩滅殑锛屽洜鑰屽舰鎴愭帰娴嬭繃绋嬶紙exploration锛夌殑杈瑰锛坒rontier锛夈傚洜鑰孌ijkstra绠楁硶鍙互鎵惧埌涓鏉℃渶鐭殑璺緞锛屼絾鏄晥鐜囦笂骞朵笉楂樸傛暟鎹粨鏋--Dijkstra绠楁硶鏈娓呮鐨勮瑙 ...
绛旓細Dijkstra绠楁硶涓鑸殑琛ㄨ堪閫氬父鏈変袱绉嶆柟寮忥紝涓绉嶇敤姘镐箙鍜屼复鏃舵爣鍙锋柟寮忥紝涓绉嶆槸鐢∣PEN,CLOSE琛ㄧ殑鏂瑰紡锛岃繖閲屽潎閲囩敤姘镐箙鍜屼复鏃舵爣鍙风殑鏂瑰紡銆傛敞鎰忚绠楁硶瑕佹眰鍥句腑涓嶅瓨鍦ㄨ礋鏉冭竟銆傚皢T涓《鐐规寜閫掑鐨勬搴忓姞鍏ュ埌S涓紝淇濊瘉锛氫粠婧愮偣V0鍒癝涓叾浠栧悇椤剁偣鐨勯暱搴﹂兘涓嶅ぇ浜庝粠V0鍒癟涓换浣曢《鐐圭殑鏈鐭矾寰勯暱搴︺傛瘡涓《鐐瑰搴斾竴...
绛旓細銆丆(4)銆丒(5)銆丗(6)銆丏(7)銆丟(8)銆丠(9)鍜孖(9)锛孌L鎸囧悜缁堢偣銆傜粨璁猴細Dijkstra绠楁硶濡傛稛婕墿鏁ｏ紝鎻ず浜咹鍜孖鐨勬渶鐭矾寰勶紝鏈鍚庯紝鏁翠釜鍥剧殑鏈鐭矾寰勭綉缁滃湪缁堢偣澶勫畬鎴愪氦铻嶃傛兂璞′竴涓嬶紝灏卞儚涓棰楃煶瀛愭姇鍏ュ钩闈欑殑婀栭潰锛孌ijkstra绠楁硶閫愭鎻ず鍑虹綉缁滀腑姣忎竴涓妭鐐圭殑鏈鐭矾寰勶紝鐩磋嚦娉㈠強鏁翠釜鍥剧殑姣忎竴涓钀姐
绛旓細Dijkstra(杩澃鏂壒鎷)绠楁硶鏄吀鍨嬬殑鍗曟簮鏈鐭矾寰勭畻娉曪紝鐢ㄤ簬璁＄畻涓涓妭鐐瑰埌鍏朵粬鎵鏈夎妭鐐圭殑鏈鐭矾寰勩備富瑕佺壒鐐规槸浠ヨ捣濮嬬偣涓轰腑蹇冨悜澶栧眰灞傛墿灞曪紝鐩村埌鎵╁睍鍒扮粓鐐逛负姝傛敞鎰忚绠楁硶瑕佹眰鍥句腑涓嶅瓨鍦ㄨ礋鏉冭竟銆傝G=(V,E)鏄竴涓甫鏉冩湁鍚戝浘锛屾妸鍥句腑椤剁偣闆嗗悎V鍒嗘垚涓ょ粍锛岀涓缁勪负宸叉眰鍑烘渶鐭矾寰勭殑椤剁偣闆嗗悎锛堢敤S琛ㄧず...
