复杂网络基础知识--图的各种距离定义
2016-11-14 17:16
579 查看
图的各种距离定义
参考自:https://en.wikipedia.org/wiki/Distance_(graph_theory)!!欢迎补充更正
1.the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them. This is also known as the geodesic distance
%距离:两个节点的最短路径包含的边的数目
2.The eccentricity of a vertex v is the greatest geodesic distance between v and any other vertex. It can be thought of as how far a node is from the node most distant from it in the graph.
%偏心距(可能是这么翻译):节点v的最大距离,即所有其他节点中离得最远的节点到他它的距离
3.The radius r of a graph is the minimum eccentricity of any vertex
%半径:所有节点的偏心距中最小的值
4.The diameter d of a graph is the maximum eccentricity of any vertex in the graph. That is, d is the greatest distance between any pair of vertices or, alternatively. To find the diameter of a graph, first find the shortest path between each pair of vertices. The greatest length of any of these paths is the diameter of the graph.
%直径:所有节点中偏心距最大的值
5.A central vertex in a graph of radius r is one whose eccentricity is r—that is, a vertex that achieves the radius
%中心节点:偏心距等于半径的节点
6.A peripheral vertex in a graph of diameter d is one that is distance d from some other vertex—that is, a vertex that achieves the diameter
%边缘节点(次要节点):偏心距等于直径的节点
7.A pseudo-peripheral vertex v has the property that for any vertex u, if v is as far away from u as possible, then u is as far away from v as possible.
%伪边缘节点:距离某节点偏心距最大的节点
附加:如果一个图中每对节点只有一条最短路径,此图为geodetic graph
相关文章推荐
- linux网络编程学习笔记之一 -----各种基础知识小结
- linux 网络设置基础知识整理复习(一)碰到的各种问题
- 存储区域网络基础知识普及问答
- 无线网络基础知识
- 网络基础知识讲座之二:理解子网和CIDR
- 网络基础知识讲座之十一:互联网的管理架构
- 网络基础知识讲座之六:实现子网(包括IPv6)
- 00014.网络基础知识
- 2006-08-31 老婆陪读开始了,网络安全基础知识 48%
- 网络基础知识讲座之九:初步理解TCP协议
- 网络基础知识讲座之七:理解和使用ICMP协议
- 网络基础知识大全
- 网络基础知识
- 基础知识-如何分辨自己处于内网还是外网(公网)?是否有网络防火墙?是否支持UPnP?
- 网络基础知识讲座之一:理解IPv4地址的含义
- 网络基础知识 接线方法
- 汇编语言的基础知识标识符和表达式的--复合内存变量的定义
- 计算机网络基础知识
- 网络基础知识讲座之五:学习生成树协议
- 网络基础知识讲座之四:理解数据链路层