We now explain the definition of match morphisms and the different modes for rule application to the host graph in the context of example ShortestPath, computing the shortest path between two nodes of a given graph.
