More path/walk/trail notes.

notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json

@@ -186,7 +186,8 @@
     "graph-isomorphic.png",
     "graph-induced-subgraph.png",
     "graph-subgraph.png",
-    "graph-non-subgraph.png"
+    "graph-non-subgraph.png",
+    "cyclic-undirected-labelled.png"
   ],
   "File Hashes": {
     "algorithms/index.md": "3ac071354e55242919cc574eb43de6f8",
@@ -367,7 +368,7 @@
     "_journal/2024-03/2024-03-17.md": "23f9672f5c93a6de52099b1b86834e8b",
     "set/directed-graph.md": "b4b8ad1be634a0a808af125fe8577a53",
     "set/index.md": "c103501e345a1b8201a26f2e83ed8379",
-    "set/graphs.md": "ce7030d3bae17b56319e8b5526a63c95",
+    "set/graphs.md": "6f08a3e8e4896b0325aef6c452bfbb56",
     "_journal/2024-03-19.md": "a0807691819725bf44c0262405e97cbb",
     "_journal/2024-03/2024-03-18.md": "63c3c843fc6cfc2cd289ac8b7b108391",
     "awk/variables.md": "e40a20545358228319f789243d8b9f77",
@@ -739,7 +740,7 @@
     "_journal/2024-08-17.md": "b06a551560c377f61a1b39286cd43cee",
     "_journal/2024-08/2024-08-16.md": "096d9147a9e3e7a947558f8dec763a2c",
     "set/order.md": "373f4336d4845a3c2188d2215ac5fbc4",
-    "_journal/2024-08-18.md": "240ce6377b91d977f4fedc30724891f6",
+    "_journal/2024-08-18.md": "6f8aec69e00401b611db2a377a3aace5",
     "ontology/philosophy/properties.md": "41b32249d3e4c23d73ddb3a417d65a4c"
   },
   "fields_dict": {

notes/_journal/2024-08-19.md

@@ -0,0 +1,9 @@
+---
+title: "2024-08-19"
+---
+
+- [ ] Anki Flashcards
+- [x] KoL
+- [ ] OGS
+- [ ] Sheet Music (10 min.)
+- [ ] Korean (Read 1 Story)

notes/set/graphs.md

@@ -1201,6 +1201,42 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
 <!--ID: 1710807788538-->
 END%%
 
+%%ANKI
+Basic
+With maximum specificity, is $\langle B, D, E, J, K, B, A \rangle$ a path, trail, or walk?
+![[cyclic-undirected-labelled.png]]
+Back: A trail.
+Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
+<!--ID: 1723995290880-->
+END%%
+
+%%ANKI
+Basic
+With maximum specificity, is $\langle B, D, E, J, K, B \rangle$ a path, trail, or walk?
+![[cyclic-undirected-labelled.png]]
+Back: A path.
+Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
+<!--ID: 1723995290889-->
+END%%
+
+%%ANKI
+Basic
+With maximum specificity, is $\langle B, D, B, K, L \rangle$ a path, trail, or walk?
+![[cyclic-undirected-labelled.png]]
+Back: A walk.
+Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
+<!--ID: 1723995290893-->
+END%%
+
+%%ANKI
+Basic
+With maximum specificity, is $\langle A, B, D \rangle$ a path, trail, or walk?
+![[cyclic-undirected-labelled.png]]
+Back: A path.
+Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
+<!--ID: 1723995290896-->
+END%%
+
 ## Isomorphisms
 
 An **isomorphism** between two graphs $G_1$ and $G_2$ is a bijection $f \colon V_1 \rightarrow V_2$ between the vertices of the graphs such that $(a, b)$ is an edge in $G_1$ if and only if $(f(a), f(b))$ is an edge in $G_2$. Here parenthesis are used to denote either ordered pairs (for directed graphs) or unordered pairs (for undirected graphs).