Full support to Huffman coding and RSA.<p>Last year I learnt Ford Fukkerson [0] and Dijkstra [1] Algorithm. Algorithns for graphs are really interesting and have a lot of applications. Fun fact, I learnt these in a transport engineering course, not in a computer science one, and I still use them sometimes in computer science courses.<p>[0] <a href="https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Ford%E2%80%93Fulkerson_algorithm" rel="nofollow">https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Ford%E2%80%93Fulkerson_algor...</a>
[1] <a href="https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Dijkstra%27s_algorithm" rel="nofollow">https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Dijkstra%27s_algorithm</a>