The distance d(ei,ej) between two edges in an undirected graph is defined as the minimum number of edges in a tieset containing ei and ej. The eccentricity ...
確定! 回上一頁