The test is useless in this version since we know `traj_prop[n] == -
1` at the beginning of the iteration, but we are preparing to process
phantom patterns.

Preparing to process phantom patterns.

Define `traj_segm` and `expanded_traj` after the loop on
vertices. This is clearer, and we are preparing to process phantom
patterns.

Preparing to define `traj_segm` and `expanded_traj` out of the loop on
vertices.

Change type of vertex property name in graph-tool graphs from string
to int. The option used in function `load_graph_from_csv` requires
version >= 2.49 of graph-tool.

Preparing for a check on the first file.

Preparing for another call to this function.

Check output file suffix at the beginning of the script. No sense
going through the calculation if the suffix is wrong.

Do not modify dummy argument x of `plot_distr_funct`.

The old algorithm did not give correct results on tests
`Greece_trajectories`, `Test_order_edges` and `Traj_component`. We
abandon the idea of processing edges in date order. Instead, we now
process vertices in topological order.

This can happen if the edgelist file is not found.

`my_subgraphs` is only used inside the test on `"cost_function"`.

This can happen if the input graph file contains only an extracted
component.

Necessary because, with old input files, the graph did not have the
property `e_overestim`.

Instead of reading it from standard input.

Generalize `extract_component.py` so it can also write a graph in
graph-tool or graphml format. This is useful to extract a component of
the graph of segments including cost values.

Generalize `extract_component.py` so it can also read a graph in
graph-tool or graphml format.

This is useful for hacking.

The downside is that we store all duration values.

Test `args.min_duration` outside the loop on `expanded_traj`. Clearer.