Adjacent Matrix 以一個N*N的陣列來表示一個具有N個頂點的圖形 我們以陣列的鎖列值來表示頂點以陣列的內容值來表示頂點間的邊是否存在-Adjacent Matrix with a N* N array to express an N vertex graph, we lock out the array values to express the content of vertex array vertex values to express the existence o

求出一个网络的所有最短路径，并根据最短路径求出所有节点和边的介数。适用于有向图和无向图。-All the shortest path in a network is obtained, the dielectric number of all the nodes and edges and was determined according to the shortest path. Applicable to a directed graph and no directed graph.

分别以网络节点和边为单位，通过TDMA对多跳无线网络进行时隙分配。-In the Multi-hop Wireless Networks, for the unit with the nodes and edges respectively, we allocate the time slot by using TDMA .

分别以网络节点和边为单位，通过空间再用TDMA对多跳无线网络进行时隙分配。-In the Multi-hop Wireless Networks, for the unit with the nodes and edges respectively, we allocate the time slot by using STDMA .

使用ASP的jpeg组件，我们可以做出各种样式的漂亮的验证码，只是苦于目前大多数服务器的JPEG组件版本太低，无法消除文字而造成的毛边，除非用非透明模式去绘制字体，但这样又无法达到仿制discuz论坛验证码的目的，因此，暂且先不管这么多了，文字有毛边锯齿就先随着它，这并不能成为当前验证码的缺憾。-Use the ASP jpeg components, we can make a variety of beautiful styles verification code, but suffer