notes

commit 085f452e9ab866bedd6fe90a88ffb0485c2c58b4
parent fc040afe342c7ba91b183d7821f3b5e5bef05c3f
Author: Andrew <andrewlaack1@gmail.com>
Date:   Mon, 30 Sep 2024 14:33:22 -0500

Took notes

Diffstat:
M
Algorithms.md
 | 
1
+
M
Assembly.md
 | 
2
++
A
EmptyGraph.md
 | 
8
++++++++

3 files changed, 11 insertions(+), 0 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -53,6 +53,7 @@ Ch 4 (graphs):
 	- [Subgraph](Subgraph.md)
 	- [ConnectedComponent](ConnectedComponent.md)
 	- [WeightedGraph](WeightedGraph.md)
+	- [EmptyGraph](EmptyGraph.md)
 
 #### Intro To Algorithms (MIT)
 
diff --git a/Assembly.md b/Assembly.md
@@ -81,4 +81,6 @@ str R0, [R1, #4]! ; EA = R1 + 4 and R1 = R1 + 4
 
 The ! means the address should be updated in the added register not the sum
 
+addgt
 
+bx
diff --git a/EmptyGraph.md b/EmptyGraph.md
@@ -0,0 +1,8 @@
+:data-structures: :cs: 
+# Empty Graph 
+
+Ch 4
+
+## Notes
+
+**Definition:** The empty graph is a graph that does not have any nodes and subsequently does not have any edges.