chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md

@@ -1,22 +1,22 @@
 ---
 id: 5900f3d91000cf542c50feea
-title: 问题107：最小网络
+title: 'Problem 107: Minimal network'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301731
 dashedName: problem-107-minimal-network
 ---
 
 # --description--
 
-以下无向网络由七个顶点和十二个边组成，总权重为243。
+The following undirected network consists of seven vertices and twelve edges with a total weight of 243.
 
-相同的网络可以由下面的矩阵表示。 ABCDEFG A-161221 --- B16--1720-- C12--28-31- D211728-181923 E-20-18--11 F-3119--27 G --- 231127-但是，有可能通过删除一些边缘来优化网络，并仍然确保网络上的所有点保持连接。实现最大节省的网络如下所示。它的权重为93，比原始网络节省了243 - 93 = 150。
+The same network can be represented by the matrix below. ABCDEFG A-161221--- B16--1720-- C12--28-31- D211728-181923 E-20-18--11 F--3119--27 G---231127- However, it is possible to optimise the network by removing some edges and still ensure that all points on the network remain connected. The network which achieves the maximum saving is shown below. It has a weight of 93, representing a saving of 243 − 93 = 150 from the original network.
 
-使用network.txt（右键单击并“保存链接/目标为...”），一个6K文本文件包含一个具有四十个顶点的网络，并以矩阵形式给出，找到通过删除冗余边缘可以实现的最大节省确保网络保持连接。
+Using network.txt (right click and 'Save Link/Target As...'), a 6K text file containing a network with forty vertices, and given in matrix form, find the maximum saving which can be achieved by removing redundant edges whilst ensuring that the network remains connected.
 
 # --hints--
 
-`euler107()`应该返回259679。
+`euler107()` should return 259679.
 
 ```js
 assert.strictEqual(euler107(), 259679);