@Ixrec I want to find algorithmically the number of nodes, that are not connected to each other with any path, and have the same relative order.
Suppose for example that we have graph and the nodes are a,b,c,d,e.
b and c, b and d, c and d, a and c, and d are not connected to each other.