Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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

by zing (Beadle)
on Oct 06, 2012 at 08:24 UTC ( #997598=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Finding subgraphs induced by a set of given vertices.
in thread Finding subgraphs induced by a set of given vertices.

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


Comment on Re^4: Finding subgraphs induced by a set of given vertices.
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://997598]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (12)
As of 2014-12-17 21:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (34 votes), past polls