<commit_before>skimage-graph
=============

A graph data structure for skimage. Intended for GSoC 2014

### Implemenetaion

* Each node holds a dictionary which maps adjacent nodes to their corresponding weihgts. Let's call this **Adjacency Dictionary**
* This approach is atleast `30x` faster than the last one
* Merging nodes is faster because lookup takes constant time.

### Further Imporovements
* Number of nodes in the graph need not remain constant. Therefore `Graph.rows` need not be a static never changing list. It can be a dictionary mapping vertex number to Adjacency Dictionary
* Node properties can be stored using a dictionary<commit_msg>readme change<commit_after>skimage-graph
=============

A graph data structure for skimage. Intended for GSoC 2014

### Implemenetaion

* Each node holds a dictionary which maps adjacent nodes to their corresponding weihgts. Let's call this **Adjacency Dictionary**
* This approach is atleast `30x` faster than the last one
* Merging nodes is faster because lookup takes constant time.

### Further Imporovements
* Number of nodes in the graph need not remain constant. Therefore `Graph.rows` need not be a static never changing list. It can be a dictionary mapping vertex number to Adjacency Dictionary. Rather than keeping empty nodes, this will allow quick deletion of them.
* Node properties can be stored using a dictionary
{'fraction_non_alphanumeric': 0.06439942112879884, 'fraction_numerical': 0.008683068017366137, 'mean_word_length': 4.961206896551724, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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': '3034358', 'n_tokens_mistral': 353, 'n_tokens_neox': 333, 'n_words': 192}