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.
利用有向带权图表示用户的访问会话记录,对建立的有向带权图模型运用聚类算法实现页面聚类。
open flow network is a special weighted directed graph in which weighted links are flows, and the flows are in balance.
开放流网络是一种特殊的加权有向网,其中加权连边表示流量,同时节点满足流平衡。
in this paper, we study the shortest path problem of the multi-stage weighted directed graph and several solutions to it are presented by using an example from different perspective t.