Commit d7388dd1 authored by Vincent-Xavier JUMEL's avatar Vincent-Xavier JUMEL 📚
Browse files

Ajout de liens dans ressources


Signed-off-by: Vincent-Xavier JUMEL's avatarVincent-Xavier JUMEL <vincent-xavier.jumel@ac-creteil.fr>
parent 7f608ca4
Pipeline #184800 passed with stages
in 1 minute and 51 seconds
......@@ -9,13 +9,21 @@
#### Des solutions algorithmiques :
- [stackoverflow.com](https://stackoverflow.com/questions/10185773/graph-theory-splitting-a-graph)
- [cstheory.stackexchange.com](https://cstheory.stackexchange.com/questions/16387/k-clustering-of-a-graph-maximizing-intra-cluster-weights)
- [cstheory.stackexchange.com](https://cstheory.stackexchange.com/questions/16387/k-clustering-of-a-graph-maximizing-intra-cluster-weights)
- [Découpage de graphe](https://stackoverflow.com/questions/10185773/graph-theory-splitting-a-graph)
- [bis sous un angle plus théorique](https://cstheory.stackexchange.com/questions/16387/k-clustering-of-a-graph-maximizing-intra-cluster-weights)
---
#### Solutions pratiques
- [stackoverflow.com](https://stackoverflow.com/questions/53379575/networkx-splitting-a-graph-into-n-subgraphs-based-on-edge-weight)
- [framagit.org](https://framagit.org/ketluts/gestiondeclasses/blob/master/app%2Fstudent%2Fviews%2Fsociogramme.php)
- [stackoverflow.com : sur l'utilisation de networkx](https://stackoverflow.com/questions/53379575/networkx-splitting-a-graph-into-n-subgraphs-based-on-edge-weight)
- [GestiondeClasse utilise aussi un sociogramme](https://framagit.org/ketluts/gestiondeclasses/blob/master/app%2Fstudent%2Fviews%2Fsociogramme.php)
---
#### Autres documents
- [Installation et configuration de PyCharm](https://nuage.jumel.net/index.php/s/NKwFGaYcBHeGbnN)
- [Bonnes pratiques de
tests](http://pytest.org/en/latest/goodpractices.html#test-discovery)
- [Coverage](https://pytest-cov.readthedocs.io/en/latest/readme.html#usage)
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment