Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 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)算法结束：dis即为所有点对的最短路径矩阵 3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。 考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
标签： Floyd-Warshall Shortest Pairs Paths
上传时间： 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!
标签： this codewarrior ColdFire wrote
上传时间： 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.
标签： driver This implements Ralink
上传时间： 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/*
标签： adduser script rmuser sudo
上传时间： 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.
标签： sample The Classpnp supports
上传时间： 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).
标签： Subsequence sequence Problem Longest
上传时间： 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
标签： administrator Unleashed Edition written
上传时间： 2017-01-13
上传用户：来茴
5位的操作数X和Y输入后暂存在寄存器A和B中，两位的操作控制码control暂存在寄存器C中，按照control码的不同，分布实现下列操作： 00控制X+Y 01控制X-Y 10控制X and Y 11控制 X xor Y 运算结果暂存在寄存器D中，然后输出。
上传时间： 2014-01-18
上传用户：yyyyyyyyyy
5位的操作数X和Y输入后暂存在寄存器A和B中，两位的操作控制码control暂存在寄存器C中，按照control码的不同，分布实现下列操作： 00控制X+Y 01控制X-Y 10控制X and Y 11控制 X xor Y 运算结果暂存在寄存器D中，然后输出。
上传时间： 2014-01-09
上传用户：凌云御清风
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
标签： basic NeuroBasic Project package
上传时间： 2017-02-15
上传用户：xymbian
