1 \subsection{Implementation of the hitting-set algorithm
}
2 \subsubsection{Task
12: Generate conflict
}
3 Can be found in
\textit{./src/task12.pl
} or in Listing~
\ref{task12
}.
5 \subsubsection{Task
13: Define your data structure
}
6 Can be found in
\textit{./src/hs.pl
} or in Listing~
\ref{hs
}.
8 \caption{Examples of good hitting set trees
}
9 \begin{tikzpicture
} [grow=down
]
10 \node[bag
] {\
{$a, b\
}$
}
12 node
[end, label=below:$
\checkmark$
]{}
17 node
[end, label=below:$
\checkmark$
]{}
22 \begin{tikzpicture
} [grow=down
]
23 \node[bag
] {\
{$a, b\
}$
}
25 node
[bag
] {$\
{c, d\
}$
}
27 node
[end, label=below:$
\checkmark$
]{}
32 node
[end, label=below:$
\checkmark$
]{}
40 node
[end, label=below:$
\checkmark$
]{}
48 \caption{Examples of bad hitting set trees due to duplicate edge labels
}
49 \begin{tikzpicture
} [grow=down
]
50 \node[bag
] {\
{$a, b\
}$
}
52 node
[bag
] {$\
{c, a\
}$
}
54 node
[end, label=below:$
\checkmark$
]{}
59 node
[end, label=below:$
\checkmark$
]{}
67 node
[end, label=below:$
\checkmark$
]{}
74 \subsubsection{Task
14: Implementation
}
75 Can be found in
\textit{./src/task14part1.pl
} or in Listing~
\ref{task14part1
}.
76 Can be found in
\textit{./src/task14part2.pl
} or in Listing~
\ref{task14part2
}.