获取有向图的所有组合

class DirectedGraph:
    def __init__(self, num_vertices):
        self.num_vertices = num_vertices
        self.adj_matrix = [[0] * num_vertices for _ in range(num_vertices)]

    def add_edge(self, start, end):
        self.adj_matrix[start][end] = 1

def get_all_combinations(graph, start, end, visited, path, result):
    visited[start] = True
    path.append(start)

    if start == end:
        result.append(path.copy())
    else:
        for i in range(graph.num_vertices):
            if graph.adj_matrix[start][i] == 1 and not visited[i]:
                get_all_combinations(graph, i, end, visited, path, result)

    path.pop()
    visited[start] = False

def get_all_combinations_of_directed_graph(graph, start, end):
    visited = [False] * graph.num_vertices
    path = []
    result = []

    get_all_combinations(graph, start, end, visited, path, result)

    return result

# 示例用法
graph = DirectedGraph(4)
graph.add_edge(0, 1)
graph.add_edge(0, 2)
graph.add_edge(1, 2)
graph.add_edge(2, 0)
graph.add_edge(2, 3)
graph.add_edge(3, 3)

start_node = 0
end_node = 3

combinations = get_all_combinations_of_directed_graph(graph, start_node, end_node)
print(combinations)