\exercice[style=A,N=3,verif]{Chemin le plus court}

Trouver le plus court chemin pour aller de A \`a G en utilisant l'algorithme de Dijkstra.
\begin{center}
\begin{tikzpicture}[scale=2]
\GraphInit[vstyle=Shade]
\tikzset{VertexStyle/.style = {draw,
shape = circle,
shading = ball,
ball color = violet,
minimum size = 24pt,
color = white}}
\tikzset{EdgeStyle/.style = {thick,double = violet,double distance = 1pt}}
\Vertex{C}
\Vertex[x=-1,y=1]{B}
\Vertex[x=-2.5,y=-1]{A}
\Vertex[x=2,y=-0.5]{D}
\Vertex[x=3,y=0]{F}
\Vertex[x=4,y=-1]{G}
\Vertex[x=0.5,y=-2]{E}
\Edge[label=15](A)(B)
\Edge[label=6](B)(C)
\Edge[label=13](A)(C)
\Edge[label=11](A)(E)
\Edge[label=7](C)(D)
\Edge[label=16](B)(F)
\Edge[label=2](D)(F)
\Edge[label=8](D)(E)
\Edge[label=18](C)(F)
\Edge[label=9](C)(E)
\Edge[label=5](D)(G)
\Edge[label=1](G)(F)
\tikzset{EdgeStyle/.append style = {bend right}}
\Edge[label=14](B)(E)
\Edge[label=19](E)(F)
\Edge[label=30](E)(G)
\end{tikzpicture}
\end{center}