Path: csiph.com!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: Ben Bacarisse Newsgroups: comp.lang.javascript Subject: Re: Condition fullfilled to early "sometimes" Date: Wed, 02 Mar 2016 16:27:44 +0000 Organization: A noiseless patient Spider Lines: 89 Message-ID: <87ziughmkf.fsf@bsb.me.uk> References: <6ed0a1f8-d173-4de6-aff6-3590b34072d4@googlegroups.com> <65c8fd95-aefc-452e-ba2b-c4a94b1e7e1d@googlegroups.com> <87si0ajtuk.fsf@bsb.me.uk> <07c551f4-7b92-4e60-afbe-d0bd2ff62962@googlegroups.com> <85aadccc-54fc-4136-a43b-8192fafcaf68@googlegroups.com> <5cb9c676-5153-4676-928b-355b386fe1ca@googlegroups.com> <8760x5jh1y.fsf@bsb.me.uk> <7d8ee7de-9921-4b79-ac1e-b7492abae36a@googlegroups.com> <87ziuhi1d0.fsf@bsb.me.uk> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="017616aa25f81ec581c44d76d61ba2f3"; logging-data="29141"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18Qdi0ivw1ogl8k8oRvIW5ZJlplIHqB7No=" Cancel-Lock: sha1:4Tr1dhQ3eCM4HijHL/b909eL8zw= sha1:Hc0MlTYQ0eXwo+tfPNaGc7FD8X0= X-BSB-Auth: 1.53d67092ae6a9b24ebe0.20160302162744GMT.87ziughmkf.fsf@bsb.me.uk Xref: csiph.com comp.lang.javascript:29773 jonas.thornvall@gmail.com writes: > Den onsdag 2 mars 2016 kl. 12:08:17 UTC+1 skrev Ben Bacarisse: >> jonas.thornvall@gmail.com writes: >> >> > Den onsdag 2 mars 2016 kl. 11:44:05 UTC+1 skrev Ben Bacarisse: >> >> jonas.thornvall@gmail.com writes: >> >> >> >> >> >> Why did you post all those old lines? It's better to cut your messages >> >> down. >> >> >> >> > Phewww http://jt.node365.se/mydebug3.html >> >> > >> >> > Last minute rescue!!! At least i have not found any incorrect >> >> > reports. I think it breaks and decide correct for any generated >> >> > network. >> >> >> >> Not as far as I can see. One sample output: >> >> >> >> $ nodejs mydebug3.js >> >> Hurray **failed** generate regular graph >> >> >> >> [ { nodelinks: [ 4, 2 ], nroflinks: 0 }, >> >> { nodelinks: [ 2, 4 ], nroflinks: 0 }, >> >> { nodelinks: [ 0, 1 ], nroflinks: 0 }, >> >> { nodelinks: [], nroflinks: 0 }, >> >> { nodelinks: [ 0, 1 ], nroflinks: 0 } ] >> >> >> >> >> >> -- >> >> Ben. >> > >> > I am not sure what you mean? >> >> Just that with values of linkval == 2 and lmult == 2 I get output as >> above that appears to report failure. >> >> > It can't possibly be a uniform graph, if you don't make a chain? >> > The last one can't possibly link to itself, it must be a chain? >> >> I don't know what the program is trying to do, so I don't know if this >> output is correct or not. I don't even know if the input values are >> valid. You are likely to get better help if you explain what you are >> trying to do (and that would mean using the standard terms). >> >> > The program works. >> >> Great. > > Well i said nothing about cycle length i just ordered because of > simplicity but > > The subsets all on the form links*multiple+1=nodes, i just thought it > was handy when drawing all to all and looked nice. But of course i can > do something where you can chose nodes and links free. > > But these is regular graphs, all nodes have same number of links, but > as you hint maybe just a subset of them? > > 0'st NODE Links-> 4,5,1 > 1'st NODE Links-> 0,2,6 > 2'st NODE Links-> 1,9,4 > 3'st NODE Links-> 9,5,8 > 4'st NODE Links-> 0,2,9 > 5'st NODE Links-> 0,3,7 > 6'st NODE Links-> 1,8,7 > 7'st NODE Links-> 5,6,8 > 8'st NODE Links-> 3,6,7 > 9'st NODE Links-> 2,3,4 What about: Hurray **failed** generate regular graph 0'st NODE Links-> 3,9,7 1'st NODE Links-> 5,7,6 2'st NODE Links-> 9,6,8 3'st NODE Links-> 0,5,6 4'st NODE Links-> 9,5,7 5'st NODE Links-> 1,3,4 6'st NODE Links-> 1,2,3 7'st NODE Links-> 0,1,4 8'st NODE Links-> 2 9'st NODE Links-> 0,2,4 ? -- Ben.