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

Replies are listed 'Best First'.
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"]] })` [download] 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" .	[reply] [d/l]
Re^3: Finding subgraphs induced by a set of given vertices. by Anonymous Monk on Oct 06, 2012 at 08:31 UTC
Gee, like, you can read Re^4: Finding subgraphs induced by a set of given vertices., and like adjust to whatever you actually want	[reply]
Re^4: Finding subgraphs induced by a set of given vertices. by zing (Beadle) on Oct 06, 2012 at 12:10 UTC
Sheisse !!!!! Mein Fehler!!!!	[reply]
Re^4: Finding subgraphs induced by a set of given vertices. by zing (Beadle) on Oct 07, 2012 at 20:15 UTC
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	[reply]
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` [download] And the output is `component 2 = e d g f component 1 = c a b b c a` [download] 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` [download] Because with the vertices in component 2, we can have 4th & 5th row of DATA. Please help on this	[reply] [d/l] [select]
Re^3: Finding subgraphs induced by a set of given vertices. by zing (Beadle) on Oct 05, 2012 at 20:07 UTC
I hope I was clear explaining my problem. Please let me know if you need any other information. Help me on his	[reply]
Re^4: Finding subgraphs induced by a set of given vertices. by zing (Beadle) on Oct 06, 2012 at 08:24 UTC
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` [download] 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` [download] @Components `a b c a b d c e f d g` [download] 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` [download]	[reply] [d/l] [select]