graph-utils / News: Recent posts

Added:
* Eulerian chains/cycles
* Hamiltonian chains/cycles - Roberts/Flores method

Added:
* Centers and medians (for directed and undirected graphs)
* p-medians (for undirected graphs) /Branch and bound algorithm/

Added:
* Graph compliment calculation
* Approximative colouring

Added:
* Bron and Kerbosch method (maximum independent set problem) - bug fixes
* Cliques and clique number (density) calculation /maximum independent sets for graph compliment/
* Chromatic number and optimal colouring

Added:

* Numbers
- number of nodes
- number of edges
- number of connected components
- cyclomatic number
- in-degrees and out-degrees for nodes
* Bron and Kerbosch method (maximum independent set problem)

Ford-Fulkerson method / Edmonds-Karp algorithm added (maximum flow problem)

Prim algorithm added (minimum-spanning-tree problem) /using trivial array-based implementation of a priority queue/

Kruskal algorithm added (minimum-spanning-tree problem) /using disjoint-set data structure with path compression and union by rank heuristics/

Dijkstra algorithm added (single-source shortest-path problem) /using trivial array-based implementation of a priority queue/

Floyd-Warshall algorithm added (all pairs shortest-path problem)

Bellman-Ford algorithm added (single-source shortest-path problem).

Depth-first search (DFS) added.

Breadth-first search (BFS) added.

This release contains binary search tree algorithms only.