MST

Project 2, UnB, Data Structure

This project is based in finding the minimum spanning tree of a graph, using prim's algorithm, not full otimized

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
.gitignore		.gitignore
A75BCC3.tmp		A75BCC3.tmp
Makefile		Makefile
README.md		README.md
grafo.txt		grafo.txt
grafo10.txt		grafo10.txt
grafo11.txt		grafo11.txt
grafo12.txt		grafo12.txt
grafo2.txt		grafo2.txt
grafo3.txt		grafo3.txt
grafo4.txt		grafo4.txt
grafo5.txt		grafo5.txt
grafo6.txt		grafo6.txt
grafo7.txt		grafo7.txt
grafo8.txt		grafo8.txt
grafo9.txt		grafo9.txt
graph.c		graph.c
graph.h		graph.h
ideia1.txt		ideia1.txt
io.c		io.c
io.h		io.h
list.c		list.c
list.h		list.h
mst.c		mst.c
mst.exe		mst.exe
report.docx		report.docx
report.pdf		report.pdf
report.tex		report.tex
saida.txt		saida.txt
saida1.txt		saida1.txt
saida10.txt		saida10.txt
saida11.txt		saida11.txt
saida12.txt		saida12.txt
saida2.txt		saida2.txt
saida3.txt		saida3.txt
saida4.txt		saida4.txt
saida5.txt		saida5.txt
saida6.txt		saida6.txt
saida7.txt		saida7.txt
saida8.txt		saida8.txt
saida9.txt		saida9.txt
saidas.txt		saidas.txt

Provide feedback