A Method of Decoupling Execution Order and Feedback of Logic Graph Based on Adjacency Matrix
A technology of execution order and adjacency matrix, applied in visual/graphic programming, creation/generation of source code, software design, etc., can solve the problem of not much research on software development, difficulty in covering the skills of developers, principles of relay protection and measurement and control Get involved in issues such as not deep, to achieve high efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0035] The present invention will be further described below in conjunction with the accompanying drawings.
[0036] Adjacency Matrix: It is a matrix that represents the adjacent relationship between vertices. Let G=(V,E) be a graph where V={v1,v2,...,vn}. The adjacency matrix of G is a square matrix of order n with the following properties:
[0037] ① For undirected graphs, the adjacency matrix must be symmetric, and the diagonal must be zero (only undirected simple graphs are discussed here), but this is not necessarily the case for directed graphs.
[0038] ②In an undirected graph, the degree of any vertex i is the sum of all elements in the i-th column; in a directed graph, the out-degree of a vertex i is the sum of all elements in the i-th row, and the in-degree is the sum of all elements in the i-th column of and.
[0039] The number of non-zero elements in the i-th row in the directed graph adjacency matrix is the out-degree of the i-th vertex, the number of non-ze...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


