Graph Slicing based on connectivity

[ZigRazor]

Add graph slicing based on connectivity.
E.g. given
A -> B -> C <- D
A -> E -> C -> F
and the starting node A: A, B, and E can be sliced off.
Mathematical definition of the problem:
Let G be the set of nodes in a graph and n be a given node in that set. Let C be the non-strict subset of G containing both n and all nodes reachable from n, and let C' be its complement. There's a third set M, which is the non-strict subset of C containing all nodes that are reachable from any node in C'.
The problem consists of finding all nodes that belong to C but not to M.

The reason why this problem is relevant is because it's used in garbage collection systems to decide which other objects need to be released, given that one object is about to be released.

[sidml]

@ZigRazor
I can work on this if it's okay. I was wondering if there is any specific algorithm for this or an optimized way of doing this ?
I was thinking of doing the following:

• Use DFS or BFS to find all nodes reachable from n. These are elements of set C.
• Initialize C' to be complement of C (i.e. all nodes - nodes that are in C)
• For all nodes in C', apply DFS/BFS and get the list of reachable nodes. This is set M.
• Finally removes nodes from C that belong to M. This is our solution.

[ZigRazor]

@sidml
I think is OK as a first implementation, then if someone knows a better implementation, we can ever review this implementation.
So if you are ok, i assign this issue to you!

[ZigRazor]

@sidml remember that you have assigned also the issue #70

[ZigRazor]

@sidml given your contributions to the repository, I would like to invite you as a contributor to the repository. I am sending you the invitation!

[sidml]

@ZigRazor Thanks! I hope to keep working on new functionalities.

[ZigRazor]

@ZigRazor Thanks! I hope to keep working on new functionalities.

If you have more suggestion, you can open issue and implement the functionalities, or eventually wait someone contribute to the project!
Don't forget to spread the words, over every channel you know.
I want to create a community to grow up this project!
Thank you !