Permutation.get_precedence_distance():get_precedence_distance()是一个sympy Python库函数,用于计算两个置换之间的优先级距离。
p和q代表n个工作。优先级度量标准计数为no。在p和q中,作业n在作业n之前通常是作业m的次数。这是一个交换矩阵。
用法:
sympy.combinatorics.permutations.Permutation.get_precedence_distance()
返回:
两个排列之间的优先距离
代码1:get_precedence_distance()示例
# Python code explaining
# SymPy.Permutation.get_precedence_distance()
# importing SymPy libraries
from sympy.combinatorics.partitions import Partition
from sympy.combinatorics.permutations import Permutation
# Using from
# sympy.combinatorics.permutations.Permutation.get_precedence_distance() method
# creating Permutation
a = Permutation([2, 0, 3, 1, 5, 4])
b = Permutation([3, 1, 2, 5, 4, 0])
c = Permutation([0, 1, 3, 4, 5, 2])
print ("a - get_precedence_distance form b: ", a.get_precedence_distance(b))
print ("b - get_precedence_distance form c: ", b.get_precedence_distance(c))
输出:
a – get_precedence_distance form b: 6
b – get_precedence_distance form c: 9
代码2:get_precedence_distance()示例– 2D排列
# Python code explaining
# SymPy.Permutation.get_precedence_distance()
# importing SymPy libraries
from sympy.combinatorics.partitions import Partition
from sympy.combinatorics.permutations import Permutation
# Using from
# sympy.combinatorics.permutations.Permutation.get_precedence_distance() method
# creating Permutation
a = Permutation([[2, 4, 0],
[7, 1, 3],
[8, 5, 6]])
b = Permutation([[8, 4, 0],
[2, 7, 0],
[1, 6, 7]])
print ("a get_precedence_distance form b : ", a.get_precedence_distance(b))
输出:
a get_precedence_distance form b : 22
相关用法
- Python sympy.nC()用法及代码示例
- Python sympy.det()用法及代码示例
- Python sympy.cos()用法及代码示例
- Python sympy.sin()用法及代码示例
- Python sympy.tan()用法及代码示例
- Python sympy.rf()用法及代码示例
- Python sympy.nT()用法及代码示例
- Python sympy.lcm()用法及代码示例
- Python sympy.gcd()用法及代码示例
- Python sympy.has()用法及代码示例
- Python sympy.ones()用法及代码示例
- Python sympy.nP()用法及代码示例
- Python sympy.Add()用法及代码示例
- Python sympy.Mul()用法及代码示例
- Python sympy.Add()用法及代码示例
注:本文由纯净天空筛选整理自noobestars101大神的英文原创作品 Python | SymPy Permutation.get_precedence_distance() method。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。