margui/UE6-Mobilities_And_Smart_Cities
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Final Commit

Browse Source
This commit is contained in:
Guillaume M
2023-10-13 18:21:28 +02:00
parent 2b48bba949
commit e5d460faa2
3 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
Report.md
View File

@@ -6,6 +6,8 @@ Guillaume MARTIN - Master Internet Of Things - 2023/2024
This report presents all the contributions to the TD exercises and explain the design, tests and evaluation of the solutions. This report presents all the contributions to the TD exercises and explain the design, tests and evaluation of the solutions.
All the code is available on the following git repository: [https://https://git.margui.fr/margui/UE6-Mobilities_And_Smart_Cities](https://git.margui.fr/margui/UE6-Mobilities_And_Smart_Cities).
During the course, we shared code and ideas between students, but the final solutions are personal. I mostly have exchanged with the following students on the Make Change exercise: During the course, we shared code and ideas between students, but the final solutions are personal. I mostly have exchanged with the following students on the Make Change exercise:
- Killian Maxel - Killian Maxel
@@ -342,7 +344,6 @@ The `remove_transitive_closure` function removes transitive relationships from a
5. Return Modified Matrix: 5. Return Modified Matrix:
- Once no more modifications are possible, indicating that all transitive relationships have been removed, the function returns the modified `matrix` with only direct relationships remaining. - Once no more modifications are possible, indicating that all transitive relationships have been removed, the function returns the modified `matrix` with only direct relationships remaining.
### TD4 - Slide 22 - Computing Node Ordering Based on Distance from a Specific Node ### TD4 - Slide 22 - Computing Node Ordering Based on Distance from a Specific Node
In this exercise, we are ask to compute the list of nodes ordered in the ascending order of distances to a particular node. In this exercise, we are ask to compute the list of nodes ordered in the ascending order of distances to a particular node.

BIN
Report.pdf
View File

Binary file not shown.

2
TD2-8_Make_ChangePrograms/sol_2.txt
View File

File diff suppressed because one or more lines are too long