1.1.0: graphs & priority queues and refactors

Documentation: https://lerax.me/data-structures/

What's Changed

• fix: ensure all nodes are visited in bfs/dfs with directed graphs by @ryukinix in #51
• feat: add method to check if graph is acyclical by @ryukinix in #52
• feat: add tarjan edge classification by @ryukinix in #53
• fix: always use -fPIC to avoid need of recompilation by @ryukinix in #54
• feat: add topological sort algorithm by @ryukinix in #55
• fix: ufc notes broken links by @ryukinix in #56
• feat: priority queue of max/min generalized by @ryukinix in #57
• feat: priority queue with key and value by @ryukinix in #58
• feat: add dijkstra by @ryukinix in #59
• feat(ci): add lint target with cppcheck by @ryukinix in #60
• feat: make compatible with g++ and clang++ by @ryukinix in #61
• feat(graph): add kruskal and strong components detection by @ryukinix in #62
• feat: add graph_prim by @ryukinix in #63

Full Changelog: 1.0.0...1.1.0