CN111460232A - Functional module searching method, device, terminal and computer readable storage medium - Google Patents
Functional module searching method, device, terminal and computer readable storage medium Download PDFInfo
- Publication number
- CN111460232A CN111460232A CN202010186611.5A CN202010186611A CN111460232A CN 111460232 A CN111460232 A CN 111460232A CN 202010186611 A CN202010186611 A CN 202010186611A CN 111460232 A CN111460232 A CN 111460232A
- Authority
- CN
- China
- Prior art keywords
- node
- topological graph
- functional modules
- functional module
- relationship
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9032—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
Abstract
The application belongs to the technical field of computers, and particularly relates to a functional module searching method, a terminal and a computer readable storage medium, wherein the functional module searching method comprises the following steps: acquiring a pre-established topological graph for recording the association relation among all the functional modules of the system; receiving a node export instruction; the node export instruction carries identification information of a target node; inquiring the topological graph according to identification information of a target node carried by the node export instruction, and outputting an associated node having an association relation with the target node corresponding to the node export instruction; when a certain functional module in the system is developed, tested or maintained, all functional modules having an association relationship with the functional module corresponding to the target node can be determined according to the output association node having an association relationship with the target node.
Description
Technical Field
The present application belongs to the field of computer technologies, and in particular, to a method, an apparatus, a terminal, and a computer-readable storage medium for searching a function module.
Background
The development of a software system generally includes the process of developing, testing or maintaining functional modules in the system.
At present, when a certain functional module in a system is developed, tested or maintained, other functional modules related to the functional module that is developed, tested or maintained at this time often need to be manually searched. The method may cause the problem of missing the function module, thereby resulting in incomplete analysis of the function module of the system and reducing the development quality of the system.
Disclosure of Invention
The embodiment of the application provides a method, a device, a terminal and a computer readable storage medium for searching a functional module, which can solve the problem that the functional module is missed to be searched when a certain functional module in a system is developed, tested or maintained.
A first aspect of the embodiments of the present application provides a method for searching a functional module, including:
acquiring a pre-established topological graph for recording the association relation among all the functional modules of the system; the nodes in the topological graph correspond to the functional modules of the system one by one; the incidence relation among the nodes in the topological graph is used for identifying the incidence relation among the functional modules of the system;
receiving a node export instruction; the node export instruction carries identification information of a target node;
and inquiring the topological graph according to the identification information of the target node carried by the node export instruction, and outputting an associated node which has an association relation with the target node corresponding to the node export instruction.
A second aspect of the embodiments of the present application provides a device for searching for a functional module, including:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a pre-established topological graph used for recording the association relationship among all the functional modules of the system; the nodes in the topological graph correspond to the functional modules of the system one by one; the incidence relation among the nodes in the topological graph is used for identifying the incidence relation among the functional modules of the system;
a receiving unit for receiving a node derivation instruction; the node export instruction carries identification information of a target node;
and the output unit is used for inquiring the topological graph according to the identification information of the target node carried by the node export instruction and outputting the associated node which has an association relation with the target node corresponding to the node export instruction.
A third aspect of the embodiments of the present application provides a terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the method when executing the computer program.
A fourth aspect of the embodiments of the present application provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the computer program implements the steps of the above method.
In a fifth aspect, embodiments of the present application provide a computer program product, which when run on a terminal device, causes the terminal device to perform the steps of the method.
In the embodiment of the application, an acquired topological graph which is established in advance and used for recording the incidence relation among all functional modules of a system is inquired according to a received node export instruction, and then an incidence node which has the incidence relation with a target node corresponding to the node export instruction is output; when a certain functional module in the system is developed, tested or maintained, all functional modules with the incidence relation with the functional module corresponding to the target node can be determined according to the output incidence nodes with the incidence relation with the target node, so that the other functional modules with the incidence relation with the functional module corresponding to the target node can be developed, tested or maintained completely, the problem that the functional module is missed to be checked, the functional module is not analyzed completely is avoided, and the development quality of the system is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments or the prior art will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and that for a person skilled in the art, other relevant drawings can be obtained from these drawings without inventive effort.
Fig. 1 is a schematic flowchart illustrating an implementation flow of a method for searching a functional module according to an embodiment of the present application;
FIG. 2a is a first schematic diagram of a block diagram provided in an embodiment of the present application;
FIG. 2b is a second schematic diagram of a block diagram provided in an embodiment of the present application;
fig. 3 is a schematic flowchart of a first implementation of establishing a topology diagram according to an embodiment of the present application;
FIG. 4 is a first schematic diagram of a topology provided by an embodiment of the present application;
fig. 5 is a schematic flowchart of a second implementation of establishing a topology diagram according to an embodiment of the present application;
FIG. 6 is a second schematic diagram of a topology provided by an embodiment of the present application;
FIG. 7 is a schematic diagram of a topology diagram requiring deduplication operations according to an embodiment of the present application;
fig. 8 is a schematic flow chart illustrating an implementation of screening associated nodes according to an embodiment of the present application;
fig. 9 is a schematic diagram of an implementation flow for establishing a node base table according to an embodiment of the present application;
FIG. 10 is a schematic diagram illustrating a flowchart of an implementation of updating a topology provided by an embodiment of the present application;
fig. 11 is a schematic structural diagram of a lookup apparatus for a functional module according to an embodiment of the present application;
fig. 12 is a schematic structural diagram of a terminal according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
The development of a software system generally includes the process of developing, testing or maintaining functional modules in the system. At present, when a certain functional module in a system is developed, tested or maintained, other functional modules related to the functional module are often manually searched, and each functional module is adaptively developed, tested or maintained one by one.
However, not only much manpower and time cost is required to manually search for other function modules related to the function module, but also the personnel responsible for development, test or maintenance is not familiar with the function module of the system due to the change of the personnel conducting development, test or maintenance or the long time from the last development, test or maintenance, so that the problem of missing and missing the function module occurs, and further the analysis on the function module of the system is incomplete, and the development quality of the system is low.
Based on this, the embodiment of the application provides a method, an apparatus, a terminal and a computer-readable storage medium for searching for a functional module, which can solve the problem of missing or missing the functional module during development, test or maintenance, and can realize comprehensive analysis of the functional module of the system, thereby improving the development quality of the system.
In order to explain the technical means of the present application, the following description will be given by way of specific examples.
Fig. 1 shows a schematic implementation flow chart of a method for searching for a functional module according to an embodiment of the present application, where the method is applied to a terminal, and can be executed by a searching device of the functional module configured on the terminal, and is suitable for a situation where development quality of a system needs to be improved, and the terminal may be a mobile phone, a computer, or a server. The searching method of the functional module may include steps 101 to 103.
The nodes in the topological graph correspond to the functional modules of the system one to one, the association relationship among the nodes in the topological graph is used for identifying the association relationship among the functional modules of the system, and the nodes with the association relationship are associated nodes with each other.
The node export instruction carries identification information of a target node, and the identification information of the target node may include a node name, a node identifier, and other identification information for identifying the node; the terminal queries the obtained topological graph according to the identification information of the target node carried by the node export instruction, and can query the target node corresponding to the node export instruction and the associated node having an association relation with the target node.
And 103, inquiring the topological graph according to the identification information of the target node carried by the node export instruction, and outputting an associated node having an association relation with the target node corresponding to the node export instruction.
Since the association relationship between the nodes of the topology map is used to identify the association relationship between the functional modules of the system, outputting an association node having an association relationship with a target node corresponding to the node export instruction is equivalent to outputting another functional module having an association relationship with the functional module corresponding to the target node.
In the embodiment of the application, an acquired topological graph which is established in advance and used for recording the incidence relation among all functional modules of a system is inquired according to a received node export instruction, and then the incidence nodes which have the incidence relation with the target nodes corresponding to the node export instruction are output; when a certain functional module in the system is developed, tested or maintained, all functional modules with the incidence relation with the functional module corresponding to the target node can be determined according to the output incidence nodes with the incidence relation with the target node, so that the other functional modules with the incidence relation with the functional module corresponding to the target node can be developed, tested or maintained completely, the problem that incomplete analysis of the functional module of the system is caused due to the fact that the functional module is missed to be checked when the functional module is found manually is solved, and the development quality of the system is improved.
In some embodiments of the present application, in order to more clearly output an association node having an association relationship with a target node corresponding to a node export instruction, and facilitate a person in charge of development, test, or maintenance to query another function module associated with a function module that is currently being developed, tested, or maintained, after the outputting an association node having an association relationship with a target node corresponding to a node export instruction, the method may include: and displaying a structural diagram marked with the target node and the associated node.
For example, as shown in fig. 2a, the structure diagram displaying the target node and the associated node may be a point line diagram, in which each point represents a node, and each line represents an association relationship between two nodes connected by the line; for another example, as shown in fig. 2b, the structure diagram showing the target node and the associated node may be a block diagram, in which each block represents a node, and each line represents an association relationship between two nodes connected by the line.
Further, the displaying the structural diagram marked with the target node and the associated node may further include displaying marking information on the structural diagram, and/or marking the nodes of the same hierarchy displayed on the structural diagram with the same color, and marking the nodes of different hierarchies displayed on the structural diagram with different colors.
For example, in the block diagram of fig. 2b, white is displayed in a frame corresponding to a node of the first hierarchy, gray is displayed in a frame corresponding to a node of the second hierarchy, and black is displayed in a frame corresponding to a node of the third hierarchy, and the block diagram of fig. 2b displays the label information 21, and the label information 21 is used for labeling the target node.
It should be noted that, the present application does not limit the representation form of the graph, and other forms of structure graphs with target nodes and associated nodes marked on the display are also applicable to the present application.
In practical applications, as shown in fig. 3, the association relationship between the functional modules of the system may include a parent-child relationship between the functional modules of the system, and the establishing of the topology map may include: step 301 to step 302.
Specifically, the obtaining of the parent-child relationship among the functional modules of the system may include: and acquiring the parent-child relationship among the functional modules of the system from the system source code according to the code logic of the system source code.
For example, the parent-child relationships between the functional modules of the system can be obtained from the system source code by calling a functional interface.
For example, as shown in fig. 4, the library management system includes a library management module, a user management module, a book management module, and other functional modules, and the terminal may obtain the information from the library management system, where the user management module is a sub-functional module of the library management module and is a parent functional module of the user registration module, the user login module, and the user information query module; the book management module is a sub-functional module of the library management module and is a parent functional module of the book information inquiry module and the book borrowing management module; … … are provided. The parent-child relationship is obtained once for each module, and finally the topological graph shown in fig. 4 can be generated. The node A corresponds to a library management module, the node B corresponds to a user management module, the node C corresponds to a book management module, the node D corresponds to a user registration module, the node E corresponds to a user login module, the node F corresponds to a user information query module, the node G corresponds to a book information query module, and the node H corresponds to a book borrowing management module.
It should be noted that different functional modules of the system may have different relationship strengths, where the magnitude of the relationship strength indicates the strength of the parent-child relationship between the two functional modules corresponding to the relationship strength; when a certain functional module in the system is developed, tested or maintained, the functional module having a parent-child relationship with the functional module but having a smaller relationship strength may not need to be developed, tested or maintained, so the topological graph may also record the relationship strength between every two functional modules having a parent-child relationship.
Therefore, as shown in fig. 5, in some embodiments of the present application, the establishing of the topology may further include: step 501 to step 502.
It should be noted that, the relationship strength between every two functional modules having a parent-child relationship may also be obtained from the system source code according to the code logic of the system source code.
For example, as shown in fig. 6, the library management system includes functional modules such as a library management module, a user management module, and a book management module, and the terminal may acquire the information in the library management system, where the user management module is a sub-functional module of the library management module, the relationship strength between the user management module and the library management module is 50%, the user management module is a parent functional module of the user registration module, the user login module, and the user information query module, and the relationship strengths between the user management module and the user registration module, the user login module, and the user information query module are 20%, 80%, and 50%, respectively; the book management module is a sub-functional module of the library management module, the relationship strength between the book management module and the library management module is 50%, the book management module is a parent functional module of the book information query module and the book borrowing management module, and the relationship strength between the book management module and the book information query module and the relationship strength between the book management module and the book borrowing management module are respectively 50% and 80%; … … are provided. And acquiring the parent-child relationship and the relationship strength between every two functional modules with the parent-child relationship for each module, and finally generating the topological graph shown in fig. 6. The node A corresponds to a library management module, the node B corresponds to a user management module, the node C corresponds to a book management module, the node D corresponds to a user registration module, the node E corresponds to a user login module, the node F corresponds to a user information query module, the node G corresponds to a book information query module, and the node H corresponds to a book borrowing management module.
It should be noted that the relationship strength between nodes connected by the parent-child relationship of multiple hierarchies may be a product of the relationship strengths corresponding to the parent-child relationship of each hierarchy.
For example, in the topology shown in fig. 6, the strength of the relationship between node D and node a is 10% of the product of 50% of the strength of the relationship between node B and node a and 20% of the strength of the relationship between node B and node D; the strength of the relationship between node E and node a is 40% of the product of the strength of the relationship between node B and node a of 50% and the strength of the relationship between node B and node E of 80%.
In order to prevent the related node having a parent-child relationship with a target node and having a small relationship strength from being output, that is, in order to prevent the related node corresponding to a functional module that does not need to be developed, tested, or maintained from being output, after the topological graph recording the relationship strength between every two functional modules having a parent-child relationship is established by the above method, the above method may include the step of outputting the related node having a relationship with the target node corresponding to the node derivation instruction: and outputting the associated nodes which have the association relationship with the target nodes corresponding to the node export instructions and the relationship strength is greater than the relationship strength threshold value.
The relationship strength between the target node and the associated node is smaller than or equal to the relationship strength threshold, which indicates that the associated relationship between the associated node and the target node is weak, and indicates that whether the functional module corresponding to the associated node is adaptively developed, tested or maintained does not affect the realization of the system function when the functional module corresponding to the target node is developed, tested or maintained, so that the associated node may not be output. The relationship strength between the target node and the associated node is greater than the relationship strength threshold value, which indicates that the associated relationship between the associated node and the target node is strong, and indicates that adaptive development, test or maintenance needs to be performed on the functional module corresponding to the associated node when the functional module corresponding to the target node is developed, tested or maintained, so as to prevent the problem that partial functions of the system cannot be realized because the functional module corresponding to the associated node which is not subjected to the adaptive development, test or maintenance is incompatible with the functional module corresponding to the target node which is subjected to the development, test or maintenance; therefore, the terminal can output the associated node which has the association relation with the target node corresponding to the node export instruction and has the relation strength larger than the relation strength threshold value, and prompt personnel in charge of development, test or maintenance to adaptively develop, test or maintain the functional module corresponding to the associated node.
For example, in the topology shown in fig. 6, the strength of the relationship between node B and node D is 20%, the strength of the relationship between node B and node E is 80%, and if the strength threshold is 50%, the output-related node includes node E but does not include node D, that is, the functional module corresponding to node E needs to be adaptively developed, tested, or maintained, and the functional module corresponding to node D does not need to be adaptively developed, tested, or maintained.
In another embodiment of the present application, the outputting an association node having an association relationship with a target node corresponding to the node export instruction may further include: and outputting the associated nodes which have the association relation with the target nodes corresponding to the node export instructions and the hierarchy of the association relation is less than or equal to the hierarchy threshold value.
The hierarchy of the incidence relation between the incidence node and the target node is greater than the hierarchy threshold value, which indicates that the incidence node is communicated with the target node through the parent-child relations of a plurality of hierarchies, at the moment, the strength of the relation between the incidence node and the target node is small, and when a functional module corresponding to the target node is developed, tested or maintained, whether the functional module corresponding to the incidence node is adaptively developed, tested or maintained has no influence on the realization of the system function, so that the incidence node can not be output; the level of the association relationship between the association node and the target node is less than or equal to the level threshold, which indicates that the association node is communicated with the target node through the parent-child relationships of a few levels, at this time, the strength of the relationship between the association node and the target node is high, and when developing, testing or maintaining a functional module corresponding to the target node, a person in charge of development, testing or maintenance needs to adaptively develop, test or maintain the functional module corresponding to the association node, so that the association node needs to be output.
For example, in the topology shown in fig. 6, if the target node carried by the node derivation instruction is node D ' and the level threshold is 2, the output associated nodes are node a ', node B ', node E ' and node F '.
In practical applications, the hierarchical threshold may be determined according to the importance degree of the function module or the requirement for accuracy and time, for example, if the target node is a node corresponding to the core function module, then in the process of developing, testing or maintaining the function module corresponding to the target node, there are many function modules corresponding to the associated nodes that need to be adaptively developed, tested or maintained and have an association relationship with the target node, so the hierarchical threshold may be larger, for example, the hierarchical threshold may be set to 5 layers, and it is ensured that the associated nodes corresponding to the function module corresponding to the target node, which have an association relationship and need to be adaptively developed, tested or maintained, are all output; for another example, if the target node is a node corresponding to an additional function module, in the process of developing, testing, or maintaining the function module corresponding to the target node, there are fewer function modules corresponding to associated nodes having an association relationship with the target node and requiring adaptive development, testing, or maintenance, and therefore, the level threshold may be small, for example, the level threshold may be set to 2 levels, thereby saving time and number for outputting associated nodes.
In some cases, a loop may occur in a topological graph used for recording parent-child relationships between functional modules of the system, and thus when outputting an associated node having an association relationship with a target node corresponding to a node export instruction and having an association relationship level less than or equal to a level threshold, the same associated node may be output multiple times.
Therefore, in some embodiments of the present application, when outputting an associated node having an association relationship with a target node corresponding to a node export instruction and having a hierarchy of the association relationship less than or equal to a hierarchy threshold, it may be further detected whether the output associated node has duplication, and if the output associated node has duplication, a deduplication operation is performed on the output associated node to obtain a final output associated node; and if the output associated node is not repeated, the output associated node is the final output associated node.
For example, in the topology shown in fig. 7, if the target node carried by the receiving node derivation instruction is node I, the distance from node I to node K is 1, 2, or 3, and if the level threshold is 3, node C is output three times, so that deduplication processing may be performed, so that the finally output associated node has uniqueness.
It should be noted that, in some embodiments of the present application, the node derivation instruction may carry a level threshold or a relationship strength threshold, and therefore, before outputting an associated node having an associated relationship with a target node corresponding to the node derivation instruction, it may be determined whether the node derivation instruction carries the level threshold or the relationship strength threshold; if the node export instruction carries a level threshold, outputting an associated node which has an association relation with a target node corresponding to the node export instruction and has a level smaller than or equal to the level threshold; if the node export instruction carries a relation strength threshold, outputting an associated node which has an associated relation with a target node corresponding to the node export instruction and has the relation strength larger than the relation strength threshold; and if the node export instruction does not carry the level threshold and the relation strength threshold, outputting all the associated nodes which have the association relation with the target node corresponding to the node export instruction.
In order to further filter the output associated nodes, as shown in fig. 8, in some embodiments of the present application, after outputting the associated node having an association relationship with the target node corresponding to the node export instruction, the method may include: steps 801 to 802.
Wherein the associated node screening instruction carries screening conditions of the associated node; specifically, the screening condition may be node information such as a node id, a node name, a node description, and a function to which the node belongs, or may be the aforementioned hierarchy threshold or relationship strength threshold.
And 802, screening the associated nodes according to the screening conditions of the associated nodes carried by the screening instruction, and outputting the screened associated nodes.
Specifically, if the screening condition is node information such as a node id, a node name, a node description, and a function to which the node belongs, a pre-established node base table may be obtained, and the associated node may be screened according to the node base table and the screening condition of the associated node carried by the screening instruction.
As shown in fig. 9, the node base table may be established after the topology map is generated, and specifically includes: step 901 to step 902.
The node information may include information such as a node identifier, a node name, a node description, and a function to which the node belongs.
Because the node base table contains the node information of each node, if the screening condition contains node information such as node id, node name, node description, node function and the like, the relevant node corresponding to the screening condition can be inquired in the node base table, so that the relevant node which does not need to be developed, tested or maintained can be screened according to the intention of a person responsible for development, testing or maintenance, and the time cost of development, testing or maintenance is saved.
After generating the topology, for example, after outputting the associated node having an association relationship with the target node corresponding to the node export instruction by the above method, a person in charge of development, test or maintenance may develop, test or maintain a functional module corresponding to the target node or a functional module corresponding to the associated node, at this time, the terminal needs to update the topology, and thus, as shown in fig. 10, in some embodiments of the present application, after generating the topology, the method may include: step 1001 to step 1002.
The update operation on the functional module of the system may include an update operation such as an operation of adding a functional module, an operation of deleting a functional module, or an operation of replacing a functional module.
And step 1002, updating the topological graph according to the updating operation.
For example, if the update operation is an operation of adding a functional module, a node corresponding to the functional module may be added to the topology map; if the updating operation is to delete a functional module, deleting a node corresponding to the functional module in the topological graph; if the operation type is replacing a functional module, a node corresponding to the functional module may be replaced with a new node in the topology.
According to the embodiment of the application, the updating operation of the functional module of the system is obtained, and the topological graph is updated according to the updating operation, that is, after the development, the test or the maintenance of the functional module corresponding to the target node or the functional module corresponding to the associated node is completed each time, the topological graph can be updated, so that the functional module of the system is developed, tested or maintained next time, the updated topological graph is obtained without re-establishing the topological graph, and the associated node having the association relation with the target node corresponding to the functional module to be developed, tested or maintained is searched in the updated topological graph.
It should be noted that, for simplicity of description, the foregoing method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts, as some steps may, in accordance with the present application, occur in other orders.
As shown in fig. 11, which is a schematic structural diagram of a lookup apparatus 1100 for a functional module according to an embodiment of the present application, the lookup apparatus 1100 for a functional module may include: acquisition section 1101, reception section 1102, and output section 1103.
An obtaining unit 1101, configured to obtain a pre-established topological graph for recording an association relationship between each functional module of the system; the nodes in the topological graph correspond to the functional modules of the system one by one; the incidence relation among the nodes in the topological graph is used for identifying the incidence relation among the functional modules of the system;
a receiving unit 1102 configured to receive a node derivation instruction; the node export instruction carries identification information of a target node;
an output unit 1103, configured to query the topology map according to the identification information of the target node carried by the node export instruction, and output an association node having an association relationship with the target node corresponding to the node export instruction.
In some embodiments of the present application, the above-mentioned searching apparatus 1100 may further include a generating unit, configured to:
acquiring parent-child relationship among all functional modules of the system;
generating the topological graph according to the parent-child relationship among the functional modules of the system;
alternatively, the first and second electrodes may be,
acquiring parent-child relationship among all functional modules of the system and relationship strength between every two functional modules with parent-child relationship;
and generating the topological graph according to the parent-child relationship among the functional modules of the system and the relationship strength between every two functional modules with the parent-child relationship.
In some embodiments of the present application, the output unit 1103 is further specifically configured to:
outputting an associated node which has an association relation with a target node corresponding to the node export instruction and has the relation strength larger than a relation strength threshold value; alternatively, the first and second electrodes may be,
and outputting the associated nodes which have association relations with the target nodes corresponding to the node export instructions and have the levels of the association relations smaller than or equal to the level threshold value.
In some embodiments of the present application, the generating unit is further specifically configured to:
acquiring node information of each node in the topological graph;
and generating a node base table containing the node information of each node according to the node information of each node in the topological graph.
In some embodiments of the present application, the searching apparatus 1100 may further include an updating unit, configured to:
acquiring an updating operation of a functional module of the system;
and updating the topological graph according to the updating operation.
In some embodiments of the present application, the searching apparatus 1100 may further include a filtering unit, configured to:
receiving a related node screening instruction; the associated node screening instruction carries screening conditions of the associated node;
and screening the associated nodes according to the screening conditions of the associated nodes carried by the screening instruction, and outputting the screened associated nodes.
In some embodiments of the present application, the searching apparatus 1100 may further include a display unit, configured to:
and displaying a structural diagram marked with the target node and the associated node.
It should be noted that, for convenience and brevity of description, the specific working process of the above-described searching apparatus 1100 for functional modules may refer to the corresponding process of the method described in fig. 1 to fig. 10, and is not described herein again.
Fig. 12 is a schematic diagram of a terminal according to an embodiment of the present application. The terminal 12 may include: a processor 120, a memory 121 and a computer program 122, such as a lookup program of functional modules, stored in said memory 121 and executable on said processor 120. The processor 120, when executing the computer program 122, implements the steps in the above-mentioned embodiments of the search method for each functional module, such as the steps 101 to 103 shown in fig. 1. Alternatively, the processor 120, when executing the computer program 122, implements the functions of each module/unit in each device embodiment described above, for example, the functions of the units 1101 to 1103 shown in fig. 11.
The computer program may be divided into one or more modules/units, which are stored in the memory 121 and executed by the processor 120 to accomplish the present application. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program in the terminal. For example, the computer program may be divided into an acquisition unit, a reception unit, and an output unit, each unit having the following specific functions: the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a pre-established topological graph used for recording the association relationship among all the functional modules of the system; the nodes in the topological graph correspond to the functional modules of the system one by one; the incidence relation among the nodes in the topological graph is used for identifying the incidence relation among the functional modules of the system; a receiving unit for receiving a node derivation instruction; the node export instruction carries identification information of a target node; and the output unit is used for inquiring the topological graph according to the identification information of the target node carried by the node export instruction and outputting the associated node which has an association relation with the target node corresponding to the node export instruction.
The terminal can be a mobile terminal such as a smart phone or a computing device such as a desktop computer, a notebook, a palm computer and a cloud server. The terminal may include, but is not limited to, a processor 120, a memory 121. Those skilled in the art will appreciate that fig. 12 is only an example of a terminal and is not intended to be limiting and may include more or fewer components than those shown, or some components may be combined, or different components, e.g., the terminal may also include input-output devices, network access devices, buses, etc.
The Processor 120 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 121 may be an internal storage unit of the terminal, such as a hard disk or a memory of the terminal. The memory 121 may also be an external storage device of the terminal, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the terminal. Further, the memory 121 may also include both an internal storage unit and an external storage device of the terminal. The memory 121 is used to store the computer program and other programs and data required by the terminal. The memory 121 may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/terminal and method may be implemented in other ways. For example, the above-described apparatus/terminal embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow in the method of the embodiments described above can be realized by a computer program, which can be stored in a computer-readable storage medium and can realize the steps of the embodiments of the methods described above when the computer program is executed by a processor. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (10)
1. A method for searching a functional module, comprising:
acquiring a pre-established topological graph for recording the association relation among all the functional modules of the system; the nodes in the topological graph correspond to the functional modules of the system one by one; the incidence relation among the nodes in the topological graph is used for identifying the incidence relation among the functional modules of the system;
receiving a node export instruction; the node export instruction carries identification information of a target node;
and inquiring the topological graph according to the identification information of the target node carried by the node export instruction, and outputting an associated node which has an association relation with the target node corresponding to the node export instruction.
2. The method according to claim 1, wherein the association relationship between the functional modules of the system includes parent-child relationship between the functional modules of the system, and the creating of the topological graph includes:
acquiring parent-child relationship among all functional modules of the system;
generating the topological graph according to the parent-child relationship among the functional modules of the system;
alternatively, the first and second electrodes may be,
acquiring parent-child relationship among all functional modules of the system and relationship strength between every two functional modules with parent-child relationship;
and generating the topological graph according to the parent-child relationship among the functional modules of the system and the relationship strength between every two functional modules with the parent-child relationship.
3. The method for searching for a functional module according to claim 2, wherein outputting an associated node having an association relationship with a target node corresponding to the node export instruction comprises:
outputting an associated node which has an association relation with a target node corresponding to the node export instruction and has the relation strength larger than a relation strength threshold value; alternatively, the first and second electrodes may be,
and outputting the associated nodes which have association relations with the target nodes corresponding to the node export instructions and have the levels of the association relations smaller than or equal to the level threshold value.
4. A method for lookup of a functional module according to claim 2 or 3 characterised in that after said generation of said topological graph it comprises:
acquiring node information of each node in the topological graph;
and generating a node base table containing the node information of each node according to the node information of each node in the topological graph.
5. A method for lookup of a functional module according to claim 2 or 3 characterised in that after said generation of said topological graph it comprises:
acquiring an updating operation of a functional module of the system;
and updating the topological graph according to the updating operation.
6. The method for searching for a functional module according to claim 1, wherein after outputting an associated node having an association relationship with a target node corresponding to the node export instruction, the method comprises:
receiving a related node screening instruction; the associated node screening instruction carries screening conditions of the associated node;
and screening the associated nodes according to the screening conditions of the associated nodes carried by the screening instruction, and outputting the screened associated nodes.
7. The method for searching for a functional module according to claim 1, wherein after outputting an associated node having an association relationship with a target node corresponding to the node export instruction, the method comprises:
and displaying a structural diagram marked with the target node and the associated node.
8. A functional module searching apparatus, comprising:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a pre-established topological graph used for recording the association relationship among all the functional modules of the system; the nodes in the topological graph correspond to the functional modules of the system one by one; the incidence relation among the nodes in the topological graph is used for identifying the incidence relation among the functional modules of the system;
a receiving unit for receiving a node derivation instruction; the node export instruction carries identification information of a target node;
and the output unit is used for inquiring the topological graph according to the identification information of the target node carried by the node export instruction and outputting the associated node which has an association relation with the target node corresponding to the node export instruction.
9. A terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any of claims 1-7 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010186611.5A CN111460232A (en) | 2020-03-17 | 2020-03-17 | Functional module searching method, device, terminal and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010186611.5A CN111460232A (en) | 2020-03-17 | 2020-03-17 | Functional module searching method, device, terminal and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111460232A true CN111460232A (en) | 2020-07-28 |
Family
ID=71680848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010186611.5A Pending CN111460232A (en) | 2020-03-17 | 2020-03-17 | Functional module searching method, device, terminal and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111460232A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113626064A (en) * | 2021-08-11 | 2021-11-09 | 北京奇艺世纪科技有限公司 | Application program management method and device |
| CN113824643A (en) * | 2021-11-25 | 2021-12-21 | 中国科学院信息工程研究所 | Ubiquitous network topological graph construction method and network security protection method |
| CN113918775A (en) * | 2021-12-09 | 2022-01-11 | 浙江中控技术股份有限公司 | Data query method and device and electronic equipment |
| WO2023045378A1 (en) * | 2021-09-24 | 2023-03-30 | 北京沃东天骏信息技术有限公司 | Method and device for recommending item information to user, storage medium, and program product |
-
2020
- 2020-03-17 CN CN202010186611.5A patent/CN111460232A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113626064A (en) * | 2021-08-11 | 2021-11-09 | 北京奇艺世纪科技有限公司 | Application program management method and device |
| WO2023045378A1 (en) * | 2021-09-24 | 2023-03-30 | 北京沃东天骏信息技术有限公司 | Method and device for recommending item information to user, storage medium, and program product |
| CN113824643A (en) * | 2021-11-25 | 2021-12-21 | 中国科学院信息工程研究所 | Ubiquitous network topological graph construction method and network security protection method |
| CN113824643B (en) * | 2021-11-25 | 2022-02-22 | 中国科学院信息工程研究所 | Ubiquitous network topological graph construction method and network security protection method |
| CN113918775A (en) * | 2021-12-09 | 2022-01-11 | 浙江中控技术股份有限公司 | Data query method and device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111460232A (en) | Functional module searching method, device, terminal and computer readable storage medium | |
| CN110554958B (en) | Graph database testing method, system, device and storage medium | |
| CN111221726A (en) | Test data generation method and device, storage medium and intelligent equipment | |
| CN111209931A (en) | Data processing method, platform, terminal device and storage medium | |
| CN112182036A (en) | Data sending and writing method and device, electronic equipment and readable storage medium | |
| CN112256318B (en) | Construction method and equipment for dependent product | |
| CN110472109B (en) | Dynamic data quality analysis method and platform system | |
| CN108255950B (en) | Data storage method and terminal equipment | |
| CN111858236B (en) | Knowledge graph monitoring method and device, computer equipment and storage medium | |
| CN109460318B (en) | Import method of rollback archive collected data, computer device and computer readable storage medium | |
| CN106557419B (en) | Program testing method and device | |
| CN114745452B (en) | Equipment management method and device and electronic equipment | |
| CN116166867A (en) | Content filtering method, device, equipment and storage medium for network acquisition | |
| CN115544132A (en) | Data import method and system and electronic equipment | |
| CN114860362A (en) | Interface updating method and device | |
| CN111309370B (en) | Version number directed graph ordering auditing method and system for multi-project multi-system environment | |
| CN113590907A (en) | Camera management method and device, electronic equipment and storage medium | |
| CN112667631A (en) | Method, device and equipment for automatically editing service field and storage medium | |
| CN107436788B (en) | Application program unloading method and device and terminal equipment | |
| CN111142965A (en) | Language configuration method and device, electronic equipment and storage medium | |
| CN112508387B (en) | Case final book examination method, device and equipment | |
| CN110765100A (en) | Label generation method and device, computer readable storage medium and server | |
| CN115208960B (en) | Protocol switching method and related equipment | |
| CN116932838B (en) | Database-based data query, update and storage method and device | |
| CN112445797B (en) | Vehicle diagnosis data reference method, device, terminal equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |