@lru_cache(maxsize=None)<EOL>def get_walks_exhaustive(graph, node, length):
if <NUM_LIT:0> == length:<EOL><INDENT>return (node,),<EOL><DEDENT>return tuple(<EOL>(node, key) + path<EOL>for neighbor in graph.edge[node]<EOL>for path in get_walks_exhaustive(graph, neighbor, length - <NUM_LIT:1>)<EOL>if node not in path<EOL>for key in graph.edge[node][neighbor]<EOL>)<EOL>
Gets all walks under a given length starting at a given node

    :param networkx.Graph graph: A graph
    :param node: Starting node
    :param int length: The length of walks to get
    :return: A list of paths
    :rtype: list[tuple]