Python SymPy Permutation.cycles()用法及代碼示例

Permutation.cycles()：cycles()是一個sympy Python庫函數，它返回排列中存在的循環數。這也包括單例。

用法：

sympy.combinatorics.permutations.Permutation.cycles()

返回：
排列中存在的循環數

代碼1：cycles()示例

# Python code explaining 
# SymPy.Permutation.cycles() 
  
# importing SymPy libraries 
from sympy.combinatorics.partitions import Partition 
from sympy.combinatorics.permutations import Permutation 
  
# Using from sympy.combinatorics.permutations.Permutation.cycles() method  
  
# creating Permutation 
a = Permutation([2, 0, 3, 1, 5, 4]) 
  
b = Permutation([3, 1, 2, 5, 4, 0]) 
  
  
print ("Permutation a - cycles form : ", a.cycles) 
print ("Permutation b - cycles form : ", b.cycles)

輸出：

Permutation a – cycles form : 2
Permutation b – cycles form : 4

代碼2：cycles()示例– 2D排列

# Python code explaining 
# SymPy.Permutation.cycles() 
  
# importing SymPy libraries 
from sympy.combinatorics.partitions import Partition 
from sympy.combinatorics.permutations import Permutation 
  
# Using from  
# sympy.combinatorics.permutations.Permutation.cycles() method  
  
# creating Permutation 
a = Permutation([[2, 4, 0],  
                 [3, 1, 2], 
                 [1, 5, 6]]) 
  
# SELF COMMUTATING     
print ("Permutation a - cycles form : ", a.cycles)

輸出：

Permutation a – cycles form : 1

相關用法

注：本文由純淨天空篩選整理自noobestars101大神的英文原創作品 Python | SymPy Permutation.cycles() method。非經特殊聲明，原始代碼版權歸原作者所有，本譯文未經允許或授權，請勿轉載或複製。