An overly accurate description of a state machine is that it is a directed graph, consisting of a set of nodes and a corresponding set of transition functions.
关于状态机的一个极度确切的描述是它是一个有向图形，由一组节点和一组相应的转移函数组成。
Circle matrix is the algebraic description of all the resource circles in a directed graph, and equivalence reciprocally to that one of complementary set and T-characteristic vector.
回路矩阵是一个资源有向图全部资源回路的代数描述，并且它与补集及t -特征向量矩阵相互等价。
The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
应用推荐