Figure 3From: Algorithm for shortest path search in Geographic Information Systems by using reduced graphs Rewrite rule example. On the left side is the graph G i = ({v r 1}, {}), on the right side is the graph G j = ({v 1, v 2, v 3}, {(v 1, v 2), (v 2, v 1), (v 2, v 3)}) and on the bottom is the embedding information ψ out .Back to article page