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

Inactive Publication Date: 2013-03-13
XI'AN POLYTECHNIC UNIVERSITY
View PDF2 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a method for compressing and storing the adjacency matrix of the sparse directed graph, which solves the problem of wasting storage space in the adjacency matrix storage representation of the sparse directed graph

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for carrying out compression storage on adjacent matrixes of sparse directed graph
  • Method for carrying out compression storage on adjacent matrixes of sparse directed graph
  • Method for carrying out compression storage on adjacent matrixes of sparse directed graph

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method for carrying out compression storage on adjacent matrixes of a sparse directed graph. The method comprises the steps of carrying out compression storage on the adjacent matrixes of the sparse directed graph by using a triple table; recording the positions of the first effective data of each row in the adjacent matrixes in the triple table to realize application algorithms of a part of related graphs. For the compression storage on the adjacent matrixes of the sparse directed graph, only the row number, the column number and the element value of each effective element in the adjacent matrixes are stored, in certain algorithms, a small space is required to store the number of effective elements of each row in the adjacent matrixes and the subscript of the first effective element of each row in the triple table. According to the method, on one hand, the advantages of the adjacent matrix representation method of the graph are kept, and on other hand, the problems of space waste when the sparse graph is represented by the adjacent matrixes are solved, the operation is simplified in certain algorithms, the time complexity of the algorithm based on the adjacent matrixes is reduced, and the software performance is effectively improved.

Description

technical field [0001] The invention belongs to the technical field of software design, and in particular relates to a method for compressing and storing an adjacency matrix of a sparse directed graph. Background technique [0002] As a nonlinear data structure, graph is widely used in many technical fields such as systems engineering, cybernetics, genetics, network technology, artificial intelligence, compilation system, software engineering, etc. Commonly used storage methods for graphs include adjacency matrix representation, adjacency list representation, adjacency multiple table representation, and cross-linked list representation. Each storage method has its own advantages and disadvantages. In practical applications, it is necessary to choose the appropriate storage according to specific problems. method. [0003] The adjacency matrix notation is a sequential storage method for graphs. Two arrays are used to represent graphs. One one-dimensional array is used to stor...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06T9/00
Inventor 高晓娟
Owner XI'AN POLYTECHNIC UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap