From c0e0ae1e0399e17b5ad5f9a22905ab352153c8b7 Mon Sep 17 00:00:00 2001
From: Carlo Zancanaro <carlo@carlo-laptop>
Date: Tue, 27 Nov 2012 14:11:18 +1100
Subject: A bunch more thesis stuff.

---
 tex/thesis/appendices/tool-output.tex | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 tex/thesis/appendices/tool-output.tex

(limited to 'tex/thesis/appendices')

diff --git a/tex/thesis/appendices/tool-output.tex b/tex/thesis/appendices/tool-output.tex
new file mode 100644
index 0000000..3e85174
--- /dev/null
+++ b/tex/thesis/appendices/tool-output.tex
@@ -0,0 +1,30 @@
+\appendix
+\chapter{Analysis tool results}
+
+In the following output a min-cost flow operator is presented as
+\ttext{MCF<supplies,edges>(costs)}. This represents the solution to a
+min-cost flow problem where each node has a cost from ``supplies'',
+``edges'' indicates the topology of the directed graph and ``costs''
+indicates costs of the edges (which are the arguments to the
+operator).
+
+As an example, \ttext{MCF<[1,0,-1],[2:1,2:3,1:2]>(x1, x2, x3)} is a
+representation of the following graph:
+\begin{tikzpicture}[->,>=stealth',shorten >=1pt,auto,node
+    distance=2cm,main node/.style={circle,fill=blue!20,draw},every
+    loop/.style={min distance=1.5cm}]
+  
+  \node[main node] (2) {$0$};
+  \node[main node] (1) [above left of=V] {$1$};
+  \node[main node] (3) [above right of=V] {$-1$};
+  
+  \path[every node/.style={fill=none}]
+  (2) edge node{x1} (1)
+  (2) edge node{x2} (3)
+  (1) edge node{x3} (2);
+\end{tikzpicture}
+
+\section{Bubble sort}
+
+
+\section{}
-- 
cgit v1.2.3