Top-down greedy algorithm
The difficulty in evaluation of DSIMG(G1,G2) is the exponential dependence of |V(L(G))| on |V(G)|
The proposed algorithm replaces the lattices by slowest paths in lattices
The slowest path P(G) in L(G) is defined as
1. The first node G’ is the root G
2. Choose leaf z ?G’ with minimal weight w(z)
3. Execute elementary morphism G’/z