outdegree ['autdi,gri:]

outdegree的基本解释

-

[计]输出端数

与outdegree相关的网络例句 [注：此内容来源于网络，仅供参考]

The problem for computing diameters of directed loop networks with outdegree of 3 has been solved.

对研究具有任意出度的有向环网的直径计算问题有一定参考作用。

In this paper, we study various features of hyperlinked web pages including indegree and outdegree distribution, content similarity, link similarity and etc.

在本文中我们研究了链接网页间多种属性，包括网页的入度、出度分布，内容相似度和链接相似度等，并且引入了语义相似度的概念。

A vertex with zero outdegree is called a sink.

出度为零的顶点称作收点。

与outdegree相关的网络解释 [注：此内容来源于网络，仅供参考]

outdegree：出度

2.顶点的度,入度和出度 图中每个顶点的度(degree)被定义为以该顶点为一个端点的边的数目,记为 D(v) .对有向图,顶点 v 的度又分为入度和出度,入度 (indegree)是以该顶点为终点的入边数目,记为 ID(v) ,出度 (outdegree)是以该点为起点的出边数目,

outdegree：输出端数;出度

outdated 过时的 | outdegree 输出端数;出度 | outdevice 输出设备

outdegree：引出次数

引出extractderivationeduceeductionelicitelicitation | 引出次数outdegree | 引出的derivative

outdegree：出次数

初值问题|initial value problem | 出次数|outdegree | 出树|outtree

Odd Degree and Odd Outdegree of Plane Trees：劉樹忠

(B)沈灝 Support Sizes of Mendelsohn Triple Systems | 16:20-16:50 (A)許寶剛 Decomposition Eulerian Graphs into Circuits | (B)劉樹忠 Odd Degree and Odd Outdegree of Plane Trees