notes

commit 0b5b264fce70248a7c112b6da87a3b93ed258748
parent 085f452e9ab866bedd6fe90a88ffb0485c2c58b4
Author: Andrew <andrewlaack1@gmail.com>
Date:   Tue,  1 Oct 2024 17:44:46 -0500

Took some notes

Diffstat:
M
Algorithms.md
 | 
1
+
M
Assembly.md
 | 
4
++++
M
Tree.md
 | 
2
++

3 files changed, 7 insertions(+), 0 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -54,6 +54,7 @@ Ch 4 (graphs):
 	- [ConnectedComponent](ConnectedComponent.md)
 	- [WeightedGraph](WeightedGraph.md)
 	- [EmptyGraph](EmptyGraph.md)
+	- Isomorphism (relabel verticies still same graph)
 
 #### Intro To Algorithms (MIT)
 
diff --git a/Assembly.md b/Assembly.md
@@ -84,3 +84,7 @@ The ! means the address should be updated in the added register not the sum
 addgt
 
 bx
+
+cbz
+
+
diff --git a/Tree.md b/Tree.md
@@ -23,3 +23,5 @@ There is no implication about split numbers or anything of the sort, but somethi
 See [[LinkedLists.md]] as linked lists (when non-cyclic) are a form of tree.
 
 Also see [[BinaryTree.md]] for a specific tree type.
+
+Note: A graph with 0 or 1 nodes are both trees because there is a connection between all nodes.