Dijkstra's Shortest Path Algorithm
An elegant algorithm for finding the shortest path between nodes in a graph.
This is the rendered collections of notes by me, Lex Toumbourou.
You can find the source on the GitHub project.
The notes are collecting using my interpretation of the Zettelkasten method.
More
You can find the source on the GitHub project.
The notes are collecting using my interpretation of the Zettelkasten method.
More
-
-
Computational Investing Part I (Coursera)
Coursera Verified Certificates, License GKNAYZY4TH, October 2013
Full course write up available here
Notes
-
-
Packet capturing in parallel with Ansible
An Ansible playbook for running tcpdump in parallel across many servers and collecting the captures.
-
Red Hat System Administration III with RHCSA and RHCE Exams (RH255)
These notes were taken from the in-person course completed in 2013 and were used to get the following certs:
- RHCSA - obtained 2013-08-09 (130-134-935)
- RHCE - obtained …
-
fork System Call
A system call that duplicates the current process, creating a parent and child that continue from the same point.
-
-
-