Talk:Last letter-first letter: Difference between revisions

From Rosetta Code
Content added Content deleted
(Created page with "==Number of names== This is equivalent to asking for the longest path in a directed graph, which is an NP-complete problem. That doesn't rule it out as a task, but running it on ...")
 
(on input data...)
Line 1: Line 1:
==Number of names==
==Number of names==
This is equivalent to asking for the longest path in a directed graph, which is an NP-complete problem. That doesn't rule it out as a task, but running it on a graph with 646 nodes might take too long. Also, since it seems to be rare to use external files to store the data (or at least I haven't seen many tasks that call for that) having all the names in each example would get really cluttered. [[User:MagiMaster|MagiMaster]] 20:52, 5 June 2011 (UTC)
This is equivalent to asking for the longest path in a directed graph, which is an NP-complete problem. That doesn't rule it out as a task, but running it on a graph with 646 nodes might take too long. Also, since it seems to be rare to use external files to store the data (or at least I haven't seen many tasks that call for that) having all the names in each example would get really cluttered. [[User:MagiMaster|MagiMaster]] 20:52, 5 June 2011 (UTC)
: Re input data; I can always host input data if that makes it convenient to work on appropriate data. --[[User:Short Circuit|Michael Mol]] 23:12, 5 June 2011 (UTC)

Revision as of 23:12, 5 June 2011

Number of names

This is equivalent to asking for the longest path in a directed graph, which is an NP-complete problem. That doesn't rule it out as a task, but running it on a graph with 646 nodes might take too long. Also, since it seems to be rare to use external files to store the data (or at least I haven't seen many tasks that call for that) having all the names in each example would get really cluttered. MagiMaster 20:52, 5 June 2011 (UTC)

Re input data; I can always host input data if that makes it convenient to work on appropriate data. --Michael Mol 23:12, 5 June 2011 (UTC)