Search - im - CodeBus

Search - im - List

[Data structs] 最短距离问题 DL : 0: 求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.
Date : 2025-12-24 Size : 10kb User : 葛林
[Data structs] Generic_Pool_demo DL : 0: Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So ju st take the IMAP connection pool and convert tha t to a pool of threads (Copy, paste, find, replace). Need to make some changes to the pool i mplementation Not a very easy task, since the code has been duplicated in many place s. Re-inventing source code is not an intellige nt approach in an object oriented environment w hich encourages re-usability. It seems to make more sense to implement a pool that can contain a ny arbitrary type rather than duplicating code . How does one do that The answer is to use t
Date : 2025-12-24 Size : 170kb User : zhuxin
[Data structs] Delaunay-triangulation-algorithm DL : 0: Delaunay三角网算法的设计与研究对 DTM 的建立有着重要的作用, 本文在分析已有三角网算法的基础上, 根据逐点插入算法的思想与凸包算法相结合, 提出了自己的算法: 先绘制凸包, 然后构建初始三角网, 最后用 LOP方法整体优化。该算法尽可能的减少了对一条边的优化次数, 从而提高了算法的运行效率-The interference of the cloud no ise affects seriously the interpretation and information extraction of remote sensing miages Based on the miaging mechanism, according to hom om orphic filtering a lgorithm, by using IDL redeve loped language and integ ra ting it to the ENVIplatform, this paper miplemented automatic detection and removal of haze in remote sensing mi ages Experimental results show ed that th is process could effective ly rem ove the haze and efficiently miprove the trad itional methods o f miages (pre processing In addition, it is im proved the qua lity and precision o f the im ages greatly
Date : 2025-12-24 Size : 230kb User : 吉祥如意