说明：  设计一个有向图，建立图的邻接矩阵或邻接表的存储结构，完成有向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作
(Design of a directed graph, the establishment of the adjacency matrix or adjacency list of the storage structure, complete directed graph DFS (depth-first traversal) and BFS (breadth-first traversal) operation)