|No such thing as a small change|
Re: Finding subgraphs induced by a set of given vertices.by LanX (Chancellor)
|on Oct 03, 2012 at 17:02 UTC||Need Help??|
to give you some explanation of Anonymous Monks code:
you are not checking for subgraphs but subsets.
Perl's way to do this is using hashes, because hash-keys are unique sets of strings.
And hashslices are a very efficient way to determine the cut between to hashes.
see also: Using hashes for set operations...
checking for subgraphs is in general far more complicated