

"""simple docstring"""




import unittest

from knapsack import greedy_knapsack as kp







class   __lowercase      (     unittest.TestCase       ):

  def  __lowercase							(	self		:      int     ):






   '''simple docstring'''
   UpperCAmelCase__       :	Optional[int]        =       [10, 20, 30, 40, 50, 60]
   UpperCAmelCase__       :	Union[str, Any]        =       [2, 4, 6, 8, 10, 12]
   UpperCAmelCase__       :	List[Any]        =       100
   self.assertEqual(kp.calc_profit(lowerCamelCase_       ,lowerCamelCase_       ,lowerCamelCase_     )       ,210     )

  def  __lowercase							(	self		:      Tuple     ):






   '''simple docstring'''
   self.assertRaisesRegex(lowerCamelCase_       ,"""max_weight must greater than zero."""     )

  def  __lowercase							(	self		:      Optional[int]     ):






   '''simple docstring'''
   self.assertRaisesRegex(lowerCamelCase_       ,"""Weight can not be negative."""     )

  def  __lowercase							(	self		:      Optional[int]     ):






   '''simple docstring'''
   self.assertRaisesRegex(lowerCamelCase_       ,"""Profit can not be negative."""     )

  def  __lowercase							(	self		:      Optional[Any]     ):






   '''simple docstring'''
   self.assertRaisesRegex(lowerCamelCase_       ,"""max_weight must greater than zero."""     )




  def  __lowercase							(	self		:      Tuple     ):






   '''simple docstring'''
   self.assertRaisesRegex(
       lowerCamelCase_       ,"""The length of profit and weight must be same."""     )


if __name__ == "__main__":
      unittest.main()








"""simple docstring"""


class lowerCamelCase__   :



    '''simple docstring'''




    def __init__( self    )    ->      Union[str, Any]:
          A				  =		{}




    def UpperCamelCase__		( self    )    ->      None:
          print(self.vertex    )
          for i in self.vertex:
                print(lowerCamelCase_ ,""" -> """ ,""" -> """.join([str(lowerCamelCase_    ) for j in self.vertex[i]]    )    )




    def UpperCamelCase__		( self ,lowerCamelCase_ ,lowerCamelCase_    )    ->      None:
          # check if vertex is already present,
          if from_vertex in self.vertex:
                self.vertex[from_vertex].append(lowerCamelCase_    )
          else:
                # else make a new vertex
                A				  =		[to_vertex]




    def UpperCamelCase__		( self    )    ->      None:
          # visited array for storing already visited nodes
          A				  =		[False] * len(self.vertex    )

          # call the recursive helper function
          for i in range(len(self.vertex    )    ):
                if not visited[i]:
                      self.dfs_recursive(lowerCamelCase_ ,lowerCamelCase_    )




    def UpperCamelCase__		( self ,lowerCamelCase_ ,lowerCamelCase_    )    ->      None:
          # mark start vertex as visited
          A				  =		True

          print(lowerCamelCase_ ,end=""" """    )

          # Recur for all the vertices that are adjacent to this node
          for i in self.vertex:
                if not visited[i]:
                      self.dfs_recursive(lowerCamelCase_ ,lowerCamelCase_    )


if __name__ == "__main__":
  UpperCAmelCase													=Graph()
  g.add_edge(0, 1)
  g.add_edge(0, 2)
  g.add_edge(1, 2)
  g.add_edge(2, 0)
  g.add_edge(2, 3)
  g.add_edge(3, 3)

  g.print_graph()
  print("DFS:")
  g.dfs()

  # OUTPUT:
  # 0  ->  1 -> 2
  # 1  ->  2
  # 2  ->  0 -> 3
  # 3  ->  3
  # DFS:
  #  0 1 2 3




