I think in your case you want to replace graph.nodes() with graph.node_indices() to get the unique identifiers for the nodes. That being said in your example it looks like networkx's grid graph ...

NVIDIA and ArangoDB Enhance NetworkX with Accelerated Graph Analytics Rebeca Moen Sep 05, 2024 13:01 NVIDIA and ArangoDB introduce a solution to boost NetworkX performance for medium-to-large graphs ...

In the real world, graph problems naturally crop up in things like social media engagement, where a person (a node) can have many connections (or edges) to other people. Fraud detection is another ...

Supergrid graphs are first introduced by us and their structures are derived from grid and triangular-grid graphs. The Hamiltonian path problem on general supergrid graphs is a NP-complete problem. A ...