The Next Generation of 2D Roleplaying Games
http://elysianshadows.com/phpBB3/
bugmenot wrote:http://en.wikipedia.org/wiki/Social-cir ... work_model
This looks similar to your model.
What warning level is your compiler set to?
yeah, the idea is that each node does its part. but i dont think im going to venture down the multithreaded line. hehe.bugmenot wrote:I am not really a sports spectator person but I do find cricket extremely boring.
Back on your code, a co-worker pointed out interestingly that it can be extended to run as parallel processes which is a huge advantage as you have multiple sentinels/messages going through the network.
Checks all children of depth 0, then all children of depth 1, then all of ... etc. Increase in runtime is small. In fact,Iterative deepening depth-first search (IDDFS) is a state space search strategy in which a depth-limited search is run repeatedly, increasing the depth limit with each iteration until it reaches d, the depth of the shallowest goal state.
wikipedia wrote:The space complexity of IDDFS is O(bd), where b is the branching factor and d is the depth. Since iterative deepening visits states multiple times, it may seem wasteful, but it turns out to be not so costly, since in a tree most of the nodes are in the bottom level, so it does not matter much if the upper levels are visited multiple times
The time complexity of IDDFS in well-balanced trees works out to be the same as Depth-first search: O(b^d).
Code: Select all
Node* FindNodeStart(Node* root, Node* target /* or string targetname, whatever */) {
unsigned int maxDepth = 0;
Node* retval;
do {
retval = FindNode(root, target, 0, maxDepth);
maxDepth++;
} while (retval != target && retval != NULL);
if (retval != NULL)
cout << "Yes" << endl;
else
cout << "No" << endl;
return retval;
}
//Return self on fail with children, return NULL on total failure (fail, no children), return target on success
//at least, that's what it's supposed to be. no testing, no ide
Node* FindNode(Node* root, Node* target, int depth, int maxDepth) {
if (root == target) {
cout << "Found target." << endl;
return root;
}
if (depth == maxDepth) {
if (root.children.length == 0)
return NULL;
else
return root;
}
Node* retval;
foreach (child in root.children) { //please pardon the shorthand for vector iterator and increment
retval = FindNode(child, depth+1, maxDepth);
if (retval == target) {
cout << "Parent: " << root->getName() << endl;
return retval;
}
}
return NULL;
}
