d:{"metadata":[["$","title","0",{"children":"Minimum Transit Cost in a Weighted Transport Network - Practice | System Overflow"}],["$","meta","1",{"name":"description","content":"Given a directed transportation network of locations connected by weighted paths, compute the minimum total transit cost to go from a given start location to a target location. Input format: first line contains three integers n m s t where n is the number of locations (0-indexed: 0..n-1), m is the number of directed paths, s is the start node, and t is the target node. The next m lines each contain three integers u v c meaning there is a directed path from u to v with transit cost c. All costs are positive integers. Output the minimum total transit cost from s to t, or -1 if t is unreachable from s. Constraints: 1 <= n <= 1000, 0 <= m <= 100000, 1 <= c <= 10000. Example Input: 5 4 0 3\\n0 1 10\\n1 2 5\\n2 3 2\\n0 3 15 Example Output: 17"}],["$","meta","2",{"name":"application-name","content":"System Overflow"}],["$","meta","3",{"name":"author","content":"System Overflow"}],["$","link","4",{"rel":"manifest","href":"/site.webmanifest","crossOrigin":"$undefined"}],["$","meta","5",{"name":"keywords","content":"System Overflow,system overflow,system design,interview preparation,FAANG+,software engineering,distributed systems,scalability,system design interview,tech interview"}],["$","meta","6",{"name":"creator","content":"System Overflow"}],["$","meta","7",{"name":"publisher","content":"System Overflow"}],["$","meta","8",{"name":"robots","content":"index, follow"}],["$","meta","9",{"name":"googlebot","content":"index, follow, max-video-preview:-1, max-image-preview:large, max-snippet:-1"}],["$","link","10",{"rel":"canonical","href":"https://www.systemoverflow.com/system-design/minimum-transit-cost-in-a-weighted-transport-network"}],["$","meta","11",{"name":"format-detection","content":"telephone=no, address=no, email=no"}],["$","meta","12",{"name":"mobile-web-app-capable","content":"yes"}],["$","meta","13",{"name":"apple-mobile-web-app-title","content":"System Overflow"}],["$","meta","14",{"name":"apple-mobile-web-app-status-bar-style","content":"black-translucent"}],["$","meta","15",{"property":"og:title","content":"Minimum Transit Cost in a Weighted Transport Network - Practice"}],["$","meta","16",{"property":"og:description","content":"Given a directed transportation network of locations connected by weighted paths, compute the minimum total transit cost to go from a given start location to a target location. Input format: first line contains three integers n m s t where n is the number of locations (0-indexed: 0..n-1), m is the number of directed paths, s is the start node, and t is the target node. The next m lines each contain three integers u v c meaning there is a directed path from u to v with transit cost c. All costs are positive integers. Output the minimum total transit cost from s to t, or -1 if t is unreachable from s. Constraints: 1 <= n <= 1000, 0 <= m <= 100000, 1 <= c <= 10000. Example Input: 5 4 0 3\\n0 1 10\\n1 2 5\\n2 3 2\\n0 3 15 Example Output: 17"}],["$","meta","17",{"property":"og:type","content":"website"}],["$","meta","18",{"name":"twitter:card","content":"summary"}],["$","meta","19",{"name":"twitter:title","content":"Minimum Transit Cost in a Weighted Transport Network - Practice"}],["$","meta","20",{"name":"twitter:description","content":"Given a directed transportation network of locations connected by weighted paths, compute the minimum total transit cost to go from a given start location to a target location. Input format: first line contains three integers n m s t where n is the number of locations (0-indexed: 0..n-1), m is the number of directed paths, s is the start node, and t is the target node. The next m lines each contain three integers u v c meaning there is a directed path from u to v with transit cost c. All costs are positive integers. Output the minimum total transit cost from s to t, or -1 if t is unreachable from s. Constraints: 1 <= n <= 1000, 0 <= m <= 100000, 1 <= c <= 10000. Example Input: 5 4 0 3\\n0 1 10\\n1 2 5\\n2 3 2\\n0 3 15 Example Output: 17"}],"$L14","$L15","$L16","$L17","$L18","$L19"],"error":null,"digest":"$undefined"}