您要查找的是不是：
- strongly connected directed graph 强连通的有向图
- rooted connected directed graph 带根连通有向图
- Strong connected directed graph 强连通有向图
- connected directed graph 连通的有向图
- We shall abbreviate "directed graph" to digraph. 我们将把“有方向的图”简称为方向图。
- A control flow graph (CFG) is a directed graph. 控制流程图(CFG)是一个有向图。
- The condensation of D is a directed graph with m vertices. D的凝聚图是指一个有m个顶点的有向图。
- Our approach is based on Key Features(KFs) and directed graph. 采用图的和运算,建立了零件公差模型。
- Establish the adjacency link of the no direction graph based on VC. 使用VC建立无向图的邻接表。
- If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph. 如果边都是顶点的有序对,则得到有向图和有向重图的概念。
- On the system with this file, only these two PCs will appear in chooser menus, or be allowed to connect direct. 在具有此文件的系统里，只有上述两个 PC 会显示在选择菜单中，即允许直接连接。
- You can use recursive common table expressions to find desirable paths on a directed graph. 您可以使用递归公用表表达式在定向图形上查找所需的路径。
- This paper presents an algorithm that is used to judge whether the nodal points in directed graph are reachable is. 本文给出一种判断有向连接图中节点是否可达的算法,与一般相邻矩阵的布尔代数算法相比,具有简便快速的优点。
- A multiobjective shortest path evolutionary algorithm is presented for acyclic directed graph. 提出一种无圈有向图条件下的多目标最短路径进化算法。
- The overhaul scheme was automatically completed by using depth-extent ergodic algorithm of the directed graph. 在此基础上，综合分析了电网接线结构，建立了包含检修单位、变电站、设备类型、各种用户等信息的知识库。
- By analyzing the characteristics of the enterprise document management, a model of flexible document workflow based on directed graph is introduced. 根据有向图理论,给出了公文流转信息流的处理模型。
- We can visually represent how players learn by linking our basic skill atoms together to create a directed graph of atoms called a skill chain. 通过连接基础技能原子去创造叫做技能链的原子的有向图,我们可以形象地表现玩家怎么学习。
- Based on deep knowledge, SDG (Signed Directed Graph) inference is a self-contained method to effectively diagnosis potential system failures. SDG（符号定向图）方法基于深层知识模型进行推理，是一种完备的揭示系统潜在故障的有效方法。
- In a directed graph, the decision variables of the shortest path computation must be determined by a constraint that is called Kirchoff's constraint. 摘要已知一个有向图，求解两点间的最短路径的决策变量满足基尔霍夫约束关系。
- After the circuit is abstracted as a directed graph, circuits matching problem is solved by subgraph isomorphism algorithm. 将电路抽象成有向图的数学模型后，采用了子图同构算法实现电路匹配。
