




from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst



def        __a							(  ) ->					Union[str, Any]:
							"""simple docstring"""




							lowerCamelCase_			:    Optional[int]   						=      9, 14  # noqa: F841
							lowerCamelCase_			:    int   						=      [
							    [0, 1, 4],
							    [0, 7, 8],
							    [1, 2, 8],
							    [7, 8, 7],
							    [7, 6, 1],
							    [2, 8, 2],
							    [8, 6, 6],
							    [2, 3, 7],
							    [2, 5, 4],
							    [6, 5, 2],
							    [3, 5, 14],
							    [3, 4, 9],
							    [5, 4, 10],
							    [1, 7, 11],
							]

							lowerCamelCase_			:    List[str]   						=      defaultdict(__UpperCAmelCase      )
							for nodea, nodea, cost in edges:
														adjancency[nodea].append([nodea, cost]      )
														adjancency[nodea].append([nodea, cost]      )

							lowerCamelCase_			:    Tuple   						=      mst(__UpperCAmelCase      )

							lowerCamelCase_			:    Union[str, Any]   						=      [
							    [7, 6, 1],
							    [2, 8, 2],
							    [6, 5, 2],
							    [0, 1, 4],
							    [2, 5, 4],
							    [2, 3, 7],
							    [0, 7, 8],
							    [3, 4, 9],
							]

							for answer in expected:
														lowerCamelCase_			:    Any   						=      tuple(answer[:2]      )
														lowerCamelCase_			:    int   						=      tuple(edge[::-1]      )
														assert edge in result or reverse in result








"""simple docstring"""





import numpy as np



def 					lowerCAmelCase_      (   SCREAMING_SNAKE_CASE							:				np.array ):


							'''simple docstring'''







							return 1 / (1 + np.exp(-vector ))


if __name__ == "__main__":
							import doctest

							doctest.testmod()




