|
4 | 4 |
|
5 | 5 | This repo covers basic graph algorithms for directed and undirected graphs with/without weights on edges. |
6 | 6 |
|
7 | | -Base graph data structure is targeted for **sparse graphs**. For example, it maintains adjancy list and pointrs. |
8 | | - |
9 | | -This is a relatively poor quality code produced over a weekend. Main objective behind this repository is purely educational. |
| 7 | +Base graph data structure is targeted for **sparse graphs** efficiency. For example, it maintains adjancy list and pointrs. |
10 | 8 |
|
11 | 9 | ## Algorithms Covered |
12 | 10 |
|
@@ -84,6 +82,7 @@ n3 3 [n2 n3 1] |
84 | 82 | ``` |
85 | 83 |
|
86 | 84 |
|
87 | | -## Summary |
| 85 | +## Disclaimer |
| 86 | + |
| 87 | +This is a quick and dirty code produced over a weekend. Main objective behind this repository is purely educational. It has quite a bit of room for improvement. Feel free to reach out if you spot weakness, bug, enancement or simply a suggestion. |
88 | 88 |
|
89 | | -It has quite a bit of room for improvement. Feel free to reach out if you spot weakness, bug, enancement or simply a suggestion. |
0 commit comments