12.2 Split Node Nested Sets Models for Graphs 231 source_node c d d d e e e dest_node e b c e b c d min_wgt 3 3 2 1 2 1 3 Doing the Dijkstra algorithm would probably execute significantly faster in a language with arrays than in SQL. 12.2 Split Node Nested Sets Models for Graphs It is also possible to load an acyclic-directed graph into a nested sets model by splitting the nodes. It is a specialized trick for a certain class of graphs, not a general method such as adjacency list model graphs. Here is a skeleton