summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
Diffstat (limited to 'src')
-rw-r--r--src/03/05/README.md14
1 files changed, 14 insertions, 0 deletions
diff --git a/src/03/05/README.md b/src/03/05/README.md
index c1bccdd..1525a42 100644
--- a/src/03/05/README.md
+++ b/src/03/05/README.md
@@ -5,3 +5,17 @@ Given the graph shown below, answer the following questions:
1. Illustrate adjacency list representation and adjacency matrix representation, respectively, for this graph.
* What are the advantages and disadvantages of those two representations?
1. Describe an algorithm to find in the graph a path illustrated below that goes through every edge exactly once in each direction.
+
+
+```plaintext
+(a)---(b)---(c)---(d)
+ | \ / /
+ | \ / /
+(e) \(f)/ (g)/--(h)
+ | | / | /
+ | | / | /
+(i)---(j)/ (k) / (l)
+ | \ | / |
+ | \ |/ |
+(m) \(n)---(o)---(p)
+```