<commit_before>FibonacciHeap
=============
<b>Version 0.01</b> <br>

1. A library which offers Fibonacci Heap data structure and corresponding operations.<br>
2. The interfaces of this library are much like the interfaces of piority queue in STL.<br>
3. Comparison depending on the operator < .<br>
4. Example of how to use:
```cpp
#include "fibonacciheap.h"
#include <iostream>

using namespace std;

#define N 10

int main() {

	FibonacciHeap<int> fh;	
	FibNode<int> * arr[N];	
	for (int i=0; i<N; i++) arr[i] = fh.push(10+i);

	cout << fh.top() << endl;
	fh.pop();
	cout << fh.top() << endl;
	fh.decreaseKey(arr[3], 2);
	cout << fh.top() << endl;
	fh.pop();
	cout << fh.top() << endl;

	return 0;
}

```

The output is like:
```cpp
10
11
2
11
```
<commit_msg>fix README<commit_after>FibonacciHeap
=============
<b>Version 0.01</b> <br>

1. A library which offers Fibonacci Heap data structure and corresponding operations.<br>
2. The interfaces of this library are much like the interfaces of piority queue in STL.<br>
3. Comparison depending on the operator < .<br>
4. Example of how to use:

````cpp
#include "fibonacciheap.h"
#include <iostream>

using namespace std;

#define N 10

int main() {

	FibonacciHeap<int> fh;	
	FibNode<int> * arr[N];	
	for (int i=0; i<N; i++) arr[i] = fh.push(10+i);

	cout << fh.top() << endl;
	fh.pop();
	cout << fh.top() << endl;
	fh.decreaseKey(arr[3], 2);
	cout << fh.top() << endl;
	fh.pop();
	cout << fh.top() << endl;

	return 0;
}

````

The output is like:
```cpp
10
11
2
11
```

{'fraction_non_alphanumeric': 0.18241469816272965, 'fraction_numerical': 0.028871391076115485, 'mean_word_length': 3.96742671009772, 'pattern_counts': {'":': 0, '<': 57, '<?xml version=': 0, '>': 21, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '844134', 'n_tokens_mistral': 652, 'n_tokens_neox': 601, 'n_words': 193}