#158 in progress

Author: Hamid Gasmi

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/__pycache__/suffix_tree.cpython-36.pyc

@@ -1,13 +1,65 @@
 # python3
 import sys
+import suffix_tree
+import queue
+from collections import namedtuple
 
+Edge = namedtuple('Edge', ['parent', 'node', 'start', 'len'])
+
+# BFS traversal on the tree
+def non_shared_substring(suffix_tree, len_text):
+
+	fifo = queue.Queue()
+	edge = Edge(-1, 0, 0, 0)
+	fifo.put(edge)
+
+	while not fifo.empty():
+
+		parent_edge = fifo.get()
+		node = parent_edge.node
+		parent = parent_edge.parent
+
+		right_part = False
+		end_left_part = True
+		for child in suffix_tree.nodes[node]:
+
+			child_edge = suffix_tree.nodes[node][child]
+
+			right_part = True if child_edge.start > len_text else right_part
+			end_left_part = end_left_part if child_edge.start == len_text else False
+
+			if child_edge.start >= len_text:
+				continue
+			
+			current_len = 0 if parent == -1 else suffix_tree.nodes[parent][node].len
+			edge = Edge(node, child, parent_edge.start, current_len + parent_edge.len)
+			fifo.put(edge)
+
+		if len(suffix_tree.nodes[node]) == 0:
+			print("Over here 2")
+			edge = Edge(parent, node, parent_edge.start, parent_edge.len + 1)
+			break
+
+		elif (not right_part) and end_left_part:
+			print("Over here 1: ", suffix_tree.nodes[node])
+			edge = Edge(parent, node, parent_edge.start, parent_edge.len)
+			break
+
+	return suffix_tree.text[edge.start:edge.start + edge.len]
+	
 def solve (p, q):
-	result = p
-	return result
+	pq_text = p + "#" + q + "$"
+	
+	suffixTree = suffix_tree.Suffix_Tree(pq_text)
+	print(suffixTree.nodes)
 
-p = sys.stdin.readline ().strip ()
-q = sys.stdin.readline ().strip ()
+	result = non_shared_substring(suffixTree, len(p))
+	
+	return result
 
-ans = solve (p, q)
+if __name__ == "__main__":
+	p = sys.stdin.readline ().strip ()
+	q = sys.stdin.readline ().strip ()
 
-sys.stdout.write (ans + '\n')
+	ans = solve (p, q)
+	sys.stdout.write (ans + '\n')

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring.py

@@ -1,2 +1,2 @@
-AAAAAAAAAAAAAAAAAAAA
-TTTTTTTTTTTTTTTTTTTT
+AA
+TT

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/02

@@ -1 +1 @@
-A
+A

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/02e

@@ -1,2 +1,2 @@
-CCAAGCTGCTAGAGG
-CATGCTGGGCTGGCT
+AAA
+TTT

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/03

@@ -1 +1 @@
-AA
+A

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/03e

@@ -1,2 +1,2 @@
-ATGCGATGACCTGACTGA
-CTCAACGTATTGGCCAGA
+AAAAAAAAAAAAAAAAAAAA
+TTTTTTTTTTTTTTTTTTTT

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/04

@@ -1 +1 @@
-ATG
+A

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/04e

@@ -0,0 +1,2 @@
+CCAAGCTGCTAGAGG
+CATGCTGGGCTGGCT

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/05

@@ -0,0 +1 @@
+AA

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/05e

@@ -0,0 +1,2 @@
+ATGCGATGACCTGACTGA
+CTCAACGTATTGGCCAGA

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/06

@@ -0,0 +1 @@
+ATG

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/06e

@@ -0,0 +1,2 @@
+CAAAC
+AACCC

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/07

@@ -0,0 +1,2 @@
+CACAA
+AACCC

5-string-processing-and-pattern-matching-algorithms/1-suffix-trees/non_shared_substring_tests/08

@@ -0,0 +1,2 @@
+CAACAA
+AAACCC