This repository contains implementations of a few interesting and famous algorithms.
Prime's Algorithms for finding the Minimum Spanning Tree in an undirected, weighted graphs, edge weights are considered distinct and non-negative. The input format is as below :
First line : < number of nodes in the graphs = n > < number of edges in the graphs = m >
Next m lines : < source node for edge j, considering 1 based indices > < destination > < edge weight >
The programme is a brute force direct implementation O(n * n), for a faster one, min heaps should be used instead of vector (list).
This is the famous Huffman Encoding for losseless data compression. The programme generates binary codes which are prefix free (and therefore no clashing possible) and are such that it minimises the Average Encoding Length, defined as ( for a binary Tree T, where the probability of occurence of the ith data string in the given data is pi and depth of the data string in T is di)
The input format is as below :
First line : < Your string to be encoded, ended by a end of line >
The programme is a brute force direct implementation O(n * n), for a faster one, min heaps should be used instead of vector (list).