Again, there’s something that seems be rare on the net, and that’s the problem of finding the ordered list of vertices of a negative-cycle in a directed or undirected graph[1]. Well, the Bellman-Ford algorithm already finds out that there’s a negative cycle, but how can we make it to also list the vertices of that [...]

Certainly you have used some compressing tools before, such as WinRAR, WinZip or even the Windows compressor. There are many free algorithms that can do such compression. Also there are many other algorithms that perform more compression faster but they’re not free! Huffman is an entropy encoding algorithm used for lossless data compression. The term [...]

CRC calculation is a popular way for detecting accidental errors occurred to a message. These errors usually may occur during data transmissions over a network or while writing to a storage device or anywhere that datum is moved. I recently have coded a few lines in order to create a tiny program for CRC calculation. [...]

INFiX to POSTFiX Conversion Tool v0.1 This is a handy tool written in assembly. This tiny program inputs an infix expression and outputs its postfix version. I have already mentioned this program in my previous posts but now I put both its binary and source code for free under the GNU GP License. This is [...]

Dijkstra’s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest path tree. This algorithm is often used in routing. For a given source vertex (node) in the graph, the algorithm [...]