-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathmain.tex
More file actions
48 lines (34 loc) · 1.44 KB
/
main.tex
File metadata and controls
48 lines (34 loc) · 1.44 KB
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
% This is a template for your written document.
%
% To compile using latexmk on the command line, run the following:
% latexmk -pdf main.tex
\documentclass[12pt]{article}
\usepackage{setspace}
\singlespace
\usepackage[left=1in,right=1in,top=1in,bottom=1in]{geometry}
\usepackage{graphicx}
\title{\textbf{Project Topic}}
\author{Your Name}
\begin{document}
\maketitle
\section{Introduction}
The introduction will broadly introduce your topic, motivate it, and describe what will be done.
\section{Related Works}
\section{Methodology}
Dijkstra's algorithm was chosen for single-source shortest path computation on graphs with non-negative edge weights, following the implementation presented in CLRS~\cite{clrsAlgorithms}.
\section{Results}
An exemplary figure is shown in Figure~\ref{fig:dijkstra}. Any time a figure is used, it must have a capation and be directly referred to and discussed in the text.
%\begin{figure}[b] puts the image to the (closest) bottom of page
%\begin{figure}[t] puts the image to the (closest) top of page
%\begin{figure}[h] allows the image to float, putting it roughly wherever it was placed in the text.
\begin{figure}[b]
\begin{center}
\includegraphics[width=5cm]{imgs/dijkstra.png}
\caption{Dijkstra's algorithm does not work on graphs with negative edge weights, as evidenced here.}
\label{fig:dijkstra}
\end{center}
\end{figure}
\section{Conclusion}
\bibliographystyle{acm}
\bibliography{bibliography.bib}
\end{document}