Algorithm 1.

MODIT(G, Δ, k, l).

1	Let motifMap be an empty hash map.
2	minedSubgraphs = ∅
3	for each e = (u, v, t) ∈ E(G) do
4	Let S be an empty graph.
5	V(S) = V(S) ∪ {v}
6	E(S) = E(S) ∪ {e}
7	minedSubgraphs = minedSubgraphs ∪ S
8	minTime = t
9	maxTime = 0
10	λ = + ∞
11	Let timestampSet be an empty multiset
12	timestampSet = timestampSet ∪ {t}
13	UpdateBounds (timestampSet, Δ, minTime, maxTime, λ)
14	M = StandardizeTimestamps (S)
15	C = ComputeCanonization (M)
16	UpdateOccurrences (motifMap, C)
17	RecursiveSearch (S, u, Δ, timestampSet, minTime, maxTime, λ, motifMap, k, l, minedSubgraphs)
18	RecursiveSearch (S, v, Δ, timestampSet, minTime, maxTime, λ, motifMap, k, l, minedSubgraphs)
19	return motifMap