13th Israeli Symposium of AI, CV, and NN, Tel Aviv University, Tel Aviv, Israel, Feb. 2-4, 1997 D. Dori, D. Hubunk and Liu W, “Improving the Arc Detection
auxilary files for the Crypt Breakers Workbench (cbw). CBW is
a multi-window integrated workbench of tools that help a cryptanalist
read files encrypted with the BSD4.2 crypt command. Anyone
may copy, modify, use, or redistribute this system. It was
originally written by Robert W. Baldwin at MIT
This document is an operation guide for the MPC8XXFADS board. It contains operational, functional
and general information about the FADS. The MPC8XXFADS is meant to serve as a platform for s/
w and h/w development around the MPC8XX family processors. Using its on-board resources and its
associated debugger, a developer is able to download his code, run it, set breakpoints, display
memory and registers and connect his own proprietary h/w via the expansion connectors, to be incorporated
to a desired system with the MPC8XX processor.
Floyd-Warshall算法描述
1)適用范圍：
a)APSP(All Pairs Shortest Paths)
b)稠密圖效果最佳
c)邊權(quán)可正可負(fù)
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法結(jié)束：dis即為所有點對的最短路徑矩陣
3)算法小結(jié)：此算法簡單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時間復(fù)雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍(lán)色部分，可以更直觀地得到I,j的連通情況。
This program is copyrighted by it s author and you are granted a free license
to use the program for non-commercial purposes. If you are interested in
using the program for commercial purposes please contact Kevin W. Russell
at CIS 71551,253 for licensing information.
