Issue #153 is started

Author: Hamid Gasmi

4-np-complete-problems/2-coping_with_np_completeness/plan_party.py

@@ -1,28 +1,28 @@
 #uses python3
-
 import sys
 import threading
 
-# This code is used to avoid stack overflow issues
-sys.setrecursionlimit(10**6) # max depth of recursion
-threading.stack_size(2**26)  # new thread will get stack of such size
-
+# This problem can be reduced to Independent Set problem (ISP) which is an NP problem
+# It's a special case of ISP 
+# It's can be solved effeciently with Dynamic Programming technique:
+# Let's W(v) reprensents the Total Fun (weight) in the party, then:
+# F(v) = Max(weight(v) + sum(weight(u) for all u grand-children of v),
+#                        sum(weight(u) for all u children of v))
 
 class Vertex:
     def __init__(self, weight):
         self.weight = weight
         self.children = []
 
+class Tree:
+    def __init__(self, size, weights):
+        self.size = size
+        self.weights = [weights[i] for i in range(size)]
 
+        
 def ReadTree():
-    size = int(input())
-    tree = [Vertex(w) for w in map(int, input().split())]
-    for i in range(1, size):
-        a, b = list(map(int, input().split()))
-        tree[a - 1].children.append(b - 1)
-        tree[b - 1].children.append(a - 1)
-    return tree
-
+    
+    
 
 def dfs(tree, vertex, parent):
     for child in tree[vertex].children:
@@ -44,10 +44,25 @@ def MaxWeightIndependentTreeSubset(tree):
 
 
 def main():
-    tree = ReadTree();
-    weight = MaxWeightIndependentTreeSubset(tree);
+    tree = ReadTree()
+    weight = MaxWeightIndependentTreeSubset(tree)
     print(weight)
 
+if __name__ == "__main__":
+    
+    # To avoid stack overflow issues
+    sys.setrecursionlimit(10**6) # max depth of recursion
+    threading.stack_size(2**26)  # new thread will get stack of such size
+
+    size = int(input())
+    weights = map(int, input().split())
+    print(weights)
+    #tree = [Vertex(w) for w in map(int, input().split())]
+    #for i in range(1, size):
+    #    a, b = list(map(int, input().split()))
+    #    tree[a - 1].children.append(b - 1)
+    #    tree[b - 1].children.append(a - 1)
+    #return tree
 
-# This is to avoid stack overflow issues
-threading.Thread(target=main).start()
+    # This is to avoid stack overflow issues
+    #threading.Thread(target=main).start()

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/01

@@ -1,2 +1 @@
 1
-1000

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/01e

@@ -1 +1,3 @@
-1000
+1
+1
+

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/02

@@ -1,3 +1,2 @@
 2
 1 2
-1 2

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/02e

@@ -1 +1,3 @@
+1
 2
+

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/03

@@ -1,5 +1,4 @@
 5
-1 5 3 7 5
 5 4
 2 3
 4 2

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/03e

@@ -1 +1,2 @@
-11
+3
+1 3 5

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/04

@@ -0,0 +1,11 @@
+11
+1 2
+1 3
+1 4
+2 5
+3 6
+4 7
+4 8
+7 9
+7 10
+7 11

4-np-complete-problems/2-coping_with_np_completeness/plan_party_tests/04e

@@ -0,0 +1,2 @@
+7
+1 5 6 8 9 10 11