Implementation of common graph algorithms: BFS, DFS, checking if a graph is bipartite, finding strongly connected components of a graph, topologically sorting a graph.

Modeling optimisation problems in Julia language for a solver.

Implementing and testing three versions of shortest path algorithms: Dijkstra, Dial and Radix. This exercise originated as a DIMACS programming challange.

Finding a maximum flow in a n-dimensional hypercube graph. Finding maximum matching in a bipartite graph.