O'Reilly logo

Joe Celko's Trees and Hierarchies in SQL for Smarties, 2nd Edition by Joe Celko

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 12. Graphs in SQL
Generalized directed graphs are classified into nonreconvergent and reconvergent. In a reconvergent graph, multiple paths exist between at least one pair of nodes. Reconvergent graphs are either cyclic or acyclic.
Keywords: nonreconvergent, reconvergent, adjacency list model, recursive common table expressions, traveling salesman problem, adjacency matrix model, path end points, reachable nodes, edges, indegree, outdegree, source node, sink node, isolated node, internal node
The following section stresses other useful kinds of generalized directed graphs. Generalized directed graphs are classified into nonreconvergent and reconvergent. In a reconvergent graph, multiple paths exist between at least one pair of nodes. Reconvergent ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required