XML-based query languages are constructed to reach any arbitrary position within an XML document's "graph" using sequences of edge labels and delimiters representing a path.
基于XML的查询语言被构造来，使用表示路径的边标签和定界符序列达到XML文档图中的任意位置。
To the right of the graph are a set of color-coded labels and Numbers.
图的右侧是不同颜色的一组标签和数字。
The titles or labels will be displayed at the top right of the graph.
标题(即标签)显示在图形的右上角。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
Given such a graph, write a function to find all the MHTs and return a list of their root labels.
给定一个无向图，编写函数找出所有的最小高度树，并返回其根标号的列表。
Given such a graph, write a function to find all the MHTs and return a list of their root labels.
给定一个无向图，编写函数找出所有的最小高度树，并返回其根标号的列表。
应用推荐