Is there any way to mask vertices and/or edges? I am using an igraph for scheduling and I have encountered two cases where it would be helpful to ignore vertices and/or edges:
-
Determining all ancestors for all vertices. Currently I have to execute a traversal from each vertex across all ancestors, whereas I could ideally mask ancestors that have already been discovered by a previous search and inherit that result for a successor’s traversal so only new ancestors have to be discovered by a traversal.
-
Tentatively removing a vertex. Scheduling the activities is temporary while my algorithm is executing. It may be the case that I need to unschedule an activity (i.e., re-add a removed vertex) - it would be more convenient to unmask/mask than to delete and add vertices back.