本文整理汇总了Python中fnss.topologies.topology.Topology.node[0]['type']方法的典型用法代码示例。如果您正苦于以下问题：Python Topology.node[0]['type']方法的具体用法？Python Topology.node[0]['type']怎么用？Python Topology.node[0]['type']使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类fnss.topologies.topology.Topology的用法示例。
在下文中一共展示了Topology.node[0]['type']方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: star_topology
# 需要导入模块: from fnss.topologies.topology import Topology [as 别名]
# 或者: from fnss.topologies.topology.Topology import node[0]['type'] [as 别名]
def star_topology(n):
"""
Return a star (a.k.a hub-and-spoke) topology of :math:`n+1` nodes
The root (hub) node has id 0 while all leaf (spoke) nodes have id
:math:`(1, n+1)`.
Each node has the attribute type which can either be *root* (for node 0) or
*leaf* for all other nodes
Parameters
----------
n : int
The number of leaf nodes
Returns
-------
topology : A Topology object
"""
if not isinstance(n, int):
raise TypeError('n argument must be of int type')
if n < 1:
raise ValueError('n argument must be a positive integer')
G = Topology(nx.star_graph(n))
G.name = "star_topology(%d)" % (n)
G.graph['type'] = 'star'
G.node[0]['type'] = 'root'
for v in range(1, n + 1):
G.node[v]['type'] = 'leaf'
return G示例2: k_ary_tree_topology
# 需要导入模块: from fnss.topologies.topology import Topology [as 别名]
# 或者: from fnss.topologies.topology.Topology import node[0]['type'] [as 别名]
def k_ary_tree_topology(k, h):
"""
Return a balanced k-ary tree topology of with depth h
Each node has two attributes:
* type: which can either be *root*, *intermediate* or *leaf*
* depth:math:`(0, h)` the height of the node in the tree, where 0 is the
root and h are leaves.
Parameters
----------
k : int
The branching factor of the tree
h : int
The height or depth of the tree
Returns
-------
topology : A Topology object
"""
if not isinstance(k, int) or not isinstance(h, int):
raise TypeError('k and h arguments must be of int type')
if k <= 1:
raise ValueError("Invalid k parameter. It should be > 1")
if h < 1:
raise ValueError("Invalid h parameter. It should be >=1")
G = Topology(nx.balanced_tree(k, h))
G.name = "k_ary_tree_topology(%d,%d)" % (k, h)
G.graph['type'] = 'tree'
G.graph['k'] = k
G.graph['h'] = h
G.node[0]['type'] = 'root'
G.node[0]['depth'] = 0
# Iterate through the tree to assign labels to nodes
v = 1
for depth in range(1, h + 1):
for _ in range(k**depth):
G.node[v]['depth'] = depth
if depth == h:
G.node[v]['type'] = 'leaf'
else:
G.node[v]['type'] = 'intermediate'
v += 1
return G