sql语句写算法,算出从A到C的最短距离?

 

DECLARE @T TABLE ([source] VARCHAR(1),direct VARCHAR(1),Mile INT)

INSERT INTO @T

SELECT 'A','B',20 UNION ALL

SELECT 'B','C',10 UNION ALL

SELECT 'C','D',15 UNION ALL

SELECT 'D','E',10 UNION ALL

SELECT 'E','F',5 UNION ALL

SELECT 'D','F',15 UNION ALL

SELECT 'B','D',20 UNION ALL

SELECT 'A','E',10 UNION ALL

SELECT 'A','F',15

 

--SQL查询如下:

 

;WITH Liang AS

(

    SELECT

        [source] as [from],direct AS [to],Mile

    FROM @T

    UNION ALL

    SELECT

        direct,[source],Mile

    FROM @T

),

Liang2 AS

(

    SELECT

        [from],[to],

        Mile AS totalMile,

        CAST('.'+[from]+'.'+[to]+'.' AS VARCHAR(MAX)) AS path

    FROM Liang

    UNION ALL

    SELECT

        A.[from],B.[to],

        A.totalMile+B.Mile,

        CAST(A.path+B.[to]+'.' AS VARCHAR(MAX))

    FROM Liang2 AS A

        JOIN Liang AS B

            ON CASE WHEN A.path LIKE '%.'+B.[to]+'.%'

                      THEN 1 ELSE 0 END=0

                AND A.[to]=B.[from]

),

Liang3 AS

(

    SELECT

        [from],[to],

        MIN(totalMile) AS MinMile

    FROM Liang2

    GROUP BY [from],[to]

)

SELECT B.*

FROM Liang3 AS A

  JOIN Liang2 AS B

      ON A.[from]=B.[from]

          AND A.[to]=B.[to]

          AND A.MinMile=B.totalMile

WHERE A.[from]='A'

    AND A.[to]='C'

OPTION(MAXRECURSION 0)

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值