-
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即為所有點(diǎn)對(duì)的最短路徑矩陣
3)算法小結(jié)：此算法簡(jiǎn)單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對(duì)于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時(shí)間復(fù)雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個(gè)判斷I,j是否有通路的矩陣。更簡(jiǎn)單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來(lái)代替算法描述中的藍(lán)色部分，可以更直觀地得到I,j的連通情況。
標(biāo)簽：
Floyd-Warshall
Shortest
Pairs
Paths
上傳時(shí)間：
2013-12-01
上傳用戶：dyctj
-
I wrote this code early this year using ColdFire MCF5213 in codewarrior IDE. The LCD is STN B/W 320x240 dot matrix LCD. The code include 3 different fonts, and basic LCD driver. All original!
標(biāo)簽：
this
codewarrior
ColdFire
wrote
上傳時(shí)間：
2013-12-20
上傳用戶：皇族傳媒
-
This a linux device driver for Ralink RT2500USB b/g WLAN Card.
This driver implements basic 802.11 function.
Infrastructure and Ad-hoc mode with open or shared or wpapsk or wpa2psk authentication method.
WEP-40 and WEP-104 or tkip or aes encryption.
標(biāo)簽：
driver
This
implements
Ralink
上傳時(shí)間：
2016-03-10
上傳用戶：cc1015285075
-
A* sudo sudo/*
B* adduser script adduser
C* rmuser script rmuser
E* tout tout/*
F* dumdum dumdum
G* lostfile lostfile
H* Mkfl.localsys Makefile.localsys
I* spacegripe spacegripe
J* sendmail.cf sendmail.cf
N* remote remote.c
O* distributed conrol distrib/*
P* hosts and name server makerevhosts
Q* xargs xargs/*
標(biāo)簽：
adduser
script
rmuser
sudo
上傳時(shí)間：
2016-03-29
上傳用戶：gxrui1991
-
The Disk sample is used with Classpnp.sys as disk driver. The sample supports Plug and Play, Power Management, WMI, and failure prediction (S.M.A.R.T.), and it is 64-bit compliant.
標(biāo)簽：
sample
The
Classpnp
supports
上傳時(shí)間：
2014-01-27
上傳用戶：bruce
-
Problem B:Longest Ordered Subsequence
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標(biāo)簽：
Subsequence
sequence
Problem
Longest
上傳時(shí)間：
2016-12-08
上傳用戶：busterman
-
Unix Unleashed, Third Edition is written with the power user and system administrator in mind. This book will help the reader understand the nuances of the major Unix variants including SVR4, HP-UX, Solaris, AIX, BSD, IRIX, SunOS, and Linux. It will help the reader decide which Unix shell works best for their particular situation. Other topics such as Kernel Configuration, Networking, User Administration, and File Management are covered extensively for the administrator who wants a variety of options to choose from for best performance. The book also provides in-depth coverage of configuring and optimizing mail, DNS, HTTP and other services many companies deploy across their intranet and on the Internet
標(biāo)簽：
administrator
Unleashed
Edition
written
上傳時(shí)間：
2017-01-13
上傳用戶：來(lái)茴
-
5位的操作數(shù)X和Y輸入后暫存在寄存器A和B中，兩位的操作控制碼control暫存在寄存器C中，按照control碼的不同，分布實(shí)現(xiàn)下列操作：
00控制X+Y
01控制X-Y
10控制X and Y
11控制 X xor Y
運(yùn)算結(jié)果暫存在寄存器D中，然后輸出。
標(biāo)簽：
操作
寄存器
輸入
暫存
上傳時(shí)間：
2014-01-18
上傳用戶：yyyyyyyyyy
-
5位的操作數(shù)X和Y輸入后暫存在寄存器A和B中，兩位的操作控制碼control暫存在寄存器C中，按照control碼的不同，分布實(shí)現(xiàn)下列操作：
00控制X+Y
01控制X-Y
10控制X and Y
11控制 X xor Y
運(yùn)算結(jié)果暫存在寄存器D中，然后輸出。
標(biāo)簽：
操作
寄存器
輸入
暫存
上傳時(shí)間：
2014-01-09
上傳用戶：凌云御清風(fēng)
-
basic.c */
/**//* Project:NeuroBasic, basic package*//**/
/* Survey:This is a simple Basic b-code compiler which*/
/*can be used as a comfortable command shell for */
/* any program. The actual compiler is found in */
/*compiler.c.*/
/*The functions m_fctptr() and user_server()*/
/*build an interface to an
標(biāo)簽：
basic
NeuroBasic
Project
package
上傳時(shí)間：
2017-02-15
上傳用戶：xymbian
