Further to the bug:
It's worse than I first thought:
I had the impression that only the
extreme case of one vertex caused problems, but
actually max_clique became completely defunct:
max_clique(complete_graph(4));
max_degree: no max degree in an empty graph.
When cleaning this up, perhaps one could also finally
actually specify what this function is supposed to
return: If just some maximal clique (w.r.t. subset-inclusion),
then which heuristics is used, or otherwise, if actually
a clique of maximum size is returned then this should be
stated.
Oliver
On Fri, Apr 25, 2008 at 01:04:01PM +0100, Oliver Kullmann wrote:
> Hi,
>
> an error was introduced with 5.15 (while 5.14
> worked correctly):
>
> load(graphs);
> max_clique(complete_graph(1));
> max_degree: no max degree in an empty graph.
>
> Obviously, the graph with one vertex has
> a nice maximal clique (namely that vertex).
> It seems to me that in general the graph-package
> is somewhat sloppily written w.r.t. cases of "emptiness".
>
> Oliver
> _______________________________________________
> Maxima mailing list
> Maxima at math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/maxima