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 ...
Get Joe Celko's Trees and Hierarchies in SQL for Smarties, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
