Package edu.kit.ipd.sdq.attacksurface.graph.patch
package edu.kit.ipd.sdq.attacksurface.graph.patch
-
ClassesClassDescriptionAllDirectedPaths<V,
E> A Dijkstra-like algorithm to find all paths between two sets of nodes in a directed graph, with options to search only simple paths and to limit the path length.