diff options
| author | mo khan <mo.khan@gmail.com> | 2020-08-26 15:47:12 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-08-26 15:47:12 -0600 |
| commit | 5d9ebbb06e09be0fff4d94d9f31030842be45333 (patch) | |
| tree | d8f7924ef7ab44dca52acf99844b327b248df184 | |
| parent | e3d7861db654d24a8040a8130f21de7777142a4d (diff) | |
Draw graph
| -rw-r--r-- | src/03/05/README.md | 14 |
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) +``` |