mirror of
https://github.com/MartinThoma/LaTeX-examples.git
synced 2025-04-26 06:48:04 +02:00
7740f0147f
The commands
find . -type f -name '*.md' -exec sed --in-place 's/[[:space:]]\+$//' {} \+
and
find . -type f -name '*.tex' -exec sed --in-place 's/[[:space:]]\+$//' {} \+
were used to do so.
29 lines
1 KiB
TeX
29 lines
1 KiB
TeX
\subsection{Zweifachverbundener Graph}
|
|
\begin{frame}{Zweifachverbundener Graph}{Biconnected graph}
|
|
\begin{block}{Zweifachverbundener Graph}
|
|
Ein Graph $G=(E,V)$ ist genau dann zweifach verbunden (engl. biconnected), wenn er keine Artikulationspunkte enthält.
|
|
\end{block}
|
|
Problem: Ist gegebener Graph zweifach verbunden? \\
|
|
$\Rightarrow$ Suche nach Artikulationspunken!
|
|
\end{frame}
|
|
|
|
\begin{frame}{Beispiel}
|
|
\begin{figure}
|
|
\begin{tikzpicture}[scale=1.8, auto,swap]
|
|
% Draw a 7,11 network
|
|
% First we draw the vertices
|
|
\foreach \pos/\name in {{(0,0)/a}, {(0,2)/b}, {(1,2)/c},
|
|
{(1,0)/d}, {(2,1)/e}, {(3,1)/f},
|
|
{(4,2)/g}, {(5,2)/h}, {(4,0)/i},
|
|
{(5,0)/j}}
|
|
\node[vertex] (\name) at \pos {$\name$};
|
|
% Connect vertices with edges
|
|
\foreach \source/ \dest /\pos in {a/b/,b/c/,c/d/,d/a/,
|
|
d/e/,e/c/,
|
|
e/f/,
|
|
f/g/, f/i/,g/c/,
|
|
g/h/, h/j/, j/i/, i/g/}
|
|
\path (\source) edge [\pos] node {} (\dest);
|
|
\end{tikzpicture}
|
|
\end{figure}
|
|
\end{frame}
|