Ordering(RBGL)
Ordering()所属R语言包：RBGL
Compute vertex ordering for an undirected graph
计算无向图的顶点顺序
译者：生物统计家园网 机器人LoveR
描述----------Description----------
Compute vertex ordering for an undirected graph
计算无向图的顶点顺序
用法----------Usage----------
cuthill.mckee.ordering(g)
minDegreeOrdering(g, delta=0)
sloan.ordering(g, w1=1, w2=2)
参数----------Arguments----------
参数：g
an instance of the graph class with edgemode “undirected”
graph与edgemode“无向”类的一个实例
参数：delta
Multiple elimination control variable. If it is larger than or equal to zero then multiple elimination is enabled. The value of delta specifies the difference between the minimum degree and the degree of vertices that are to be eliminated.
多消除控制变量。如果是大于或等于零，则启用了多个消除。 delta值指定了最低程度，是要被淘汰的顶点度之间的差异。
参数：w1
First heuristic weight for the Sloan algorithm.
第一斯隆算法启发式的重量。
参数：w2
Second heuristic weight for the Sloan algorithm.
斯隆算法的第二个启发式的重量。
Details
详情----------Details----------
The following details were obtained from the documentation of these algorithms in Boost Graph Library and readers are referred their for even more detail. The goal of the Cuthill-Mckee (and reverse Cuthill-Mckee) ordering algorithm is to reduce the bandwidth of a graph by reordering the indices assigned to each vertex.
Boost Graph库，并从这些算法的文档中获得以下细节的读者，他们更详细的简称。 Cuthill-麦基排序算法（和扭转Cuthill - 麦基）的目标是，以减少重新安排分配给每个顶点指数的图形带宽。
The minimum degree ordering algorithm is a fill-in reduction matrix reordering algorithm.
最低程度排序算法是减少填充矩阵重排算法。
The goal of the Sloan ordering algorithm is to reduce the profile and the wavefront of a graph by reordering the indices assigned to each vertex.
斯隆排序算法的目的是为了减少重新安排分配给每个顶点的指数图的形象和波前。
The goal of the King ordering algorithm is to reduce the bandwidth of a graph by reordering the indices assigned to each vertex.
国王的排序算法的目标是，以减少重新安排分配给每个顶点指数的图形带宽。
值----------Value----------
参数：cuthill.mckee.ordering
returns a list with elements:
返回的元素的列表：
参数：reverse cuthill.mckee.ordering
the vertices in the new ordering
在新的排序顶点
参数：original bandwidth
bandwidth before reordering vertices
前重新排列顶点的带宽
参数：new bandwidth
bandwidth after reordering of vertices
带宽后重新排序的顶点
参数：minDegreeOrdering
return a list with elements:
返回的元素的列表：
参数：inverse_permutation
the new vertex ordering, given as the mapping from the new indices to the old indices
新的顶点顺序映射到旧指数，新指数
参数：permutation
the new vertex ordering, given as the mapping from the old indices to the new indices
新的顶点顺序，从旧指数映射到新的指数
参数：sloan.ordering
returns a list with elements:
返回的元素的列表：
参数：sloan.ordering
the vertices in the new ordering
在新的排序顶点
参数：bandwidth
bandwidth of the graph after reordering
带宽重新排序后的图
参数：profile
profile of the graph after reordering
剖面图后重新排序
参数：maxWavefront
maxWavefront of the graph after reordering
maxWavefront的重新排序后的图
参数：aver.wavefront
aver.wavefront of the graph after reordering
aver.wavefront的重新排序后的图
参数：rms.wavefront
rms.wavefront of the graph after reordering
rms.wavefront的重新排序后的图
作者（S）----------Author(s)----------
Li Long <li.long@isb-sib.ch>
参考文献----------References----------
by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8
举例----------Examples----------
con <- file(system.file("XML/dijkex.gxl",package="RBGL"), open="r")
coex <- fromGXL(con)
close(con)
coex <- ugraph(coex)
cuthill.mckee.ordering(coex)
minDegreeOrdering(coex)
sloan.ordering(coex)
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-2-26 12:03:08
