Expand on readme

[amicciche]

Something like this

Graph Theory User

Sentence explaining what this is.
List of functions that I'm promising to them

• bury heuristic
• bury heuristic seeded
• calculating balanced k min max matching partition
• visualization of min max matching partition
• (TODO)formally check no quantum anything is needed

Circuit compilation user

• Perspective of how to think about this
• Refer to graphix, and more importantly our paper

[Krastanov]

also, in the Graph user section, mention the other methods that are implemented