tag:blogger.com,1999:blog-8873109125023142810.post955407632710324987..comments2017-08-17T09:40:33.062+05:30Comments on Let's Develop in Oracle: Graph Shortest Path Solution by SQLNimish Gargnoreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8873109125023142810.post-88580004181304287772016-01-14T10:26:08.556+05:302016-01-14T10:26:08.556+05:30Calculating Graph Shortest Path by SQL as referenc...Calculating Graph Shortest Path by SQL as referenced here is shown as a fixed very complex programming solution. The solution I was demonstrating uses SQL's inherent Lowest Common Ancestor (LCA) processing to inherently process concurrent multipath processing. It naturally handles any complexity automatically and breaks the processing into multiple LCAs as necessary to inherently perform the most efficient and accurate processing as described in my above slideshare article. Why this new LCA version of this inherent technology works as described above is shown below in a previous article of mine. It precisely demonstrates how and why this dynamic SQL inherent LCA processing works to always produce the most meaningful result with no programming required. I discovered this natural LCA in SQL processing occurring naturally and determined how and why this occurs inherently. Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8873109125023142810.post-6487211624155149302016-01-11T13:08:57.154+05:302016-01-11T13:08:57.154+05:30From my reading of the SQL it suggests that the pa...From my reading of the SQL it suggests that the paths are directional thus all possible paths are not tested unless there are two rows per nodal pair. That is, it seems to only be tested for a subset of "graph shortest path problem".Peter Pribnoreply@blogger.com