Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
D
Detection eddies
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
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
IPSL
LMD
DPAO
Detection eddies
Commits
34b7a4cd
Commit
34b7a4cd
authored
1 year ago
by
Lionel GUEZ
Browse files
Options
Downloads
Patches
Plain Diff
Define `traj_vert_ind`
Preparing to define `traj_segm` and `expanded_traj` out of the loop on vertices.
parent
d32a5a8e
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Trajectories/trajectories.py
+18
-9
18 additions, 9 deletions
Trajectories/trajectories.py
with
18 additions
and
9 deletions
Trajectories/trajectories.py
+
18
−
9
View file @
34b7a4cd
...
@@ -17,7 +17,8 @@ from graph_tool import topology
...
@@ -17,7 +17,8 @@ from graph_tool import topology
import
json
import
json
import
sys
import
sys
def
new_traj
(
ind_traj
,
traj_prop
,
n
,
g
,
traj_segm
,
expanded_traj
):
def
new_traj
(
ind_traj
,
traj_prop
,
n
,
g
,
traj_segm
,
expanded_traj
,
traj_vert_ind
):
"""
Assign new trajectory to vertex index n.
"""
"""
Assign new trajectory to vertex index n.
"""
ind_traj
+=
1
ind_traj
+=
1
...
@@ -25,6 +26,7 @@ def new_traj(ind_traj, traj_prop, n, g, traj_segm, expanded_traj):
...
@@ -25,6 +26,7 @@ def new_traj(ind_traj, traj_prop, n, g, traj_segm, expanded_traj):
traj_segm
.
append
([
g
.
vertex_properties
.
name
[
n
]])
traj_segm
.
append
([
g
.
vertex_properties
.
name
[
n
]])
inst_eddies
=
list
(
g
.
vertex_properties
.
inst_eddies
[
n
])
inst_eddies
=
list
(
g
.
vertex_properties
.
inst_eddies
[
n
])
expanded_traj
.
append
(
inst_eddies
)
expanded_traj
.
append
(
inst_eddies
)
traj_vert_ind
.
append
([
n
])
return
ind_traj
return
ind_traj
if
len
(
sys
.
argv
)
!=
2
:
sys
.
exit
(
"
Required argument: input-graph
"
)
if
len
(
sys
.
argv
)
!=
2
:
sys
.
exit
(
"
Required argument: input-graph
"
)
...
@@ -53,9 +55,14 @@ else:
...
@@ -53,9 +55,14 @@ else:
traj_prop
=
g
.
new_vertex_property
(
'
int
'
)
traj_prop
=
g
.
new_vertex_property
(
'
int
'
)
# Trajectory index to which a segment belongs. The trajectory index is
# Trajectory index to which a segment belongs. The trajectory index is
# also the index in lists traj_segm and expanded_traj.
# also the index in lists
traj_vert_ind,
traj_segm and expanded_traj.
ind_traj
=
-
1
# initialize index of trajectory
ind_traj
=
-
1
# initialize index of trajectory
traj_vert_ind
=
[]
# An element of traj_vert_ind is a trajectory, represented by a list
# of vertex indices.
traj_segm
=
[]
# an element of traj_segm is a trajectory, represented
traj_segm
=
[]
# an element of traj_segm is a trajectory, represented
# by a list of segments
# by a list of segments
expanded_traj
=
[]
# an element of expanded_traj is a trajectory,
expanded_traj
=
[]
# an element of expanded_traj is a trajectory,
...
@@ -74,23 +81,25 @@ for n in topology.topological_sort(g):
...
@@ -74,23 +81,25 @@ for n in topology.topological_sort(g):
if
closest_succ
[
closest_pred
]
==
n
:
if
closest_succ
[
closest_pred
]
==
n
:
# Assign to n the trajectory of closest_pred. This means
# Assign to n the trajectory of closest_pred. This means
# updating ind_traj, traj_prop, traj_segm
and
# updating ind_traj, traj_prop, traj_
vert_ind, traj_
segm
# expanded_traj. closest_pred is already in a
trajectory,
#
and
expanded_traj. closest_pred is already in a
# traj_prop[closest_pred]] is defined. We
extend the
#
trajectory,
traj_prop[closest_pred]] is defined. We
# trajectory of closest_pred forward.
#
extend the
trajectory of closest_pred forward.
traj_prop
[
n
]
=
traj_prop
[
closest_pred
]
traj_prop
[
n
]
=
traj_prop
[
closest_pred
]
traj_vert_ind
[
traj_prop
[
n
]].
append
(
n
)
traj_segm
[
traj_prop
[
n
]].
append
(
g
.
vertex_properties
.
name
[
n
])
traj_segm
[
traj_prop
[
n
]].
append
(
g
.
vertex_properties
.
name
[
n
])
inst_eddies
=
list
(
g
.
vertex_properties
.
inst_eddies
[
n
])
inst_eddies
=
list
(
g
.
vertex_properties
.
inst_eddies
[
n
])
expanded_traj
[
traj_prop
[
n
]].
extend
(
inst_eddies
)
expanded_traj
[
traj_prop
[
n
]].
extend
(
inst_eddies
)
else
:
else
:
ind_traj
=
new_traj
(
ind_traj
,
traj_prop
,
n
,
g
,
traj_segm
,
ind_traj
=
new_traj
(
ind_traj
,
traj_prop
,
n
,
g
,
traj_segm
,
expanded_traj
)
expanded_traj
,
traj_vert_ind
)
else
:
else
:
ind_traj
=
new_traj
(
ind_traj
,
traj_prop
,
n
,
g
,
traj_segm
,
expanded_traj
)
ind_traj
=
new_traj
(
ind_traj
,
traj_prop
,
n
,
g
,
traj_segm
,
expanded_traj
,
traj_vert_ind
)
# traj_prop[n] is defined
# traj_prop[n] is defined
print
(
"
Number of trajectories:
"
,
len
(
traj_
segm
))
print
(
"
Number of trajectories:
"
,
len
(
traj_
vert_ind
))
with
open
(
"
traj_segm.json
"
,
"
w
"
)
as
outfile
:
with
open
(
"
traj_segm.json
"
,
"
w
"
)
as
outfile
:
json
.
dump
(
traj_segm
,
outfile
,
indent
=
4
)
json
.
dump
(
traj_segm
,
outfile
,
indent
=
4
)
...
...
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