



__lowerCAmelCase     =			[
    ["ab-e1", "ac-e3", "ad-e5", "bc-e4", "bd-e2", "be-e6", "bh-e12", "cd-e2", "ce-e4",
     "de-e1", "df-e8", "dg-e5", "dh-e10", "ef-e3", "eg-e2", "fg-e6", "gh-e6", "hi-e3"],
    ["ab-e1", "ac-e3", "ad-e5", "bc-e4", "bd-e2", "be-e6", "cd-e2", "de-e1", "df-e8",
     "ef-e3", "eg-e2", "fg-e6"],
    ["ab-e1", "ac-e3", "bc-e4", "bd-e2", "de-e1", "df-e8", "dg-e5", "ef-e3", "eg-e2",
     "eh-e12", "fg-e6", "fh-e10", "gh-e6"],
    ["ab-e1", "ac-e3", "bc-e4", "bd-e2", "bh-e12", "cd-e2", "df-e8", "dh-e10"],
    ["ab-e1", "ac-e3", "ad-e5", "bc-e4", "bd-e2", "cd-e2", "ce-e4", "de-e1", "df-e8",
     "dg-e5", "ef-e3", "eg-e2", "fg-e6"]
]

def     a						(      _lowercase   :     Union[str, Any]       )     ->int:
		UpperCamelCase__         =	set()
		for row in edge_array:
				for item in row:
						distinct_edge.add(item[0]       )
		return list(_lowercase       )

def     a						(      _lowercase   :     Union[str, Any] ,						_lowercase   :     Tuple       )     ->Tuple:
		UpperCamelCase__         =	["""0"""] * len(_lowercase       )
		for i, row in enumerate(_lowercase       ):
				for item in row:
						if distinct_edge in item[0]:
								UpperCamelCase__         =	"""1"""
								break
		return "".join(_lowercase       )

def     a						(      _lowercase   :     Optional[Any]       )     ->Optional[Any]:
		UpperCamelCase__         =	get_distinct_edge(_lowercase       )
		UpperCamelCase__         =	{}

		for item in distinct_edge:
				UpperCamelCase__         =	get_bitcode(_lowercase ,						_lowercase       )
				# print('bit',bit)
				# bt=''.join(bit)
				UpperCamelCase__         =	bit.count("""1"""       )
				UpperCamelCase__         =	[s, bit]
		# Store [Distinct edge, WT(Bitcode), Bitcode] in descending order
		UpperCamelCase__         =	[
		    [k, v[0], v[1]]
		    for k, v in sorted(frequency_table.items() ,						key=lambda _lowercase       : v[1][0] ,						reverse=_lowercase       )
		]
		return sorted_frequency_table

def     a						(      _lowercase   :     str       )     ->Union[str, Any]:
		UpperCamelCase__         =	{}
		for _, item in enumerate(_lowercase       ):
				nodes.setdefault(item[2] ,						[]       ).append(item[0]       )
		return nodes

def     a						(      _lowercase   :     str       )     ->List[Any]:
		UpperCamelCase__         =	{}
		for key, value in nodes.items():
				UpperCamelCase__         =	value
		return cluster

def     a						(      _lowercase   :     str       )     ->Optional[Any]:
		return [i * 1_0_0 / len(_lowercase       ) for i in cluster]

def     a						(      )     ->None:
		print("""\nNodes\n"""       )
		for key, value in nodes.items():
				print(_lowercase ,						_lowercase       )
		print("""\nSupport\n"""       )
		print(_lowercase       )
		print("""\n Cluster \n"""       )
		for key, value in sorted(cluster.items() ,						reverse=_lowercase       ):
				print(_lowercase ,						_lowercase       )
		print("""\n Graph\n"""       )
		for key, value in graph.items():
				print(_lowercase ,						_lowercase       )
		print("""\n Edge List of Frequent subgraphs \n"""       )
		for edge_list in freq_subgraph_edge_list:
				print(_lowercase       )

def     a						(      _lowercase   :     Any ,						_lowercase   :     int ,						_lowercase   :     Any ,						_lowercase   :     Union[str, Any]       )     ->Tuple:
		for i in cluster[ca]:
				UpperCamelCase__         =	0
				UpperCamelCase__         =	ca + 1
				while ca < max(cluster.keys()       ):
						for j in cluster[ca]:
								if int(_lowercase ,						2       ) & int(_lowercase ,						2       ) == int(_lowercase ,						2       ):
										if tuple(nodes[i]       ) in graph:
												graph[tuple(nodes[i]       )].append(nodes[j]       )
										else:
												UpperCamelCase__         =	[nodes[j]]
										count += 1
						if count == 0:
								UpperCamelCase__         =	ca + 1
						else:
								break

