Re^4: Finding subgraphs induced by a set of given vertices.

[zing]

Guys the problem is like to check if an array is contained inside another array.

perl -le '@x = qw(a b c d e f);
            @y = qw(a d f);
            $n = grep { $e = $_; not grep { $e =~ /\Q$_/i } @x } @y;
            print "Count of elements in (@y) that are NOT present in (
+@x) = $n"
           '
Count of elements in (a d f) that are NOT present in (a b c d e f) = 0

So if the count is 0, you know that @y is a subset of @x and hence you want to return it from the "induced" subroutine. I hope this would even clear out the mess. Now can this be incorporated as a subroutine. The input will be DATA taken in as an array. The second array will hold the connected components.

____DATA_____
b c a
a c d
d e b
e f g
g d f
h i g

@Components

a b c
a b d c
e f d g

So I want to see if any row of @DATA is contained inside @Components. So the output expected is

component 1 = a b c
induced = b c a
component = a b d c
induced = b c a
a c d
component 3 = e f d g
induced = e f g
g d f