notes

commit 5d3850ee3d06254acdae4ca2cbd1429f2618dc7b
parent f18f73d953af76408aa9a7b102ec5e3b769a9cc0
Author: Andrew <andrewlaack1@gmail.com>
Date:   Thu,  7 Nov 2024 14:07:10 -0600

Took some notes

Diffstat:
M
Algorithms.md
 | 
3
++-
M
DiscreteMath.md
 | 
8
++++++--
M
InformationContent.md
 | 
2
+-
A
MixedGraph.md
 | 
8
++++++++
A
PseudoGraphs.md
 | 
8
++++++++

5 files changed, 25 insertions(+), 4 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -78,8 +78,9 @@ Ch 6 (Information Theory and Data Compression)
 	- InformationTheory
 	- Codeword
 	- [BinaryCode](BinaryCode.md)
-	- Entropy
+	- Entropy (define with probabilities (H(X) instead of IC(X)))
 	- [InformationContent](InformationContent.md)
+	- RootedTree
 
 #### Other Stuff To Look At
 
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -190,8 +190,8 @@ Unit 10.1 (Graphs)
 	- SimpleGraph
 	- [Multigraph](Multigraph.md)
 	- [Loop](Loop.md)
-	- PseudoGraphs (multi edges + multi loop + undirect)
-	- MixedGraph (undirected + directed)
+	- [PseudoGraphs](PseudoGraphs.md) (multi edges + multi loop + undirect)
+	- [MixedGraph](MixedGraph.md) (undirected + directed)
 
 Unit 10.2 (Graph Terms)
 	- Coplanar
@@ -205,3 +205,7 @@ Unit 10.2 (Graph Terms)
 	- UnderlyingUndirectedGraph (directed -> undirected)
 	- CompleteGraph (fully connected)
 	- Wheel (add vertex connected to all elements of a cycle)
+	- [Bipartite](Bipartite.md)
+	- Matching
+	- MaximumMatching
+	- CompleteMatching
diff --git a/InformationContent.md b/InformationContent.md
@@ -5,4 +5,4 @@ Ch 6
 
 ## Notes
 
-**Definition:** Information content is the amount of data (eg. bits) needed to represent an arbitrary element of a finite set, S.
+**Definition:** The information content of a finite set of messages S is log_b(n) where n is the cardinality of S and b is the counting system (2 for binary).
diff --git a/MixedGraph.md b/MixedGraph.md
@@ -0,0 +1,8 @@
+:discrete:
+# Mixed Graph
+
+10.1
+
+## Notes
+
+**Definition:** A mixed graph is a graph that allows directed and undirected edges, loops, and multi-edges.
diff --git a/PseudoGraphs.md b/PseudoGraphs.md
@@ -0,0 +1,8 @@
+:discrete:
+# Pseudo Graph
+
+Ch 10.1
+
+## Notes
+
+**Definition:** A pseudo graph is a graph that allows multi edges and loops, but is directed.