Add exercice 1 td1 partie 2
This commit is contained in:
parent
c06b832af8
commit
9ef91c01fd
2 changed files with 116 additions and 72 deletions
|
@ -13,83 +13,127 @@
|
|||
|
||||
\maketitle
|
||||
|
||||
\section{Exercice 1}
|
||||
\section{TD1 --- Partie 1}
|
||||
|
||||
\paragraph{Graphe simple}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (2,0) {};
|
||||
\path (a) edge (b);
|
||||
\end{tikzpicture}
|
||||
\subsection{Exercice 1}
|
||||
|
||||
\paragraph{Graphe multigraphe}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (2,0) {};
|
||||
\path
|
||||
(a) [bend left] edge (b)
|
||||
(b) [bend left] edge (a)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
\paragraph{Graphe simple}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (2,0) {};
|
||||
\path (a) edge (b);
|
||||
\end{tikzpicture}
|
||||
|
||||
\paragraph{Graphe connexe}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,1) {};
|
||||
\node(c)[state] at (2,0) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(b) edge (c)
|
||||
(c) edge (a)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
\paragraph{Graphe multigraphe}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (2,0) {};
|
||||
\path
|
||||
(a) [bend left] edge (b)
|
||||
(b) [bend left] edge (a)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
|
||||
\paragraph{Graphe non connexe}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,1) {};
|
||||
\node(c)[state] at (2,0) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(b) edge (c)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
\paragraph{Graphe connexe}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,1) {};
|
||||
\node(c)[state] at (2,0) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(b) edge (c)
|
||||
(c) edge (a)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
|
||||
\paragraph{Graphe complet}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,0) {};
|
||||
\node(c)[state] at (0,1) {};
|
||||
\node(d)[state] at (1,1) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(a) edge (c)
|
||||
(a) edge (d)
|
||||
(b) edge (c)
|
||||
(b) edge (d)
|
||||
(c) edge (d)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
\paragraph{Graphe non connexe}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,1) {};
|
||||
\node(c)[state] at (2,0) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(b) edge (c)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
|
||||
\paragraph{Graphe biparti}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,0) {};
|
||||
\node(c)[state] at (0,1) {};
|
||||
\node(d)[state] at (1,1) {};
|
||||
\node(e)[state] at (2,0) {};
|
||||
\node(f)[state] at (2,1) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(a) edge (c)
|
||||
(a) edge (d)
|
||||
(b) edge (c)
|
||||
(b) edge (d)
|
||||
(c) edge (d)
|
||||
(d) edge (e)
|
||||
(d) edge (f)
|
||||
(e) edge (f)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
\paragraph{Graphe complet}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,0) {};
|
||||
\node(c)[state] at (0,1) {};
|
||||
\node(d)[state] at (1,1) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(a) edge (c)
|
||||
(a) edge (d)
|
||||
(b) edge (c)
|
||||
(b) edge (d)
|
||||
(c) edge (d)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
|
||||
\paragraph{Graphe biparti}
|
||||
\begin{tikzpicture}[auto,x=2cm,y=2cm]
|
||||
\node(a)[state] at (0,0) {};
|
||||
\node(b)[state] at (1,0) {};
|
||||
\node(c)[state] at (0,1) {};
|
||||
\node(d)[state] at (1,1) {};
|
||||
\node(e)[state] at (2,0) {};
|
||||
\node(f)[state] at (2,1) {};
|
||||
\path
|
||||
(a) edge (b)
|
||||
(a) edge (c)
|
||||
(a) edge (d)
|
||||
(b) edge (c)
|
||||
(b) edge (d)
|
||||
(c) edge (d)
|
||||
(d) edge (e)
|
||||
(d) edge (f)
|
||||
(e) edge (f)
|
||||
;
|
||||
\end{tikzpicture}
|
||||
|
||||
\section{TD1 --- Partie 2}
|
||||
|
||||
\subsection{Exercice 1}
|
||||
|
||||
Dans le graphe ci-dessous~:
|
||||
|
||||
\includegraphics[width=\linewidth]{./img/td1-ex1.png}
|
||||
|
||||
\begin{enumerate}
|
||||
|
||||
\item Quels sont les successeurs de A, D et E~?
|
||||
|
||||
A~: B, F \\
|
||||
B~: A, C, D, J \\
|
||||
E~: D, F
|
||||
|
||||
\item Quels sont les prédécesseurs de B, C et F~?
|
||||
|
||||
B~: A, C, D \\
|
||||
C~: B, D \\
|
||||
F~: A, E
|
||||
|
||||
\item Est-ce qu'il y a des points qui n'ont pas de prédécesseur, ni successeur~?
|
||||
Lesquels~?
|
||||
|
||||
G
|
||||
|
||||
\item Quelle est l'extrémité initiale de l'arc $(A,B)$~?
|
||||
|
||||
A
|
||||
|
||||
\item Quelle est l'extrémité terminale de l'arc $(B,C)$~?
|
||||
|
||||
C
|
||||
|
||||
\item Est-ce qu'il y a des points qui ont à la fois l'extrémité initiale et terminale~?
|
||||
Lesquels~?
|
||||
|
||||
A, B, C, D, E, F
|
||||
|
||||
\end{enumerate}
|
||||
|
||||
\end{document}
|
||||
|
|
BIN
theorie-graphes/img/td1-ex1.png
Normal file
BIN
theorie-graphes/img/td1-ex1.png
Normal file
Binary file not shown.
After Width: | Height: | Size: 60 KiB |
Loading…
Reference in a new issue