3310
Solution -「LOJ #3310」丁香之路
首先有两个前置技巧：1) 两点间的最短距离就是直接连接两点的边的长度；2) 遍历一个子图的最小花费是最小生成树的边权之和乘二。原问题让我们找出一条最短且必经过钦定边的 \(( s, i )\) 路径，那么我们先将 \(\lang s , i \rang\) 连上，问题就变成了找出一条最短且必经过钦定 ......
COMP3310 Indexing a Gopher.
COMP3310 - Assignment 2: Indexing a Gopher. Background: This assignment is worth 15% of the final mark. It is due by 23:55 Wednesday 26 April AEST Lat ......
COMP3310 TCP/UDP传输协议解析
COMP3310/6331Transport Layer: TCP/UDP intro LAN linksApplications don’t know nor care. Unless there is a performance question.Getting into the transpo ......