--- a/docs/intro.rst	Thu May 07 16:06:59 2026 +0200
+++ b/docs/intro.rst	Thu May 07 16:12:15 2026 +0200
@@ -85,40 +85,40 @@
 
 A synthetic example with most features:
 
-.. literalinclude:: example-1.pseudocode
+.. literalinclude:: examples/example-1.pseudocode
    :language: algpseudocode
    :lines: 2-
 
 With a customized `AlgPseudocodeLexer` and its `no_end`
 option set to ``True``.
 
-.. literalinclude:: example-1.pseudocode
+.. literalinclude:: examples/example-1.pseudocode
    :language: NoEndAlgPseudocode
    :lines: 2-
 
 This is Wikipedia's description of *Dinic's Algorithm*
 (see https://en.wikipedia.org/wiki/Dinic%27s_algorithm):
 
-.. literalinclude:: algorithm-dinic.description
+.. literalinclude:: examples/algorithm-dinic.description
    :language: algpseudocode
    :lines: 2-
 
 This is Wikipedia's pseudocode of the *Ford–Fulkerson Algorithm*
 (see https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm):
 
-.. literalinclude:: algorithm-ford-fulkerson.pseudocode
+.. literalinclude:: examples/algorithm-ford-fulkerson.pseudocode
    :language: algpseudocode
    :lines: 2-
 
 This is Wikipedia's pseudocode of the *Edmonds–Karp Algorithm*
 (see https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm):
 
-.. literalinclude:: algorithm-edmonds-karp.pseudocode
+.. literalinclude:: examples/algorithm-edmonds-karp.pseudocode
    :language: NoEndAlgPseudocode
    :lines: 2-
 
 And now the *Edmonds–Karp Algorithm* with french keywords:
 
-.. literalinclude:: algorithm-edmonds-karp.pseudocode
+.. literalinclude:: examples/algorithm-edmonds-karp.pseudocode
    :language: algpseudocode-fr
    :lines: 2-