Graph Theory: Maximum Matching

This repository have study purpose only.

We intent to implement two Maximum Matching algorithms. Firstly, Khun algorithm for poundered graphs and then Micali and Vazirani's approach for general graphs.

Command Line Argument

The program takes one command line argument, which is optional and represents the name of the file where the Graph definitions is.

Name		Name	Last commit message	Last commit date
Latest commit History 67 Commits
.gitignore		.gitignore
README.md		README.md
bgrafo_1.txt		bgrafo_1.txt
bgrafo_2.txt		bgrafo_2.txt
bgrafo_3.txt		bgrafo_3.txt
grafo_1.txt		grafo_1.txt
grafo_2.txt		grafo_2.txt
grafo_3.txt		grafo_3.txt
grafo_4.txt		grafo_4.txt
grafo_5.txt		grafo_5.txt
grafo_6.txt		grafo_6.txt
grafo_7.txt		grafo_7.txt
grafo_8.txt		grafo_8.txt
grafo_9.txt		grafo_9.txt
graph.c		graph.c
graph.h		graph.h
hungarian.c		hungarian.c
hungarian.h		hungarian.h
main.c		main.c
maximum-matching.c		maximum-matching.c
maximum-matching.h		maximum-matching.h
quicksort.c		quicksort.c
quicksort.h		quicksort.h
relatorio.docx		relatorio.docx
relatorio.pdf		relatorio.pdf
set.c		set.c
set.h		set.h
stack.c		stack.c
stack.h		stack.h

vitorfs/maximum-matching

Folders and files

Latest commit

History

Repository files navigation

Graph Theory: Maximum Matching

Command Line Argument

About

Resources

Stars

Watchers

Forks

Languages