Talk:Graph colouring: Difference between revisions

Content added Content deleted

Inline

Revision as of 21:11, 15 March 2020

Thanks for open source

I am investigating a few graph algorithms hence this task. The ASCII diagrams of graphs came from this Perl CPAN module:

graph-easy

Graphviz doesn't do ASCII output so would be difficult to add its output to RC.
--Paddy3118 (talk) 20:31, 10 March 2020 (UTC)

Any tougher problems?

Are there any ready-made problems knocking about which might (frinst) give exhaustive search pause for thought? --Pete Lomax (talk) 22:37, 14 March 2020 (UTC)

If you mean larger data sets you may take a look at here, I haven't tried yet but did take a peek at one sample and it seems ready to be used. Hope this helps. --Hkdtam (talk) 03:39, 15 March 2020 (UTC)

Hmm, 317,080 nodes and 1,049,866 edges (for the example you peeked at) is far more than I would ever have imagined... --Pete Lomax (talk)

@@ Line 9: / Line 9: @@
 Are there any ready-made problems knocking about which might (frinst) give exhaustive search pause for thought? --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 22:37, 14 March 2020 (UTC)
 :If you mean larger data sets you may take a look at [https://snap.stanford.edu/data/#socnets here], I haven't tried yet but did take a peek at one [https://snap.stanford.edu/data/bigdata/communities/com-dblp.ungraph.txt.gz sample] and it seems ready to be used. Hope this helps. --[[User:Hkdtam|Hkdtam]] ([[User talk:Hkdtam|talk]]) 03:39, 15 March 2020 (UTC)
+::Hmm, 317,080 nodes and 1,049,866 edges (for the example you peeked at) is far more than I would ever have imagined... --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]])