Skip to content

marianalcar/ASA_KruskalAlgorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

ASA_KruskalAlgorithm

Dado um grafo G = (V,E) pretende-se calcular o valor máximo de trocas comerciais, minimizando os custos infraestrutura (i.e. número de troços).

EN
Given a graph G = (V,E), the goal is to calculate the maximum value of trade swaps while minimizing infrastructure costs (i.e. number of segments).

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages