/** * Compute the set of reachable vertices for each vertices contained in the * graph according to the specified constraint associated to the instance in * use. Inclusive process, i.e. the process do consider that vertex v is * contained in the set of reachable vertices from v. * * Optimized through a topological ordering * * @return an Map key V value the set of vertices reachable from the key * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllRVInc() throws SLIB_Ex_Critic { Map<URI, Set<URI>> allRVEx = getAllRV(); for (URI v : allRVEx.keySet()) { allRVEx.get(v).add(v); } return allRVEx; }