  Link Streams were proposed a few years ago as a model of temporal networks.
We seek to understand the topological and temporal nature of those objects
through efficiently computing the distances, latencies and lengths of shortest
fastest paths. We develop different algorithms to compute those values
efficiently. Proofs of correctness for those methods are presented as well as
bounds on their temporal complexities as functions of link stream parameters.
One purpose of this study is to help develop algorithms to compute centrality
functions on link streams such as the betweenness centrality and the closeness
centrality.
