Path Search Pruning via Adjacency Matrix Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for determining accessible paths between nodes in large network structures are inefficient and time-consuming, failing to meet the needs of real-world applications such as traffic and social network analysis.
Innovation Solution
A method and system that establish an adjacency matrix and set termination conditions based on already-sought paths to reduce repeated traversals, combined with pruning operations to reduce the search space, allowing for more efficient determination of accessible paths between nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If known techniques are used to search for all accessible paths between two nodes in a large network structure, then complete path information can be obtained, but the search process becomes inefficient and time-consuming
Solution Approach 1:
The patent performs preliminary pruning operations on the adjacency matrix before conducting the path search. By pre-identifying and removing nodes that cannot reach the destination or cannot be reached from the source, the search space is reduced in advance, eliminating unnecessary traversals and significantly decreasing search time while preserving all valid paths.
Solution Approach 2:
The patent extracts and removes irrelevant nodes from the network graph through pruning operations. Nodes that cannot contribute to any valid path between source and destination are identified and extracted from the search space, allowing the algorithm to focus only on relevant portions of the graph and reducing overall search time.
2Measurement precision
If a thorough search is performed to find all accessible paths between two nodes, then all possible paths are identified, but repeated traversals increase computational complexity
Solution Approach 1:
The patent performs preliminary pruning operations on the adjacency matrix before conducting the path search. By pre-identifying and removing nodes that cannot reach the destination or cannot be reached from the source, the search space is reduced in advance, eliminating unnecessary traversals and significantly decreasing search time while preserving all valid paths.
Solution Approach 2:
The patent applies different processing treatments to different parts of the graph. Pruned nodes are completely removed from consideration, while remaining nodes undergo detailed path exploration. This localized differentiation reduces computational complexity by avoiding uniform processing of all nodes, focusing intensive search only on relevant portions of the graph.
Data Source
AI summary
The present disclosure relates to a method, apparatus and system for determining accessible paths between two nodes. According to the method of the present disclosure, an adjacency matrix of a graph, which includes a plurality of points and edges connecting the plurality of points, is first established; then, search is made for an accessible path that can reach a destination from a starting point based on the adjacency matrix. Especially, a termination condition for the searching is set based on an already-sought path during the searching, and the corresponding search is terminated in response to the termination condition being met during the searching. With the present disclosure, it may substantially reduce repeated traversal, obvious reduce the time taken to search for accessible paths between two nodes, and significantly improve the efficiency in searching for the accessible path.