Method for carrying out compression storage on adjacent matrixes of sparse directed graph
An adjacency matrix and compressed storage technology, which is applied in image coding, image data processing, instruments, etc., can solve the problem of wasting storage space by storage representation, and achieve the effects of reducing time complexity, improving performance, and saving storage space
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0064] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0065] A method for compressing and storing the adjacency matrix of the sparse directed graph, mainly using the triple table to compress and store the adjacency matrix of the sparse directed graph, and recording the first valid data in each row of the adjacency matrix in the triple The position in the group table, and then realize some application algorithms related to the graph.
[0066] The concrete implementation steps of this method are as follows:
[0067] Step 1, generate the adjacency matrix of the sparse directed graph;
[0068]The adjacency matrix of a graph is generated as follows, let G = (V, {E}) be a directed graph with n vertices and e arcs,
[0069] When the graph G is an unweighted graph with n vertices, its adjacency matrix is an n×n matrix with the following properties:
[0070]
[0071] When the graph G is a network...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com