Welcome to the directional-weighted-graph-DS wiki!

This project is our 3rd assignment in the course OOP.

Basically, we participated in a game with a simple concept:

1. By submitting an ID and level number (0-23), a server answers with a json formatted string which describes the graph, and other settings of the level.
2. Our goal is to collect points lying on the edges of the graph using our self implemented Data Structures and algorithms to move "Agents" between the nodes.
3. The agent's position is being updated with every move() command which should be minimized. therefore the results in each level is described below:

level	moves	score
0	273	147
1	551	535
2	281	269
3	580	613
4	289	313
5	556	692
6	268	79
7	538	396
8	277	130
9	532	497
10	276	222
11	619	1871
12	266	79
13	542	320
14	285	142
15	525	325
16	292	256
17	610	1166
18	263	40
19	538	320
20	266	152
21	538	238
22	289	238
23	619	886