例句:State, with a reason, which vertex should be chosen as the starting vertex for thealgorithm.
译文:陈述并给出原因,在这个算法中哪个顶点应该被选为起点。
例句:Use the flow chart, with a=1, to complete the table in the answer book, stating valuesto at least 6 decimal places.
译文:已知a等于1,采用这个流程图完成答题本中的表格,结果保留至少6位小数。
例句:Write down the circumstances under which a bubble sort stops.
例句:Carry out a quick sort on the numbers in the list given above to produce a list of theweights in descending order.
译文:对上述序列中的数应用快速排序,使其按重量的降序排列。
例句:You should show the result of each pass and identify your pivots clearly.
译文:你应当写出每一轮的结果,并详细标明所使用的中心点。
例句:Complete the bubble sort to produce a list of the numbers in ascending order.
例句:The above list of numbers is to be sorted into descending order.
点拨:一种搜索算法,在有序序列中取中间点进行判断。
例句:Explain why a binary search cannot be performed with the list in its present form.
译文:解释为什么当前形式下的序列没法应用二分搜索。
alphabetical /,ælfə'betikl/
例句:Use a quick sort to produce a list of these names in alphabetical order.
点拨:使用尽可能少的箱子装完给定的物品,且每箱不超容量上限。
例句:Use the first-fit bin packing algorithm to determine how the numbers listed above can bepacked into bins of size 60.
译文:采用首配装箱算法来决定上述序列中的东西该如何安置到尺寸为60的箱子里。
例句:Calculate a lower bound for the number of containers that will be needed to transportthe suitcases.
例句:Write down the nodes at which the route will start and finish.
例句·The number on each edge gives the time taken,in minutes, to travel along thecorresponding road.
译文:每一条边上的数字代表对应道路所需的时间,单位是分钟。
点拨:一个点相连的边数称为该点的度。图论中等同于degree和order。
例句 :Explain why it is not possible to draw a network with an odd number of vertices of oddvalency.
译文:解释为何没法画出一个网络,使其拥有奇数个奇点(点的度为奇数)。
例句:Determine the number of arcs that would need to be added to G to make G a completegraph with 8 vertices.
译文:若使得G变为一个8个顶点的完全图,写出需要在G中添加多少条边。
例句:State,with a reason,whether or not P-Q-R-T-Q-S is an example of a path on G.
译文:陈述并给出原因,P-Q-R-T-Q-S是否是图G中的一条路径。
例句:Explain why it is not necessary to check for cycles when using Prim's algorithm.
译文:解释为什么使用普利姆(Prim)算法时,不需要检查是否构成了回路。
例句:The weight on arc RU is now increased to a value of x.
例句:Figure 5 shows a weighted graph that contains 12 arcs and 8 vertices.
译文:图5展示了一个加权图,它包含12条边和8个顶点。
例句:Use Prim's algorithm,starting at A , to find a minimum connector for the five villages A,B, C,D and E.译文:采用普利姆(Prim)算法,从点A开始,找到连接A、B、C、D、E五个村庄的最小连接。
例句:Use Kruskal's algorithm to find a minimum spanning tree for the network.
译文:采用克鲁斯卡尔(Kruskal)算法求出这个网络的最小生成树。
例句:Starting with the minimum spanning tree in the answer book, use the shortcut method tofind an upper bound below 520 km for Mei's route.
译文:从答题本的最小生成树开始,采用捷径,使得梅伊的线路上限值低于520千米。
点拨·等同于最小生成树(minimum spanning tree)。
例句·You must clearly state the order in which you select the edges of your minimumconnector.
译文·你需要写清在构造最小连接的过程中,选取的边的顺序。
联系电话:17714381194 025-52807063
校区地址:南京市(新街口)中山东路18号国际贸易中心12楼B5