The invention discloses a method and a device for realizing a graph node attribute memory for a shortest path problem. The graph node attribute memory comprises a plurality of graph node attribute memory units, wherein each memory unit comprises a graph node attribute initialization mechanism, a node attribute writing success mechanism and a reading success mechanism; graph node attribute initialization is carried out, a source node attribute value is initialized to be 0, and a non-source node attribute value is initialized to be positive infinity (all binary bits in a data storage area are initialized to be all 1); when the node attribute is successfully written, the writing is successful only when the attribute value of the node to be written is less than or equal to the attribute valueof the node in the memory, otherwise, the writing operation is ignored; graph node attribute reading: immediately returning node attribute data for the reading operation of the node attribute storageunit. The graph node attribute memory implementation method is realized for the shortest path problem, and the influence of random read operation on the performance is reduced.