Skip to content
Kristian Eschenburg edited this page Feb 1, 2018 · 2 revisions

Welcome to the Graphs wiki!

This package is for me to 1) learn advanced data structures and algorithms on graphs, since I regularly use more sophisticated packages when I need access to these algorithms, and 2) formalize my understanding of unit-testing in a more advanced framework.

I'm going to be incorporating everything from basic traversal (BFS, DFS) to more advanced algorithms like the Blossom algorithm, and I'll also be implementing algorithms that I regularly use in my research, like Kruskal's algorithm for finding Minimum Spanning Trees, and other methods that I hope to use in my research, like the Louvain Method for community detection.

Clone this wiki locally