Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

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

by AnomalousMonk (Abbot)
on Oct 04, 2012 at 17:00 UTC ( #997258=note: print w/ replies, xml ) Need Help??


in reply to Finding subgraphs induced by a set of given vertices.

zing: If you run Anonymonk's code of node 997164 with the necessary changes of 997168 and 997253, how does it work for you? It seems to me to produce the results you want given the limited dataset examples you have given.


Comment on Re: Finding subgraphs induced by a set of given vertices.
Re^2: Finding subgraphs induced by a set of given vertices.
by zing (Beadle) on Oct 05, 2012 at 06:38 UTC
    AM its now what I want.Here's the output from the code given by anonymous
    Got some? (["b", "c", "a"], { MATCHES => [] }) Got some? (["a", "c", "d"], { MATCHES => [] }) Got some? (["d", "e", "b"], { MATCHES => [["b", "e", "d"]] })
    But for T = a b c d I have induced = "b", "c", "a" , "a", "c", "d" .

    Similarly for T = b e d output should be = "d", "e", "b" .

        Sheisse !!!!! Mein Fehler!!!!
        Hi AM, I have posted a problem similar to the one you people have been helping me with at this link http://www.perlmonks.org/?node_id=997708

        Please help me complete it

Re^2: Finding subgraphs induced by a set of given vertices.
by zing (Beadle) on Oct 05, 2012 at 12:29 UTC
    The code fails on this data Code
    ---------DATA-------------- b c a a c d d e b e f g g d f h i g
    And the output is
    component 2 = e d g f component 1 = c a b b c a
    Which is wrong, because it should have been this
    component 2 = e d g f e f g g d f component 1 = c a b b c a
    Because with the vertices in component 2, we can have 4th & 5th row of DATA. Please help on this
      I hope I was clear explaining my problem. Please let me know if you need any other information. Help me on his
        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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (15)
As of 2014-12-19 20:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

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





    Results (91 votes), past polls