|
@@ -1,6 +1,4 @@
|
|
|
-\TODO{some text}
|
|
|
-
|
|
|
-\section{Assumptions}
|
|
|
+\section{Assumptions}\label{sec:assumptions}
|
|
|
The following assumptions are made for the implementation of the node placement algorithm:
|
|
|
\begin{itemize}
|
|
|
\item There are no hyperedges.
|
|
@@ -15,7 +13,7 @@ An example is displayed in figure~\ref{fig:json-example}.
|
|
|
The structure is as follows:
|
|
|
\begin{itemize}
|
|
|
\item The object in the JSON file is a node.
|
|
|
- \item A node has the attributes that are displayed in table~\ref{table:node-attributes}. \TODO{remove x and y from implementation}
|
|
|
+ \item A node has the attributes that are displayed in table~\ref{table:node-attributes}.
|
|
|
\item An edge has the attributes that are displayed in table~\ref{table:edge-attributes}.
|
|
|
\end{itemize}
|
|
|
|
|
@@ -55,8 +53,7 @@ The structure is as follows:
|
|
|
%\end{figure}
|
|
|
|
|
|
\begin{figure}
|
|
|
- % \lstinputlisting[language=Python,emph={Conv2D,MaxPooling2D,Dropout,Flatten,Sequential,Dense}]{src/keras_example_conv.py}
|
|
|
- \begin{lstlisting}[language=json,emph={Conv2D,MaxPooling2D,Dropout,Flatten,Sequential,Dense}]
|
|
|
+ \begin{lstlisting}[language=json,emph={}]
|
|
|
{
|
|
|
"layers":[
|
|
|
[
|