def accessibility(graph):
recursionlimit = getrecursionlimit()<EOL>setrecursionlimit(max(len(graph.nodes())*<NUM_LIT:2>,recursionlimit))<EOL>accessibility = {}        <EOL>for each in graph:<EOL><INDENT>access = {}<EOL>_dfs(graph, access, <NUM_LIT:1>, each)<EOL>accessibility[each] = list(access.keys())<EOL><DEDENT>setrecursionlimit(recursionlimit)<EOL>return accessibility<EOL>
Accessibility matrix (transitive closure).

@type  graph: graph, digraph, hypergraph
@param graph: Graph.

@rtype:  dictionary
@return: Accessibility information for each node.