Update for 06-11-21 15:15

This commit is contained in:
Tyler Perkins 2021-11-06 15:15:01 -04:00
parent 8e284fc893
commit 20c7e2b981
7 changed files with 16 additions and 3 deletions

View File

@ -17,6 +17,13 @@ Dijkstra's Algorithm is a [[greedy_algorithm]].
the distance from the start node to this node. the distance from the start node to this node.
- For example, if the current node is marked as a distance of 6 from the - For example, if the current node is marked as a distance of 6 from the
starting node, and the edge of neighbor _N1_ has a distance of 2, then starting node, and the edge of neighbor _N1_ has a distance of 2, then
N1's distance is 6+2 = 8 N1's distance is 6+2 = 8. If the node was previously marked as having a
different value, keep the smallest of the two values.
4) Once we have checked all of a nodes neighbors, remove it from the unvisited
set. A visited node is never checked again.
5) If searching for a specific node, the algorithm can stop when the desired
node is no longer in the 'unvisted' set.
6) If not, select the unvisted node with the smalled distance, and set it as
the current node, and go back to step 3

View File

@ -21,6 +21,8 @@ Different ways to store and operate on data, with differing efficiency
* [[splay_tree|Splay Tree]] * [[splay_tree|Splay Tree]]
* [[avl_tree|AVL Tree]] * [[avl_tree|AVL Tree]]
* [[kd_tree|KD Tree]] * [[kd_tree|KD Tree]]
* [[Heap]]
- [[Fibonacci_heap]]
== Common Algorithms == == Common Algorithms ==

4
tech/b_tree.wiki Normal file
View File

@ -0,0 +1,4 @@
= B-tree =
A B-tree is a self balancing tree that maintains sorted data and allows
search, insertion, and deletion in log time

View File

@ -14,3 +14,4 @@ applications including [[../math/markov_chain|Markov Chians]].
* [[BFS]] * [[BFS]]
* [[DFS]] * [[DFS]]
* [[Dijkstra]]

View File

@ -23,6 +23,7 @@ worrying about like 4 bytes per node and either have tons of nodes or memory is
precious and the time spent XORing is a valid tradeoff. precious and the time spent XORing is a valid tradeoff.
== Visual == == Visual ==
{{{ {{{
Head Tail Head Tail
---------------- --------- --------- --------- ---------------- ---------------- --------- --------- --------- ----------------

View File

@ -7,7 +7,6 @@ from the back
* Keeping an order of elements * Keeping an order of elements
== Bad For == == Bad For ==
* Everything else * Everything else

View File

@ -11,7 +11,6 @@ deletion (on average).
* Space constrained enviroments (nlogn space usage) * Space constrained enviroments (nlogn space usage)
== Notes == == Notes ==
Honestly things like a B-Tree are better alternatives, but sometimes you need a Honestly things like a B-Tree are better alternatives, but sometimes you need a