@Carl Love I have never used heap before. You've motivated me to learn more about it. I particularly like your statistical analysis of the TreeToPrufer code. It is rather efficient. Much appreciated!

@Carl Love I'll use lprint.

@Carl Love  I've used that approach before. I find it strange that solve ignores assumptions.

@Carl Love I completely missed your response. This does what I need. Thanks!

@acer This ended up being much simpler than I was making it. Thanks! I'll have a look the the ArrayTool:-BlockCopy command.

@dharr This is perfect! Thank you!

@Carl Love As always, when I get an answer to a question here, I often learn a lot more than I expected to. Thanks much!

@acer Sorry about the ambiguity, I was thinking the former. Would it matter, though?

@acer Supposing we have a universal set of all reals, could this method be adapted to work with complements? For example, how could I do the intersection of the complement of A and B?

@acer Thanks so much. Just what I needed!

@Kitonum This is exactly what I needed. Thanks!

@rlopez Okay, it appears I was looking at the wrong package. This is exactly what I was looking for! Thanks!

@tomleslie Just what I was looking for. Thank you!

@tomleslie A path is a walk in which no vertices are repeated. So, with regard to your example, an undirected graph with three vertices would have a longest path of length 2: A-B-C, C-A-B, etc. For a cycle, only the initial and terminal vertices are allowed to be the same. Again, from your example, a couple cycles are C-A-B-C, A-C-B-A, all of length 3. Hope this clarifies my question.

@mmcdara Thank you. This does what I need it to do!