2011/1/12 Tom Lane <t...@sss.pgh.pa.us>: > This isn't particularly *useful*, maybe, but it's hardly "impossible". > And if we analyzed function dependencies in any detail, circular > dependencies among functions would be possible (and useful).
Thanks Tom for clarifying, this makes me even more motivated into implementing the "creation order"-algorithm using only sql/plpgsql and pg_depend. If you have any ideas on how to do this, in addition to reading the dependency.c and pg_dump_sort.c source code, they would be highly appreciated. Any tips on articles on graph algorithms which not only take edges (node->node) as indata, but also a "edge type" as indata (i.e. the deptype in pg_depend) would also be very useful. I have only found algorithms to do sorting on "normal" directional graphs, where all edges are threated the same. -- Best regards, Joel Jacobson Glue Finance -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
