Elysian Shadows

You have a logic bug which screw with your algorithm (I am surprised your compiler didn't pick it up): Note the ; at the end of the if statement.

At least it still had a shorter development time then Duke Nukem's Forever. Random fact, Pokemon took 6 years from concept to release and Nintendo had no idea it was going to sell that well. http://spong.com/feature/10109598/Inter ... _Interview

Hm. I am just trying to figure which publishers are more likely to pick it up. Until he gets a publisher, trying to get a SDK is virtually pointless. The only publisher that comes to mind are Gamecock . The alternative is to release for niche platforms like how Yuan Works did with Wind and Water (GP...

*business cap off* Wow. I am impressed, I just watched both trailers and for a 1 person project, it is very good. The only problems I see from the videos is that it isn't really clear what the aim is short of 'existing' and that I can see many people (beyond the hardcore) just being stuck on the fir...

I figured this was the case, I assume similar to many C++ specific functions, where you forfeit speed and efficiency for safer or user-friendly functions. Actually, in release mode vector traversal is just as fast as arrays but provides safety checks in debug. Read: http://www.parashift.com/c++-faq...

I left Nintendo a nice message with a few expletives to get my anger through =D It doesn't help unless Nintendo decides to publish it. It doesn't make any business sense to give a random person with no previous industry or business experience a DevKit kit (which he may or may not afford) to develop...

avansc wrote:where do you work if i may ask.

Sorry, I have to keep that confidential due to contractual reasons.

Edit: MSc in Games Programming.

Honestly, no surprise. The developer doesn't have a rep in the industry and no funds in place to push the game through to completion. For example, how is he/she going to publish this game by him/herself? He/she should get in touch with a publisher who will provide the funding and also deal with Nint...

If you need the memory to be allocated off the stack, arrays. If you don't care, vectors. Just make sure you use the reserve function to prevent too many reallocations when you increase the vector size. Edit: Slightly off topic but worth a read: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/200...

avansc wrote:in the method i showed. if we used your tree structure. F can in no way be a child of A.

Why not? Andre(A) -> Claire(B) -> Mick(F).

if i may ask, what is your technical background?

MSc and 2 years in the industry.

For the sake of the following, lets assume the friend links are one way, as I understand your algorithm, your data store is like: http://i35.tinypic.com/qs8unp.jpg However, as start your algorithm from A, it conceptually becomes: http://i34.tinypic.com/w0m4uv.jpg The links between the parent and the...

Look at the C++ vector in the STL. The references used have nothing to do with how the links are being stored and are just there out of habit from programming practises. You can remove all the & signs and it will still work but pass everything by value. (In fact, I accidentally left some dead co...

This is a breadth first graph traversal without references or pointers with the simplified version of the original problem and one way links between nodes (I had half the code written already). Excuse the sloppy coding as it was done in a rush: #include <iostream> #include <map> #include <string> #i...

can you do tree traversal in C++ without pointers and references?

Yes. A link is not necessary has to be maintained via a pointer (*) or a reference (&), you can easily do this via a GUID. Out of interest, how are you maintaining the list of friends for a node?

Consider if A knows B, B knows C and Z, C knows D. A to B is a link, B to C is a link, B to Z is a link, C to D is a link. Using your method described above (unless it was described incorrectly), we with see if A is connected to D. the network lets person X know that someone is looking for it. perso...