kCoresHypergraph(hypergraph)
kCoresHypergraph()所属R语言包：hypergraph
Find all the k-cores in a hypergraph
在一个超K-内核
译者：生物统计家园网 机器人LoveR
描述----------Description----------
Find all the k-cores in a hypergraph
在一个超K-内核
用法----------Usage----------
kCoresHypergraph(hg)
参数----------Arguments----------
参数：hg
an instance of the Hypergraph class
Hypergraph类的一个实例
Details
详情----------Details----------
A k-core in a hypergraph is a maximal subhypergraph where (a) no hyperedge is contained in another, and (b) each node is adjacent to at least k hyperedges in the subgraph.
K-核心中的一个超是一个极大的subhypergraph，其中（一）没有hyperedge包含在另一个，和（b）每个节点至少k在子超边相邻。
The implementation is based on the algorithm by E. Ramadan, A. Tarafdar, A. Pothen, 2004.
算法由大肠杆菌斋月Tarafdar不A. Pothen，2004年的基础上实施。
值----------Value----------
A vector of the core numbers for all the nodes in g.
一个在g所有节点的核心向量。
作者（S）----------Author(s)----------
Li Long <li.long@isb-sib.ch>
参考文献----------References----------
举例----------Examples----------
# to turn the snacoreex.gxl (from RBGL package) graph to a hypergraph[把snacoreex.gxl（从RBGL包）一个超图]
# this is a rough example [这是一个粗略的例子]
kc_hg_n <- c("A", "C", "B", "E", "F", "D", "G", "H", "J", "K", "I", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U")
kc_hg_e <- list(c("A", "C"), c("B", "C"), c("C", "E"), c("C", "F"), c("E", "D"), c("E", "F"), c("D", "G"), c("D", "H"), c("D", "J"), c("H", "G"), c("H", "J"), c("G", "J"), c("J", "M"), c("J", "K"), c("M", "K"), c("M", "O"), c("M", "N"), c("K", "N"), c("K", "F"), c("K", "I"), c("K", "L"), c("F", "I"), c("I", "L"), c("F", "L"), c("P", "Q"), c("Q", "R"), c("Q", "S"), c("R", "T"), c("S", "T"))
kc_hg_he <- lapply(kc_hg_e, "Hyperedge")
kc_hg <- new("Hypergraph", nodes=kc_hg_n, hyperedges=kc_hg_he)
kCoresHypergraph(kc_hg)
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-2-25 22:06:43
