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
-
-
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
When a process spawns a separate process to handle some work, it invokes the
fork(2)system call.fork(2)duplicates the current process in … -
Orphan Processes
When a parent process finishes executing before its children, the child processes are said to become orphan processes.
When this happens, the init process - the …
-
Zombie Processes
Zombie processes are "dead" processes. That is, processes that have finished executing and are waiting for the parent to reap them (collect information about their …