Report organisation practical 1

3 files changed, 6 insertions, 6 deletions

diff --git a/Practical1/report/implementation.tex b/Practical1/report/implementation.tex
index 6df8932..8a667f1 100644
--- a/Practical1/report/implementation.tex
+++ b/Practical1/report/implementation.tex
@@ -1,4 +1,4 @@
-\section{Implementing the algorithm}
+\section{Implementation}
 \label{sec:implementation}
 
 A Java application accompanies this report. I have chosen for a simple implementation of a vertex:
diff --git a/Practical1/report/notation.tex b/Practical1/report/notation.tex
index 3458029..07f9a34 100644
--- a/Practical1/report/notation.tex
+++ b/Practical1/report/notation.tex
@@ -1,4 +1,5 @@
 \section{Notation}
+\label{sec:notation}
 I'm largely following Robson's notation \cite{robson}. For a graph $G=(V,E)$ and vertex $v\in V$, and edge $e\in E$, we write $d(v)$ for the degree of the vertex. $N(v)$ is the set of $v$'s neighbours, and $\iN(v)=N(v)\cup\{v\}$, $v$'s `inclusive neighbourhood'. Then $N^2(v)$ is the set of second order neighbours of $v$, excluding $v$: $N^2(v)=\{v_2 \in N(v_1) \mid v_1\in N(v)\} \setminus \{v\}$. If $\iN(v)\subseteq\iN(w)$, $v$ is said to dominate $w$, notation: $v>w$.
 
 We write `subgraph' for `vertex-induced subgraph', and $G\ex U$ for the subgraph induced on $G$ by $U$. For $v\in V$, we write $G\ex v$ for $G\ex\{v\}$. We use $e(v,w)$ for the predicate $(v,w)\in E$. We're strictly talking about non-directed graphs, so this is equivalent with $(w,v)\in E$.
diff --git a/Practical1/report/report.tex b/Practical1/report/report.tex
index 2172329..4b24662 100644
--- a/Practical1/report/report.tex
+++ b/Practical1/report/report.tex
@@ -1,9 +1,5 @@
 \documentclass[10pt,a4paper]{article}
 
-% textcomp package is not available everywhere, and we only need the Copyright symbol
-% taken from http://tex.stackexchange.com/a/1677/23992
-\DeclareTextCommandDefault{\textregistered}{\textcircled{\check@mathfonts\fontsize\sf@size\z@\math@fontsfalse\selectfont R}}
-
 \usepackage{fancyhdr}
 \renewcommand{\headrulewidth}{0pt}
 \renewcommand{\footrulewidth}{0pt}
@@ -48,6 +44,7 @@
 \usepackage{algorithmic}
 \providecommand*{\algorithmautorefname}{Algorithm}
 
+\renewcommand*{\sectionautorefname}{Section}
 \renewcommand*{\subsectionautorefname}{subsection}
 \renewcommand*{\subsubsectionautorefname}{subsection}
 
@@ -70,7 +67,9 @@
 \end{abstract}
 
 \section{Report organisation}
-%todo
+\autoref{sec:notation} will define the notation used throughout this report. In \autoref{sec:algorithm} I will describe the algorithm and argue its correctness. First we will discuss the basic structure in \autoref{sec:algorithm:basic-structure} through \ref{sec:algorithm:further-optimisations}. After that, we will discuss some helper functions in \autoref{sec:algorithm:helper-function}.
+
+When we have seen the algorithm, \autoref{sec:implementation} will go into details about its implementation in Java. \autoref{sec:analysis} will contain a complexity analysis, both time- and space-wise, of the algorithm and its Java implementation.
 
 \input{notation}
 \input{algorithm}