Skip to content

No projeto final de EDA pretende-se analisar um grafo e determinar qual o número mínimo de arestas a remover, se quisermos separar o grafo em duas partes disconexas e de uma dimensão significativa.

Notifications You must be signed in to change notification settings

joelpaula/Projeto-Final-EDA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

35 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Projeto-Final-EDA

Unidade curricular | Course Unit Estrutura de Dados e Algoritmos | Data Structures and Algorithms

Professor Luis Ramada Pereira

Curso|Course LCD-PL -- Ano letivo|Year 2019/2020

Autores|Authors

| Catarina Castanheira | nº 92478 |
| João Martins         | nº 93259 |
| Joel Paula           | nº 93392 |

27-05-2020

To check the results, have a look at the Jupyter Notebook.

We made this work by Mob Programming around one of our computers for several hours a day, in a period of about 3 weeks. We used Visual Studio Code as our editor and also CoCalc on those brief periods when we needed to work solo on different stuff (refactoring code, polishing the structure, adding details to our text). At the same time, one of us was keeping a copy in GitHub, just as a safety measure.

We got a (very!) good grade with this work, but we might have done better:

  • We should have made a conclusion to end the work, but we were already tired when we reached that stage 😁;
  • Using Jupyter notebooks is not really appropriate for a work this size. We started using it for the first part (it still made sense) as it provides a user interface for trying out stuff. Also, we had some ideas of making it more interactive. In the end the Jupyter notebook format just gave us an headache (wouldn't export into PDF in any of our machines, and the CoCalc export was really bad) and we couldn't really accomplish our idealized interactive user interface. We should have reverted to using a Word document, like normal people;
  • The data sources we used for the second part are not that good, hence the poor map results, if you are familiar with the London underground. Sorry for that - we didn't have the time to fix it as they were being provided at mere hours from the delivery term.

About

No projeto final de EDA pretende-se analisar um grafo e determinar qual o número mínimo de arestas a remover, se quisermos separar o grafo em duas partes disconexas e de uma dimensão significativa.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published