OJ Board

Isn't Dijkstra's algorithm the fastest one for shortest-path problems?

It worked! Thanks a lot..

The following code results in a compile error, anyone got a clue why this happens?

#include <iostream>
using namespace std;

class TreeNode {
public:
int value;
TreeNode *left, *right;
TreeNode(int value) {
this->value = value;
}
bool contains(int total, int help) {
if(left == NULL && right ...