def     a						(      _lowercase   :     Dict ,						_lowercase   :     str       )     ->Any:
		UpperCamelCase__         =	cluster[max(cluster.keys()       )]
		UpperCamelCase__         =	"""Header"""
		UpperCamelCase__         =	{}
		for i in x:
				if (["Header"],) in graph:
						graph[(["Header"],)].append(x[i]       )
				else:
						UpperCamelCase__         =	[x[i]]
		for i in x:
				UpperCamelCase__         =	[["""Header"""]]
		UpperCamelCase__         =	1
		while i < max(_lowercase       ) - 1:
				create_edge(_lowercase ,						_lowercase ,						_lowercase ,						_lowercase       )
				UpperCamelCase__         =	i + 1
		return graph

def     a						(      _lowercase   :     Dict ,						_lowercase   :     int ,						_lowercase   :     List[str] ,						_lowercase   :     Union[str, Any]=None       )     ->int:
		UpperCamelCase__         =	(path or []) + [start]
		if start == end:
				paths.append(_lowercase       )
		for node in graph[start]:
				if tuple(_lowercase       ) not in path:
						my_dfs(_lowercase ,						tuple(_lowercase       ) ,						_lowercase ,						_lowercase       )

def     a						(      _lowercase   :     Any ,						_lowercase   :     List[str] ,						_lowercase   :     Any       )     ->Union[str, Any]:
		UpperCamelCase__         =	int(s / 1_0_0 * (len(_lowercase       ) - 1)       )
		for i in cluster[k]:
				my_dfs(_lowercase ,						tuple(cluster[k][i]       ) ,						(["""Header"""],)       )

def     a						(      _lowercase   :     int       )     ->Optional[Any]:
		UpperCamelCase__         =	[]
		for edges in paths:
				UpperCamelCase__         =	[]
				for j in range(len(_lowercase       ) - 1       ):
						UpperCamelCase__         =	list(edges[j]       )
						for e in temp:
								UpperCamelCase__         =	(e[0], e[1])
								el.append(_lowercase       )
				freq_sub_el.append(_lowercase       )
		return freq_sub_el

def     a						(      _lowercase   :     Union[str, Any]       )     ->Optional[int]:
		for i in range(len(_lowercase       )       ):
				for j in range(len(edge_array[i]       )       ):
						UpperCamelCase__         =	edge_array[i][j].split("""-"""       )
						UpperCamelCase__         =	t


if __name__ == "__main__":
				preprocess(edge_array)
				__lowerCAmelCase     =			get_frequency_table(edge_array)
				__lowerCAmelCase     =			get_nodes(frequency_table)
				__lowerCAmelCase     =			get_cluster(nodes)
				__lowerCAmelCase     =			get_support(cluster)
				__lowerCAmelCase     =			construct_graph(cluster, nodes)
				find_freq_subgraph_given_support(60, cluster, graph)
				__lowerCAmelCase     =			[]
				__lowerCAmelCase     =			freq_subgraphs_edge_list(paths)
				print_all()












def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 9 / 5) + 3_2 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round(float(_lowercase       ) + 273.15 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 9 / 5) + 491.67 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) - 3_2) * 5 / 9 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round(((float(_lowercase       ) - 3_2) * 5 / 9) + 273.15 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round(float(_lowercase       ) + 459.67 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round(float(_lowercase       ) - 273.15 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round(((float(_lowercase       ) - 273.15) * 9 / 5) + 3_2 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 9 / 5) ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) - 491.67) * 5 / 9 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round(float(_lowercase       ) - 459.67 ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 5 / 9) ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 1.25 + 273.15) ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 2.25 + 3_2) ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 1.25) ,						_lowercase       )

def     a						(      _lowercase   :     float ,						_lowercase   :     int = 2       )     ->float:
		return round((float(_lowercase       ) * 2.25 + 3_2 + 459.67) ,						_lowercase       )


if __name__ == "__main__":
				import doctest

				doctest.testmod()





