1) Weighted diagraph
赋权有向图
2) Weighted digraph
赋权有向图
1.
We obtain formulas computing the characteristic polynomial of adjacent matrix of a weighted digraph in graph theory, thereby the methods computing the characteristic polynomial of a matrix in graph theory are derived and some properties of characteristic polynomial and spectral radius of adjacent matrix on a weighted digraph are investigated.
给出了赋权有向图邻接矩阵特征多项式的图论计算公式,从而得到了一般矩阵特征多项式的图论计算方法,并且研究了赋权有向图邻接矩阵特征多项式和谱半径的一些性质。
3) Weighted Directed Diagram
有向赋权图
1.
An Improved DES Algorithm Based on Weighted Directed Diagram and Fibonacci Array;
基于有向赋权图和Fibonacci数列的DES算法的研究及实现
4) directed graph model with weightings
赋权有向图模型
5) oriented weighted bipartite graph
有向赋权二部图
1.
The oriented weighted bipartite graph was built according to the rest star that not fall into the ε-neighborhood region.
针对现有的识别算法存在识别速度慢,识别成功率不高,提出了一种新的星图识别算法,该算法根据恒星星等,利用锚定的方法,使待识别星图中的星落于导航星图中的星的ε邻域,对于未落于ε邻域的星,建立有向赋权二部图,进行完美匹配,根据计算星对之间EMD距离,来确定星图的匹配是否成功;仿真结果表明,该方法提高了星图识别的速度,有很高的成功率;通过与利用Hous-dorff距离进行星图识别的方法比较,该方法对于星数目多时,速度有明显提高。
6) multi-stage weighted directed graph
赋权多阶段有向图
1.
The multi-stage weighted directed graph model for the problem is set up.
旅行总费用最小路线问题是生活实际中常见的一类问题,本文建立了该类问题的赋权多阶段有向图模型。
2.
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.
多阶段有向图是常见的一种有向图,许多运输、工程、管理等实际问题能转化为有向图最短路问题进行求解,尤其赋权多阶段有向图对解决该类实际问题更具有重要意义。
补充资料：齐郎中筵赋得的的帆向浦留别
【诗文】：
一帆何处去，正在望中微。浦迥摇空色，汀回见落晖。
每争高鸟度，能送远人归。偏似南浮客，悠扬无所依。
【注释】：
【出处】：
全唐诗：卷249_79
一帆何处去，正在望中微。浦迥摇空色，汀回见落晖。
每争高鸟度，能送远人归。偏似南浮客，悠扬无所依。
【注释】：
【出处】：
全唐诗：卷249_79
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条