Figure 1: Synoptic representation of the system describing the NAOP based SPP solver concept. The input commands (or external commands) and are used, respectively, for assigning attributes to nodes and values (or costs) to edges. The matrix is the incidence matrix of the graph under investigation. The output () expresses the belonging (i.e., value is 1) or not (i.e., value is 0) to the shortest path (SP) of all edges of the graph under investigation.