docs quick start

Ziaeemehr · Aug 4, 2024 · 63d7c4c · 63d7c4c
1 parent 5ae75a2
commit 63d7c4c
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 5 deletions.
diff --git a/docs/conf.py b/docs/conf.py
@@ -5,7 +5,7 @@
 
 # sys.path.insert(0,os.path.abspath("../examples"))
 sys.path.insert(0,os.path.abspath("../netsci"))
-sys.path.insert(0, os.path.abspath("."))
+sys.path.insert(0, os.path.abspath("../examples/"))
 
 needs_sphinx = '1.3'
 

diff --git a/docs/quick_start.py → examples/quick_start.py b/docs/quick_start.py → examples/quick_start.py
@@ -2,27 +2,27 @@
 
 First import the necessary libraries:
 
-.. literalinclude:: quick_start.py
+.. literalinclude:: ../examples/quick_start.py
     :start-after: example-st\u0061rt
     :lines: 1-4
     :dedent: 0
 
 Next, create a simple graph with self-avoiding edges (SAE) between nodes.
 
-.. literalinclude:: quick_start.py
+.. literalinclude:: ../examples/quick_start.py
     :start-after: example-st\u0061rt
     :lines: 6-8
 
 
 Now, find all self-avoiding paths from a given start node to a target node.
 
-.. literalinclude:: quick_start.py
+.. literalinclude:: ../examples/quick_start.py
     :start-after: example-st\u0061rt
     :lines: 11-16
 
 Finally, visualize the graph.
 
-.. literalinclude:: quick_start.py
+.. literalinclude:: ../examples/quick_start.py
     :start-after: example-st\u0061rt
     :lines: 18