SQL Server Graph Database - shortest path using multiple edge types

Question

I have done my research on SQL Server GraphDB, but all the contrived examples I've found so far use only a single edge table. It's always Person-friend_of->Person, for example. In my case, I've created a graph of deployed software components in our datacentre, and there are different edges/relationships. Things like Application-connects_to->SqlDatabase and Server-hosts->Application.

I want to write a query that will show me the shortest path between any two nodes, regardless of the Edges used. I think if I was using Neo4j, I'd write the MATCH as something like:

Server-*->SqlDatabase Notice the asterisk.

Is there an idiomatic way to do this in SQL Server?

question from:https://stackoverflow.com/questions/66061525/sql-server-graph-database-shortest-path-using-multiple-edge-types

Answer 1

Waitting for answers