() "Marco Maggi" <[EMAIL PROTECTED]>
() Fri, 20 Jul 2007 18:09:54 +0200
suggest ideas.
it just so happens i'm experimenting w/ reading (simple) lisp syntax
into guile[0]. perhaps you can grep the net for lisp callgraphs and use
`read-sexp' to convert them...
another idea is to instrument (sc
Jon Wilson wrote:
Hi Marco,
I cobbled something together for you real quick. Attached. The
function you want to call is make-graph. node-count is obvious*.
edge-density is the probability that any given node has an edge to any
other given node. Symbol names are read from /usr/share/dict/w
Hi Marco,
I cobbled something together for you real quick. Attached. The
function you want to call is make-graph. node-count is obvious*.
edge-density is the probability that any given node has an edge to any
other given node. Symbol names are read from /usr/share/dict/words.
* if you se
Hello schemers,
I am pleased to announce that Guile-Lib 0.1.4 has been released. It
may be obtained at:
http://download.gna.org/guile-lib/guile-lib-0.1.4.tar.gz
What is Guile-Lib
-
Guile-Lib is intended as an accumulation place for pure-scheme Guile
modules, allowing for peop
Ciao,
I need to test some module that handles graphs and
constraint networks; I would like to automatically
generate test graphs, both cyclic and acyclic. I wonder
if someone has already written some code for it and
is willing to share it or to suggest ideas.
It should be "enough" to build so
