\subsection{Topology Representation}
-The topology is represented internally with a a std::map between hosts and bridges, since each host may only appear on one bridge, and a std::set of pairs which contains bridge to bridge links with a custom comparator. The custom comparator is designed in order to give a total order to links, without caring about order, as links are bidirectional. Thus <1,2> is treated equal to <2,1>. The order defined is that <1,2> < <1,3> < <4,1> < <3,4>, in other words, the lower number is used for the primary sort, and the larger one as a secondary sort. These provided adequate performance for the purpose.
+The topology is represented internally with a a std::map between hosts and bridges, since each host may only appear on one bridge, and a std::set of pairs which contains bridge to bridge links with a custom comparator. The custom comparator is designed in order to give a total order to links, without caring about order, as links are bidirectional. Thus $<1,2>$ is treated equal to $<2,1>$. The order defined is that $<1,2>$ < $<1,3>$ < $<4,1>$ < $<3,4>$, in other words, the lower number is used for the primary sort, and the larger one as a secondary sort. These provided adequate performance for the purpose.
\subsection{MOOSE State Tables}