public Huff(Huff leftChild, Huff rightChild)
{
LeftChild = leftChild;
RightChild = rightChild;
Data = leftChild.Data + ":" + rightChild.Data;
Frequency = leftChild.Frequency + rightChild.Frequency;
}
public Huff(Huff leftChild, Huff rightChild)
{
this.leftChild = leftChild;
this.rightChild = rightChild;
this.data = leftChild.data + ":" + rightChild.data;
this.frequency = leftChild.frequency + rightChild.frequency;
}
public static void GenerateCode(Huff parentNode, string code, Man man)
{
if (parentNode != null)
{
GenerateCode(parentNode.LeftChild, code + "0", man);
if (parentNode.LeftChild == null && parentNode.RightChild == null)
{
Console.WriteLine(parentNode.Data + "\t" + code);
man.Codec.Add(code);
man.Data.Add(parentNode.Data);
}
GenerateCode(parentNode.RightChild, code + "1", man);
}
}
public static Stack <Huff> GetSortedStack(IList <Huff> list)
{
for (int i = 0; i < list.Count; i++)
{
for (int j = 0; j < list.Count; j++)
{
if (list[i].frequency > list[j].frequency)
{
Huff tempNode = list[j];
list[j] = list[i];
list[i] = tempNode;
}
}
}
Stack <Huff> stack = new Stack <Huff>();
for (int j = 0; j < list.Count; j++)
{
stack.Push(list[j]);
}
return(stack);
}
static void Main()
{
IList <Huff> list = new List <Huff>();
Console.Write("Enter String: ");
var str = Console.ReadLine().ToLower().Replace(" ", "#");
Console.WriteLine("Space will be represented by #");
int n = str.Length, count = 1, pos = 0;
var flag = false;
var d = new int[n];
var d1 = new int[n];
var c1 = new char[n];
var c = str.ToCharArray();
for (var i = 0; i < n; i++)
{
for (var j = i + 1; j < n; j++)
{
if (c[i] == c[j])
{
count++;
}
}
d[i] = count;
count = 1;
}
for (var i = 0; i < n; i++)
{
for (var j = 0; j < n; j++)
{
if (c[i] == c1[j])
{
flag = true;
}
}
if (!flag)
{
c1[pos] = c[i];
d1[pos] = d[i];
pos++;
}
flag = false;
}
for (var i = 0; i < pos; i++)
{
Console.Write("{0}\t", c1[i]);
}
Console.WriteLine();
for (var i = 0; i < pos; i++)
{
Console.Write("{0}\t", d1[i]);
}
int temp;
char ch;
// sorts array d1 (frequencies) and array c1
for (var i = 0; i < pos; i++)
{
for (var j = i + 1; j < pos; j++)
{
if (d1[i] > d1[j])
{
temp = d1[i];
ch = c1[i];
d1[i] = d1[j];
c1[i] = c1[j];
d1[j] = temp;
c1[j] = ch;
}
}
}
Console.WriteLine("\n\nAfter Sorting: ");
for (var i = pos - 1; i >= 0; i--)
{
Console.Write("{0}\t", c1[i]);
}
Console.WriteLine();
for (var i = pos - 1; i >= 0; i--)
{
Console.Write("{0}\t", d1[i]);
}
// computes the information content in bits
double infoBit = 0;
for (var i = 0; i < pos; i++)
{
double prob, si;
prob = d1[i] / (double)n;
si = -(Math.Log(prob) / Math.Log(2));
infoBit += si * d1[i];
}
Console.WriteLine("\nTotal Information Count: {0}", infoBit + " Bits");
Console.WriteLine("Number of Bits required before Compression: {0}", n * 8);
var array = new int[pos];
// copies array d1 in 'array'
for (var i = 0; i < pos; i++)
{
array[i] = d1[i];
}
// fills the list 'list' with Huff-objects
for (var i = 0; i < pos; i++)
{
list.Add(new Huff(c1[i].ToString(), array[i]));
}
var stack = GetSortedStack(list);
while (stack.Count > 1)
{
var leftChild = stack.Pop();
var rightChild = stack.Pop();
var parentNode = new Huff(leftChild, rightChild);
stack.Push(parentNode);
stack = GetSortedStack(stack.ToList <Huff>());
}
// generated huffman tree
var parentNode1 = stack.Pop();
var man = new Man();
// generates and displays the huffman code
Console.WriteLine("\nHuffman Code:");
GenerateCode(parentNode1, "", man);
var cStr = " ";
foreach (var item in str)
{
var index = man.Data.IndexOf(item.ToString());
cStr += man.Codec.ElementAt(index);
}
var hfBits = 0;
foreach (var item in cStr.Replace(" ", ""))
{
hfBits++;
}
Console.WriteLine("Huffman Bits: " + hfBits);
Console.WriteLine("\nCoded String: ");
Console.WriteLine(cStr.Replace(" ", ""));
Console.ReadKey();
}
static void Main(string[] args)
{
IList <Huff> list = new List <Huff>();
Console.Write("Enter String: ");
string str = Console.ReadLine().ToLower().Replace(" ", "#");
Console.WriteLine("Space will be represented by #");
int n = str.Length, count = 1, flag = 0, pos = 0;
int[] d = new int[n];
int[] d1 = new int[n];
char[] c1 = new char[n];
var c = str.ToCharArray();
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (c[i] == c[j])
{
count++;
}
}
d[i] = count;
count = 1;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (c[i] == c1[j])
{
flag++;
}
}
if (flag == 0)
{
c1[pos] = c[i];
d1[pos] = d[i];
pos++;
}
flag = 0;
}
for (int i = 0; i < pos; i++)
{
Console.Write("{0}\t", c1[i]);
}
Console.WriteLine();
for (int i = 0; i < pos; i++)
{
Console.Write("{0}\t", d1[i]);
}
int temp;
char ch;
for (int i = 0; i < pos; i++)
{
for (int j = i + 1; j < pos; j++)
{
if (d1[i] > d1[j])
{
temp = d1[i];
ch = c1[i];
d1[i] = d1[j];
c1[i] = c1[j];
d1[j] = temp;
c1[j] = ch;
}
}
}
Console.WriteLine("\n\nAfter Sorting: ");
for (int i = pos - 1; i >= 0; i--)
{
Console.Write("{0}\t", c1[i]);
}
Console.WriteLine();
for (int i = pos - 1; i >= 0; i--)
{
Console.Write("{0}\t", d1[i]);
}
double infoBit = 0;
for (int i = 0; i < pos; i++)
{
double prob, si;
prob = d1[i] / (double)n;
si = -(Math.Log(prob) / Math.Log(2));
infoBit += (si * d1[i]);
}
Console.WriteLine("\nTotal Information Count: {0}", infoBit + " Bits");
Console.WriteLine("Number of Bits required before Compression: {0}", (n * 8));
int[] array = new int[pos];
for (int i = 0; i < pos; i++)
{
array[i] = d1[i];
}
for (int i = 0; i < pos; i++)
{
list.Add(new Huff(c1[i].ToString(), array[i]));
}
Stack <Huff> stack = GetSortedStack(list);
while (stack.Count > 1)
{
Huff leftChild = stack.Pop();
Huff rightChild = stack.Pop();
Huff parentNode = new Huff(leftChild, rightChild);
stack.Push(parentNode);
stack = GetSortedStack(stack.ToList <Huff>());
}
Huff parentNode1 = stack.Pop();
Man man = new Man();
Console.WriteLine("\nHuffman Code:");
GenerateCode(parentNode1, "", man);
string cStr = " ";
foreach (var item in str)
{
var index = man.data.IndexOf(item.ToString());
cStr += man.codec.ElementAt(index);
}
int hfBits = 0;
foreach (var item in cStr.Replace(" ", ""))
{
hfBits++;
}
Console.WriteLine("Huffman Bits: " + hfBits);
Console.WriteLine("\nCoded String: ");
Console.WriteLine(cStr.Replace(" ", ""));
Console.ReadKey();
}
