From 5d42fefe6e06c94775a6520aca1a016cee482a37 Mon Sep 17 00:00:00 2001 From: Caspar Safarlou Date: Sat, 15 Nov 2014 18:27:49 +0100 Subject: [PATCH] added examples --- report/.Rhistory | 0 report/ass2.tex | 8 ++++++++ 2 files changed, 8 insertions(+) create mode 100644 report/.Rhistory diff --git a/report/.Rhistory b/report/.Rhistory new file mode 100644 index 0000000..e69de29 diff --git a/report/ass2.tex b/report/ass2.tex index 74c8365..3ea2ea4 100644 --- a/report/ass2.tex +++ b/report/ass2.tex @@ -2,5 +2,13 @@ \subsubsection{Task 12: Generate conflict} \subsubsection{Task 13: Define your data structure} +Our datastructure uses the predicate node to signify nodes and leaf for leaves. A node contains a list of edge labels and another list (with the same length as the amound of edge labels) that contains nodes or leaves. The edge label corresponds with its order in the list it is in. +Good examples: +isHittingSetTree(node([a,b],[leaf,leaf])). +isHittingSetTree(node([a,b], [node([c,d], [leaf,leaf]), node([e,f], [leaf,leaf])])). +isHittingSetTree(node([a,b], [node([c,d], [node([g,h,i], [leaf,leaf,leaf]),leaf]), node([a,f], [leaf,leaf])])). +Wrong examples: + +isHittingSetTree(node([a,b], [node([c,d], [node([g,h], [leaf,leaf,leaf]),leaf]), node([a,f], [leaf,leaf])])). \subsubsection{Task 14: Implementation} -- 2.20.1