Improving performance of a reachable vertices algorithm applied on a 3 dimensional graph
Let each vertex v_i
in G
have S
states (i = {1...S})
, each state having it’s own reachable vertices cache. Given this, we can imagine the graph as a three dimensional graph.