undigraph

基本解釋

The algorithm is very simple and suitable for finding all undirected Hamiltonian circuits in general undigraph.
算法簡(jiǎn)便，適合于求解一般無(wú)向圖中全部哈密頓回路。
Based on analyzing existed structures of undigraph and characteristics of 2D drawing, Classified Adjacency List which is an improving structure of undigraph is presented.
在充分分析現(xiàn)有無(wú)向圖存儲(chǔ)結(jié)構(gòu)優(yōu)缺點(diǎn)的基礎(chǔ)上，結(jié)合二維工程圖形的特點(diǎn)，提出了一種改進(jìn)的無(wú)向圖存儲(chǔ)結(jié)構(gòu)——分類鄰接表存儲(chǔ)結(jié)構(gòu)。
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
為了求解上述模型，首先利用FLOYD算法求得不完全無(wú)向圖中各節(jié)點(diǎn)間的最短路徑和最短路徑長(zhǎng)度，然后設(shè)計(jì)了捕食搜索算法對(duì)模型進(jìn)行求解。