Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

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??

Help for this page

Select Code to Download

  1. or download this
    perl -le '@x = qw(a b c d e f);
                @y = qw(a d f);
                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
  2. or download this
    b c a
    e f g
    g d f
    h i g
  3. or download this
    a b c
    a b d c
    e f d g
  4. or download this
    component 1 = a b c
    induced = b c a
    component 3 = e f d g
    induced = e f g
    g d f 

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://997598]
[Your Mother]: :P
[LanX]: Moma knows best! ;-)
[Your Mother]: I am quite aware that Module::Build is MUCH more in favor with many monks but I had trouble with it every time I tried to use it and trouble with CPAN stuff that used it too.
[Your Mother]: Take my advice with a grain of salt. I haven't done a new CPAN release in years at this point.
[LanX]: I want to author a new module for CPAN w/o complicated build structure
[LanX]: ther is also Dist::Zilla :-/
[LanX]: How to make a CPAN Module Distribution from 2002
[Your Mother]: Dist::Zilla is kind of the nuclear option. I set it up back in the day but it's really targeted at authors who are managing MANY modules and want to automate everything.
[erix]: perlancar should know ;)
[LanX]: see warning

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (9)
As of 2017-08-18 17:42 GMT
Find Nodes?
    Voting Booth?
    Who is your favorite scientist and why?

    Results (306 votes). Check out past polls.