Also the MLST command could be used to get timestamp of single remote file only.

同时，MLST命令也被用于获得单个远程文件的时间戳。

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.

最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。