-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBeamer.tex
More file actions
100 lines (80 loc) · 2.1 KB
/
Beamer.tex
File metadata and controls
100 lines (80 loc) · 2.1 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
\documentclass{beamer}
\usetheme{CambridgeUS}
%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% --- TITLE PAGE --- %%%
%%%%%%%%%%%%%%%%%%%%%%%%%%
\title[titleAbbreviation]{Title of the Presentation}
\subtitle{Subtitle}
\author[M. Mustermann, A. Algorithmus]{Max Mustermann, Alicia Algorithmus}
\date[sumDate]{sumDate}
\setbeamertemplate{title page}{
\begin{center}
{\usebeamerfont{title}\inserttitle\par}
\vspace{0.3cm}
{\usebeamerfont{subtitle}\insertsubtitle\par}
\vspace{0.5cm}
{\usebeamerfont{author}\insertauthor\par}
\vspace{0.3cm}
{\usebeamerfont{institute}\insertinstitute\par}
\vspace{0.3cm}
{\usebeamerfont{date}\insertdate\par}
\vspace{0.50cm}
% \includegraphics[width=5.5cm]{logo.png}
\end{center}
}
%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% --- INSTITUTE --- %%%
%%%%%%%%%%%%%%%%%%%%%%%%%%
\institute[XXX]{
Computer Science Department\\
University of X
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% --- OTHER CONFIGS --- %%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\setbeamertemplate{navigation symbols}{}
\AtBeginSubsection[]
{
\begin{frame}
%\frametitle{Verzeichnis}
\tableofcontents[
currentsection
]
\end{frame}
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% --- CUSTOMISE END --- %%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{document}
\begin{frame}
\titlepage
\end{frame}
%\logo{
% \begin{minipage}{1cm}
% %\hfill
% \includegraphics[height=1cm]{logo2.png}
% \end{minipage}
%}
\begin{frame}{Table of Contents}
\tableofcontents[]
\end{frame}
\section{Introduction}
\subsection{SSSP Algorithms}
\begin{frame}{SSSP Algorithmen}
\begin{itemize}
\item<1-> Single-Source Shortest Path Algorithms (SSSP's)
\begin{itemize}
\item<2-> Input: a Graph $G$ and a Startnode $s$
\item<2-> Output: Shortest path from s to all other nodes
\end{itemize}
\end{itemize}
\end{frame}
\begin{frame}[plain]
\hypertarget{endearly}{}
\begin{center}
\vspace{2.5cm}
\Huge \color{teal}Thank you for your Attention!
\vspace{1.25cm}
\end{center}
\end{frame}
\end{document}