Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
E
EBEC 2021
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Léna Aix
EBEC 2021
Commits
0a248eb1
Commit
0a248eb1
authored
4 years ago
by
Alexandre Pradeilles
Browse files
Options
Downloads
Patches
Plain Diff
fct gestion street
parent
db2feaaf
Branches
Branches containing commit
No related tags found
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
main.py
+0
-6
0 additions, 6 deletions
main.py
research.py
+12
-0
12 additions, 0 deletions
research.py
with
12 additions
and
6 deletions
main.py
+
0
−
6
View file @
0a248eb1
...
...
@@ -60,15 +60,9 @@ def classement_arbres(liste_coord):
if
__name__
==
"
__main__
"
:
<<<<<<<
HEAD
t1
=
time
.
time
()
lat
,
lon
=
48.898867
,
2.237485
print
(
tree_position
(
lat
,
lon
))
=======
'''
t1 = time.time()
lat, lon = 48.892046, 2.249319
#print(tree_position(lat, lon))
>>>
>>>>
6899
c2939dfc49fc78620b32ffd1efe547f87229
t2
=
time
.
time
()
#print(t2-t1)
...
...
This diff is collapsed.
Click to expand it.
research.py
+
12
−
0
View file @
0a248eb1
...
...
@@ -20,6 +20,18 @@ def circular_research(lat, lon, main_street):
step
+=
4
*
10
**
(
-
5
)
return
None
def
circular_research_2
(
lat
,
lon
,
main_street
=
''
):
#Recherche un rue autre que main_street par recherche circulaire autour du point d'intersection
step
=
2
*
10
**
(
-
5
)
found
=
False
while
not
(
found
):
for
i
in
range
(
8
):
street
=
check_position
(
lat
,
lon
,
step
,
main_street
,
i
)
if
not
(
street
==
main_street
):
return
street
step
+=
2
*
10
**
(
-
5
)
return
street
def
check_position
(
lat
,
lon
,
step
,
main_street
,
i
):
#Calcul les positions autour du point centrale et récupère la rue associée à cette position
street
=
''
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment