spectre/cours
1
0
Fork 0
mirror of https://github.com/Fare-spec/cours.git synced 2025-12-07 02:40:38 +00:00
Code Issues Packages Projects Releases Wiki Activity

Auto urgent commit.

Browse Source
This commit is contained in:
Spectre
2025-03-12 09:49:35 +01:00
parent a80789ea77
commit c1f9443972
3 changed files with 552 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

409
trees/genealogie/TP_Arbres_Generalites.pdf?forcedownload=1 Normal file
View File

File diff suppressed because one or more lines are too long

18
trees/genealogie/genealogie.csv Normal file
View File

@@ -0,0 +1,18 @@
'Henri IV' ; 1553 ; 1610 ; '1589-1610' ; 1
'Louis XIII' ; 1601 ; 1643 ; '1610-1643' ; 2, 3
'Louis XIV' ; 1638 ; 1715 ; '1643-1715' ; 4
'Philippe Ier, duc d'Orleans' ; 1640 ; 1701 ; '' ; 15
'Louis le Grand Dauphin' ; 1661 ; 1711 ; '' ; 5, 6
'Louis, duc de Bourgogne' ; 1682 ; 1712 ; '' ; 7
'Philippe V, roi d'Espagne' ; 1683 ; 1746 ; '' ;
'Louis XV' ; 1710 ; 1774 ; '1715-1774' ; 8
'Louis, Dauphin' ; 1729 ; 1765 ; '' ; 9, 10, 11
'Louis XVI' ; 1754 ; 1793 ; '1754-1793' ; 13
'Louis XVIII' ; 1755 ; 1824 ; '1815-1824' ;
'Charles X' ; 1756 ; 1832 ; '1824-1830' ;
'Louis-Philippe-Joseph "Philippe Egalite"' ; 1747 ; 1793 ; '' ; 14
'Louis XVII' ; 1785 ; 1795 ; '' ;
'Louis-Philippe Ier, roi des Français' ; 1773 ; 1850 ; '' ;
'Philippe II' ; 1674 ; 1723 ; '' ; 16
'Louis, duc d'Orleans' ; 1703 ; 1752 ; '' ; 17
'Louis-Philippe Ier, duc d'Orleans' ; 1725 ; 1785 ; '' ; 12
Can't render this file because it contains an unexpected character in line 13 and column 25.

125
trees/genealogie/genealogie.py Normal file
View File

@@ -0,0 +1,125 @@
Genealogie = [
["Henri IV", 1553, 1610, "1589-1610", [1]],
["Louis XIII", 1601, 1643, "1610-1643", [2, 3]],
["Louis XIV", 1638, 1715, "1643-1715", [4]],
["Philippe Ier, duc d'Orleans", 1640, 1701, "", [15]],
["Louis le Grand Dauphin", 1661, 1711, "", [5, 6]],
["Louis, duc de Bourgogne", 1682, 1712, "", [7]],
["Philippe V, roi d'Espagne", 1683, 1746, "", []],
["Louis XV", 1710, 1774, "1715-1774", [8]],
["Louis, Dauphin", 1729, 1765, "", [9, 10, 11]],
["Louis XVI", 1754, 1793, "1754-1793", [13]],
["Louis XVIII", 1755, 1824, "1815-1824", []],
["Charles X", 1756, 1832, "1824-1830", []],
['Louis-Philippe-Joseph "Philippe Egalite"', 1747, 1793, "", [14]],
["Louis XVII", 1785, 1795, "", []],
["Louis-Philippe Ier, roi des Français", 1773, 1850, "", []],
["Philippe II", 1674, 1723, "", [16]],
["Louis, duc d'Orleans", 1703, 1752, "", [17]],
["Louis-Philippe Ier, duc d'Orleans", 1725, 1785, "", [12]],
]
def creer_arbre():
return ()
def est_vide(arbre):
return arbre == None
def rechercher(arbre, valeur):
if not (est_vide(arbre)):
racine, enfants = arbre
if racine == valeur:
return arbre
resultat = creer_arbre()
for ss_arbre in enfants:
resultat = rechercher(ss_arbre, valeur)
if not (est_vide(resultat)):
break
return resultat
return arbre
def ajouter_enfant(arbre, enfant, cle_parent):
if est_vide(arbre):
return enfant
return arbre.insert(cle_parent + 1, enfant)
Bourbons = [
["Nom", "naissance", "mort", "règne"],
["Henri IV", 1553, 1610, "1589-1610"],
["Louis XIII", 1601, 1643, "1610-1643"],
["Louis XIV", 1638, 1715, "1643-1715"],
["Philippe, duc d'Orleans", 1640, 1701, ""],
["Louis le Grand Dauphin", 1661, 1711, ""],
["Louis, duc de Bourgogne", 1682, 1712, ""],
["Philippe V, roi d'Espagne", 1683, 1746],
["Louis XV", 1710, 1774, "1715-1774"],
["Louis, Dauphin", 1729, 1765, ""],
["Louis XVI", 1754, 1793, "1765-1792"],
["Louis XVIII", 1755, 1824, "1814-1824"],
["Charles X", 1756, 1832, "1824-1830"],
['Louis-Philippe-Joseph "Philippe Egalite"', 1747, 1793, ""],
["Louis XVII", 1785, 1795, ""],
["Louis Philippe Ier", 1773, 1850, "1830-1848"],
]
Genealogie = (
1,
[
(
2,
[
(
3,
[
(
5,
[
(6, [(8, [(9, [(10, [14]), (11, []), (12, [])])])]),
(7, []),
],
)
],
),
(4, []),
],
)
],
)
print("ENUMERATION :")
for rg, bourbon in enumerate(Bourbons):
print(rg, bourbon[0])
print()
print("RECHERCHE :")
print(rechercher(Genealogie, 8))
class Arbre(object):
def __init__(self, racine=None, ss_arbres=[]) -> None:
self.racine = racine
self.ss_arbres = ss_arbres
def est_vide(self):
return self.racine == None
def rechercher(self, valeur):
if not (self.est_vide()):
if self.racine == valeur:
return self
resultat = Arbre()
for ss_arbre in self.ss_arbres:
ss_arbre = Arbre(racine=None, ss_arbres=ss_arbre)
resultat = ss_arbre.rechercher(valeur)
if not (resultat == None):
break
return resultat
def ajouter(self,elt):
if self.est_vide():
return Arbre(racine=elt)
else: