Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.javascript > #25445

Re: Number of needed nodes to create collison free network.

Show all headers | View raw

Den fredagen den 18:e juli 2014 kl. 17:49:47 UTC+2 skrev jonas.t...@gmail.com:
> Den fredagen den 18:e juli 2014 kl. 14:43:11 UTC+2 skrev Ben Bacarisse:
> 
> > jonas.thornvall@gmail.com writes:
> 
> > 
> 
> > <snip>
> 
> > 
> 
> > > I do mean connecting just one shape Ben in such a way all outgoing
> 
> > 
> 
> > > nodes have individual names. There is no problem if the current corner
> 
> > 
> 
> > > connect to a corner using the same name, but all the outgoing paths
> 
> > 
> 
> > > should lead to unique named corner/crosspoint.
> 
> > 
> 
> > 
> 
> > 
> 
> > OK, I had a stab at it, but I don't know what you mean.
> 
> > 
> 
> > 
> 
> > 
> 
> > -- 
> 
> > 
> 
> > Ben.
> 
> 
> 
> I am not that mathematicly inclined so i do not have the sufficient language to communicate the problem. But i will try to program it for a square.
> 
> Given the square you can the Origo each corner/cross section have four nodes "those nodes around each corner could hold natural numbers *4*. 
> 
> 
> 
> But since it is a one way path leading from Origo to the individual "it seems a waste of space and time to use 4 digit we could had managed with just two? Because the paths out from square is oneway thus two pointing to the square itself? But we could store four  natural numbers centered around each "corner" cross section. 
> 
> 
> 
> I distinguish between cross section names and node names maybe that what people find weird? 
> 
> 
> 
> To find one of the four natural numbers stored around each corner/cross section you must take an extra step out.
> 
> 
> 
> 
> 
> So could i managed below with just 2 digits and still have unique optimal path leading out from each chosen square? 
> 
> 
> 
> 2    1    2     1    2    1 
> 
> 
> 
> 4    3    4     3    4    3
> 
> 
> 
> 2    1    2     1    2    1
> 
>              O
> 
> 4    3    4     3    4    3
> 
> 
> 
> 2    1    2     1    2    1 
> 
> 
> 
> 4    3    4     3    4    3
> 
> 
> 
> 
> 
> Admittedly i feel a bit dizzy about this, but can we chose an optimal path to find any of the  4 numbers stored around each of the cross sections using two digits?
> 
> 
> 
> 
> 
> 1   2   1   2   1   2    
> 
> 
> 
> 1   2   1   2   1   2 
> 
> 
> 
> 1   2   1   2   1   2
> 
>           O
> 
> 1   2   1   2   1   2
> 
> 
> 
> 1   2   1   2   1   2
> 
> 
> 
> 1   2   1   2   1   2
> 
> 
> 
> 
> 
> I can now see there is 2 more restrictions, and two requirments.
> 
> 
> 
> Restriction 1. Once you leave origo in one direction S,W,E,N you can go on a straight line but never go back like +W -W that would not be the shorest path. 
> 
> 
> 
> Restricton 2.And **Exception*** last digit hold 4 values the searched number could be in the negative directon?. You must always take an extra step to find the number stored at the cross section node.
> 
> 
> 
> Requirment 1. Need an intitialisaton vector SE, SW, NE, NW.
> 
> 
> 
> Requirment 2. A structure to create the lookup table for the numbers.
> 
> 
> 
> So is it possible, well i will try implement it with a lookup table for squares, but the big benefits is probably using more nodes, platonic solids?

Hello Ben you see to be quite knowledgeable into math and if you read this and the post before maybe you can understand my unconventional way of thought. I understand i could be way off. But I find these things very strange and annoying, and if someone could give it a thought and understand what i mean i would be greatful. 

Basicly there is two things making up the encoding cross section and "their names" for squares "2 binary digits" needed for finding each node and finally the sought natural number. 

The natural numbers are stored around each cross section (lookup table needed) and you can see above that only two binary digits needed to store for each node.

Well this is how the actual lookup table storing the naturals at the cross section could look like and you find them using the node table in previous post.

Well +1

34_|_35  6_|_7  10_|_11
33 | 36  5 | 8   9 | 12
30_|_31  2_|_3  14_|_15
29 | 32  1 | 4  13 | 16
26_|_27 22_|_23 18_|_19
25 | 28 21 | 24 17 | 20 

Back to comp.lang.javascript | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-18 03:15 -0700
  Re: Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-18 04:45 -0700
  Re: Number of needed nodes to create collison free network. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2014-07-18 12:57 +0100
    Re: Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-18 05:30 -0700
      Re: Number of needed nodes to create collison free network. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2014-07-18 13:43 +0100
        Re: Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-18 08:49 -0700
          Re: Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-18 11:10 -0700
            Re: Number of needed nodes to create collison free network. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2014-07-18 20:00 +0100
              Re: Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-18 12:28 -0700
                Re: Number of needed nodes to create collison free network. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2014-07-18 21:32 +0100
  Re: Number of needed nodes to create collison free network. "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2014-07-19 04:41 -0700
    Re: Number of needed nodes to create collison free network. jonas.thornvall@gmail.com - 2014-07-19 07:37 -0700

csiph-web