Re: trees, trees, trees
Date: Mon, 25 Jun 2012 01:26:46 +0200
Message-ID: <js87pe$aou$1_at_news.task.gda.pl>
Gerard H. Pille wrote:
> I'm not sure I'll be able to help you. I did understand your original
> requirements, but now you've lost me. I do not know what "edges of a
> graph" are. What are columns p and c in your table? What do they contain?
what is not clear to you? I thought everything was said and shown.
write down a few dots. connect them with arrows any way you like. that's a graph. an arrow corresponds to edge. an arrow introduces orientation aka parent-child relation. assign a letter to every dot. now you can describe the edge following the arrow, like FROM a TO b. the table contain edges, ie. entries FROM a TO b, FROM 7 TO 11 etc. the task is to identify all graphs and name them. the naming convention is that you pick any "dot name" composing the graph and assign it to graph. you can identify a graph only by identifying all edges belonging to it. a grouping column was introduced for debugging purposes only. it helps you to easily spot edges which form a graph so that you can compare the output of your algorithm at a glance.
thank you,
geos
Received on Sun Jun 24 2012 - 18:26:46 CDT