Hello,
considering an application where a map is represent by a graph (array of vertex and adjmatrix). Also in that application, 2 agents have to go on the map and find ways in it (using different algorithms).
A possible way to do it: using an AdjMatrix for each agent. When the agent goes into a new node it checks the real adj of the map and then update it's own adjmatrix.
What do you think? Thanks.