1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
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{}
|
