RankedEmbedding[g,l]
takes a graph 
and a set partition l of the vertices of 
and returns the graph 
with vertices embedded according to RankedEmbedding[l].
RankedEmbedding[g,s]
takes a graph 
and a set s of vertices of 
and returns a ranked embedding of 
in which vertices in s are in block 1, vertices at distance 1 from any vertex in block 1 are in block 2, and so on.
RankedEmbedding
RankedEmbedding[l]
takes a set partition l of vertices {1,2,…,n} and returns an embedding of the vertices in the plane such that the vertices in each block occur on a vertical line with block 1 vertices on the leftmost line, block 2 vertices in the next line, and so on.
RankedEmbedding[g,l]
takes a graph 
and a set partition l of the vertices of 
and returns the graph 
with vertices embedded according to RankedEmbedding[l].
RankedEmbedding[g,s]
takes a graph 
and a set s of vertices of 
and returns a ranked embedding of 
in which vertices in s are in block 1, vertices at distance 1 from any vertex in block 1 are in block 2, and so on.
更多信息和选项
- RankedEmbedding functionality is now available in the built-in Wolfram Language function GraphLayout.
- To use RankedEmbedding, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
文本
Wolfram Research (2012)，RankedEmbedding，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/RankedEmbedding.html.
CMS
Wolfram 语言. 2012. "RankedEmbedding." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/RankedEmbedding.html.
APA
Wolfram 语言. (2012). RankedEmbedding. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/RankedEmbedding.html 年