地区网络按最小费用原则通常以带权图来描述。
Regional network is usually indicated by diagrams with weight on the basis of the cost spanning.
利用有向带权图表示用户的访问会话记录，对建立的有向带权图模型运用聚类算法实现页面聚类。
This paper use weighted directed graph to describe user visit and conversation records, and use clustering algorithms to realize the page clustering by the weighted directed graph mode established.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在MATLAB软件环境下对最短路径问题给出了一个简捷易懂的程序。
This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.
本文我们利用带权核子图的可重构性证明了连通图是可重构的，从而证明了重构猜想为真。
In this paper, we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
其次，将停车场空闲车位的分布转化为一带权有向图，在此基础上用蚁群算法进行了最短路径计算。
Secondly, based on distributing the free parking spot into the weighted directed graph, this paper calculates the shortest path with the ant colony algorithm.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
应用推荐