Inner loop:

• you start with one point and create a hash for it's component subset and you mark the point there
• Then you mark all 1st degree neighbors in this hash.
• Then you mark all neighbors of next degree by finding new neighbors of the last degree
• and so on till there are no new neighbors

Outer loop:

• you check if there are any uncovered points left in your point set.
• If yes than you start the inner loop again with one of those.

Main:

• Once your point set is exhausted you check which of the hashes has most elements.

No code since your description is messy and - like others remarked - you didn't provide sample data or a test.

All necessary set operations could be done by deleting hash-slices and counting keys.

---

---

Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!

Titles consisting of a single word are discouraged, and in most cases are disallowed outright.

Read Where should I post X? if you're not absolutely sure you're posting in the right place.

Please read these before you post! —

• How do I compose an effective node title?
• How do I post a question effectively?
• Markup in the Monastery

Posts may use any of the Perl Monks Approved HTML tags:

a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)

	For:		Use:
	&		&
	<		&lt;
	>		&gt;
	[		&#91;
	]		&#93;

Link using PerlMonks shortcuts! What shortcuts can I use for linking?

See Writeup Formatting Tips and other pages linked from there for more info.