Introduction This article celebrates a classic algorithm [1] of Dijkstra (1930 – 2002) which finds a path of minimal cost between any pair of nodes in an undirected graph. His procedure is widely recognized as a fundamental tool for examining communication and transportation networks (eg. Google Maps) and is surprisingly simple. By his own admission, […]
2024-01-05
8,551 reads
This article presents a way that finds a perfect match in any bipartite graph or shows why one cannot exist.
2021-09-06
2,938 reads
By Steve Jones
I’m not sure I knew identity column values could not be updated. I ran...
By Steve Jones
We had an interesting discussion about deployments in databases and how you go forward...
By ChrisJenkins
You could be tolerating limited reporting because there isn’t an off the shelf solution...
Comments posted to this topic are about the item Remotely Engineer Fabric Lakehouse objects:...
Comments posted to this topic are about the item Creating JSON III
Comments posted to this topic are about the item Testing is Becoming More Important
In a SQL Server 2025 table, called Beer, I have this data:
BeerIDBeerName 1Becks 2Fat Tire 3Mac n Jacks 4Alaskan Amber 8KirinI run this code:
SELECT JSON_OBJECTAGG(
BeerID: BeerName )
FROM beer;
What are the results? See possible answers