breadth first search 中文意思是什麼

breadth first search 解釋
廣度優先搜索
  • breadth : n 1 寬度 (opp length depth) 幅,橫幅,幅員;廣度,寬廣;(學識等的)廣博。2 (布的)幅面;船幅...
  • first : adj 1 最初的,最早的。2 最上等的,第一流的。3 基本的,概要的。4 高音(調)的。n 1 最初,第一;第...
  • search : vt 1 搜查;檢查(身體、衣袋等);搜索,搜尋;找;尋找。2 調查;查究;探求;追求;根究 (into)。3...
  1. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先,採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集,並根據不同類型的繼電元件對應的cad圖塊結構的不同,得到電氣原理圖中元件接線端子之間的連接關系;其次,根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格,並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後,提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法,利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field

    本文提出一種新型的網格資源調度演算法最小跳數演算法,首先通過廣度搜索遍歷找到資源,並同時生成跳數場,再根據跳數調度資源。
  3. The algorithm for certificates path construction that it is suitable for pki with bridge certification authority and cross authentication is proposed based on the theory of breadth first search algorithms for graphs

    基幹圖的寬度優先搜索理論,提出了適用於具有橋接ca和交叉認證的pki系統中的證書路徑構造演算法。
  4. The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent

    本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中,增加了判斷簡單連接的條件,使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等,該演算法更加有效;在生成樹協議物理拓撲發現演算法中,正確使用stp 、 snmp和arp三種協議,物理拓撲發現非常準確;在vlan物理拓撲發現演算法中,正確運用了ieee802 . 1q協議,該演算法具有通用性。
  5. Breadth - first search

    廣度優先搜尋
  6. The algorithm is based on the breadth - first search and optimized by ant algorithm. ants system is an artificial system based on the behavior of real ant colonies, which is often used to solve combinatorial problems, such as traveling salesman problem ( tsp ). in ant colony system ( acs ), a set of cooperating agents called ants cooperate to find good solutions to tsp

    本演算法基於寬度優先並用螞蟻演算法優化,螞蟻演算法是一種基於真實蟻群的人工智慧系統,常用於解決組合優化問題,如旅行商問題( tsp ) ,在螞蟻演算法中一組螞蟻團結合作,尋找tsp問題的最優解。
  7. At the same time, this paper discussed the inference machine of failure diagnosis expert system for pressure vessels. the expert system was made with forward reasoning, breadth first search and reliability theory

    本文同時討論了壓力容器失效分析專家系統推理機制,選擇正向推理和廣度優先搜索的推理控制策略,運用可信度理論的不精確推理方法建立了壓力容器失效分析專家系統。
  8. According to the similarity between path selection in p2p system and internet route action, every peer is seen as a router and builds its own route table ; 2. to find special peers and store their information in default column of the route table ; 3. to use methods ( integration route table, or hop route table ) to initiatively get the network changes and store those in the route table ; the thesis compares the integration route table method and the hop route table method, then it compares the route table method and directed breadth first search method based on experiments, and draws conclusions

    根據網路具有動態變化的特性,用兩種動態路由方法:集成路由表法和跳數路由表法,主動捕獲網路中發生的變化,並把系統中發生的變化進行更新,存儲到路由表中,為進行動態路由提供信息;本文先對集成路由表和跳數路由表方法進行了實驗比較,然後將路由表查找方法與定向廣度優先搜索方法進行了實驗比較,並得出結論:對比開銷和查找性能的提高,可以看出路由表查找方法是一個比較好的查找方法。
分享友人