




from __future__ import annotations







def 	_a      (						SCREAMING_SNAKE_CASE_							:				list[int]     ):
					if not nums:
										return 0
					__lowerCAmelCase				   =       nums[0]
					__lowerCAmelCase				   =       0
					for num in nums[1:]:
										__lowerCAmelCase   ,							__lowerCAmelCase				   =       (
										    max_excluding + num,
										    max(SCREAMING_SNAKE_CASE_      ,      SCREAMING_SNAKE_CASE_     ),
										)
					return max(SCREAMING_SNAKE_CASE_      ,      SCREAMING_SNAKE_CASE_     )


if __name__ == "__main__":
					import doctest

					doctest.testmod()









from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst





def      __snake_case	(			):
    __a       ,   __a						       =				9, 14  # noqa: F841
    __a						       =				[
        [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],
    ]

    __a						       =				defaultdict(_UpperCAmelCase				)
    for nodea, nodea, cost in edges:
        adjancency[nodea].append([nodea, cost]				)
        adjancency[nodea].append([nodea, cost]				)

    __a						       =				mst(_UpperCAmelCase				)

    __a						       =				[
        [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:
        __a						       =				tuple(answer[:2]				)
        __a						       =				tuple(edge[::-1]				)
        assert edge in result or reverse in result





