These files will usually be created in the same directory.

Correct the test to know whether we can use part of the properties
already calculated for the beginning of the segment. When `len_seg ==
2 * n_days_avg`, `g.vp.inst_eddies[n][-n_days_avg:] =
g.vp.inst_eddies[n][n_days_avg:]` so
`g.vp.inst_eddies[n][:n_days_avg]` and
`g.vp.inst_eddies[n][-n_days_avg:]` are disjoint. The bug comes from
commit bdd0ce41.

So that corresponding dates are in a possible
order. `edgelist_Isic_2.csv` still has the same edges than
`edgelist_Isic_1.csv` in a different order. Note that we also have to
change `e_overestim`.

Following the  move of `extract_component.py`.

Move script `extract_component.py` from directory Trajectories to
directory Overlap. It does not deal with trajectories and it does not
need the input graph to be a graph a segments.

This is useful to find the shortest path between the beginning and the
end of a trajectory, or to create a histogram of the number of
trajectories per component.

Bug fix: correct sign of variation of Rossby number and radius. We
have to be consistent with the computation of `delta_ro_mean` and
`delta_r_mean`. `delta_ro_mean` and `delta_r_mean` were computed by
subtracting origin from tail.

It does not make sense here to assume an ellipsoid: the computation of
the distance with $\cos \phi \delta \lambda$ and $\delta \phi$ is a
rougher approximation than treating the Earth as a sphere.

We avoid multiple conversions to rad of the same value, in the loop on
edges, since a segment can be head or tail of several edges.

Move functions `node_to_date_eddy` and `date_eddy_to_node` from script
`report_graph.py` to script `util_eddies.py`. `util_eddies.py`
contains more basic functions, it only imports
shapefile. `report_graph.py` imports networkx. It was not convenient
nor meaningful to require networkx for scripts that use
`node_to_date_eddy` or `date_eddy_to_node`.

Read orientation from `expanded_traj.json`.

This seems to be a little faster, even if we do not use out-degree for
all the nodes. For `Global_1993_2023/Graph_anti`, this commit reduces the time
to define `traj_prop` from 23 s to 20 s.

We know that we are going to need in-degree for every node of the
graph. For `Global_1993_2023/Graph_anti`, this commit reduces the time
to define `traj_prop` from 31 s to 25 s.

This looked good but was much longer. For example, for
`Global_1993_2023/Graph_anti`, this commit reduces elapsed time
approximately from 24 mn to 2 mn.

This makes quite a difference in file size for a large domain. For
example, the size of `Global_1993_2023/Graph_anti/expanded_traj.json`
is reduced from 0.6 to 0.3 GiB. We do not need pretty display for
these files.

This is convenient for scripts `plot_traj.py`, `filter_traj.py` and
for hacking with function `get_duration` of `plot_traj.py`.