Verification and conversion =========================== Especially when dealing with real-world data we need to verify that our networks are in the right format for further analysis. We also need to convert the formats to each other. Verification ~~~~~~~~~~~~ Both :class:`_tacoma.edge_lists` and :class:`_tacoma.edge_changes` need to follow certain restrictions such that all algorithms in the package will work without error. The restrictions are as follows - All event times including :math:`t_0` and :math:`t_\mathrm{max}` need to be in order and none of them must be equal. - The lists :math:`t` and `edge_lists` must be of equal length (:math:`t`, `edges_in`, and `edges_out`, respectively. - Each list containing edges must not contain duplicate edges, each edge :math:`(i,j)` must fulfill :math:`i>> tc.verify(temporal_network) 0 The function will return the number of found errors. It will also be very verbose about any errors. Within verification, any edge where :math:`i>j` will be swapped such that afterwards, :math:`i