Unit Tests for parsing iiLang Percepts (and Iilang Elements). unit test for perceptCollection not written. All tests pass
Merge branch 'AgentLogicAI' of https://github.com/jannickj/nabf into IiLangFsharp

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/AgentLogicClient.fs
	TeamNabf/NabfAgentLogic/Graph.fsi
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
Merge branch 'AgentLogicAI' of https://github.com/jannickj/nabf into IiLangFsharp

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/AgentLogicClient.fs
	TeamNabf/NabfAgentLogic/Graph.fsi
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
* Implemented parsing percepts defined so far (Untested)
* Introduced namespace “Graphing”, which contains “Graph” and “Dijkstra” modules so far
* Removed “Position” from AgentTypes.Agent, as we already have “Node”
Moved IiLang-files to subfolder “IiLang”. Parsing and building should be in seperate files
Merge branch 'IiLangFsharp' into Dijkstra

Conflicts:
	TeamNabf/NabfAgentLogic/AgentTypes.fs
Merge branch 'AgentLogicAI' into Dijkstra

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/Graph.fs
	TeamNabf/NabfAgentLogic/Inspector.fs
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
	TeamNabf/NabfAgentLogic/Repairer.fs
	TeamNabf/NabfAgentLogic/Saboteur.fs
Fixed misc. build errors
Fixed folders
Implemented example accumulative path cost (to be moved out of Dijkstra.fs
* Dijkstra now takes a generic “Problem” type, which contains
	* a function to check whether a given vertex is the goal vertex
	* a function to compute a new cost given a previous cost and an edge cost
	* an initial cost
  This allows us to use generic costs, like the one currently used by the agents ( which is based on energy and turns spent)
* Provided wrappers for Dijkstra in PathFinding module, along with an implementation of a path cost
Code cleanup
* Implemented Graph.removeVertex with single passing unit test
* reintroduced Graph.fsi
implemented functionality for finding the number of edges between two vertices (distanceTo) and for pathing to the nearest unexplored or unprobed vertex. (Where unexplored means that all its edges have unknown weights
Finished basic agent logic. Added tryGo and tryDo wrappers for actions.
Merge branch 'Fsharp' of https://github.com/jannickj/nabf into Fsharp

Conflicts:
	TeamNabf/AgentLogicTest/AgentLogicTest.fsproj
	TeamNabf/NabfAgentLogic/AgentTypes.fs
	TeamNabf/NabfAgentLogic/CommonLogic.fs
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
worked on IiLang parsing
Merging branches
Merge branch 'IiLangFsharp' into Fsharp
Connected 28 agents, each in their own thread, and played a simulation (aka sending an action every turn).