Thank you i understand it. Could u please elloborate on the last part
"..You can optimise this by using an array of pointers.."

Do you mean that this;

<a weight=5>
<b weight=1>
<c weight=2>

First calculated the range for each node.
A = 0 - 5
B = 6 - 7
C = 8 - 10

Then store in an array like so?
Array[0-5] = A
Array[6-7] = B
Array[8-10] = C

Last step get a random number between 0 - 10 => for instance 5

//result is then
return Array[5] as XML

If this is what you mean, would this approach not take a 'relatively' big amount of memory?


Paul Andrews wrote:
Jiri wrote:
Hello list,

I have an XMLList that can vary in length. I pick a random node each time using the simple method below:

var tRandom:int = int(Math.random()*tXMLSource.nodes.length() );
return tXMLSource.nodes[tRandom]

Now i would like to change it, so that I can specify a weight to each node. This weight would have to determine the probability the nodes get selected out when a random pick is being performed.

Does anybody know how to build such an algorithm?
Sum all of the node weights, then generate a random number within that range.

Now you have to find the node corresponding to that number. This can be done by traversing the nodes in sequence. As you traverse the nodes sum the weight until the value generated is within the range - then you have the right node.

You can optimise this by using an array of pointers, or keeping the weights in an external array, but that may be more or less interesting depending on the number of nodes involved and what optimisation you need.


Much appreciated,

Flashcoders mailing list

Flashcoders mailing list

Flashcoders mailing list

Reply via email to