# Untitled

May 22nd, 2022
1,116
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
1. from itertools import permutations
2. from math import factorial
3.
4. #=======================HAMPTON-COURT==================
5. pointList = ['0','1','2','3','4','5','6','7','8','9','10','11','x']
7.
8.
9. #=======================TESTS==========================
10. # pointList = ['0','1','2','3']
12.
13. # pointList = ['0','1']
15.
16. def calculate_subgraphs():
17.     filteredPointList = []
18.
19.     subgraphCount = 0
20.     for i in range(0,pointList.__len__()+1):
21.
22.         for situation in permutations(pointList,i):
23.             if(sorted(situation) == list(situation)):
24.                # print('situation: ' + str(situation))
25.
29.                 # print('filteredLinkListLocalLength: ' + str(filteredLinkListLocalLength) + ' situation: ' + str(situation))
31.         print('i: ' + str(i) + ' subgraphCount: ' + str(subgraphCount))
32.
33.     return subgraphCount
34.
35.
36.
37. f= open('output.txt','w')
38.