indent of string
Implemented decision in AgentLogic
Merge branch 'IiLangFsharp' into Dijkstra

Conflicts:
	TeamNabf/NabfAgentLogic/AgentTypes.fs
Started on basic behavioral logic.
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