Libraries:

Programs:

Eulerweg.c: check if input graph is connected/Eulerian, find Euler-cycle if both.
mst.c: Find MST in connected undirected graph
heap_test.c: interactive fibonacci heap
heapsort.c: test program to sort numbers
bfs.c: find shortest path in indirected graph with BFS
menger.c: find edge-disjoint s-t-paths
max-flow.c: find maximal s-t-flow in directed graph
assignment.c: Solve the assignment problem in a complete bipartite graph

Name		Name	Last commit message	Last commit date
Latest commit History 85 Commits
graphs		graphs
turing_machines		turing_machines
.gitattributes		.gitattributes
.gitignore		.gitignore
Eulerweg.c		Eulerweg.c
Makefile		Makefile
README.md		README.md
assignment.c		assignment.c
bfs.c		bfs.c
check-flow.c		check-flow.c
config.h		config.h
digraph.c		digraph.c
digraph.h		digraph.h
euler.c		euler.c
euler.h		euler.h
fib_heap.c		fib_heap.c
fib_heap.h		fib_heap.h
graph.c		graph.c
graph.h		graph.h
graph_alg.c		graph_alg.c
graph_alg.h		graph_alg.h
heap_test.c		heap_test.c
heapsort.c		heapsort.c
int_list.c		int_list.c
int_list.h		int_list.h
max-flow.c		max-flow.c
menger.c		menger.c
mst.c		mst.c
path.c		path.c
path.h		path.h
push-relabel.c		push-relabel.c
push-relabel.h		push-relabel.h
turing.c		turing.c
turing.h		turing.h