具体地，从起始节点类型开始进行游走，不断从链路集中抽取三元组，直到到达

Specifically, it starts from the starting node type, and continuously extracts triples from the link set until the path is saved when the target node type is reached. When the path is equal to the maximum path length limit, the path is directly discarded. <br><br>Repeating this breadth has priority traversal and can get a collection of meta-paths between all initial point pairs. <br>According to the order from the starting node to the target node, all meta-paths can be merged into a hierarchical graph. <br><br>For the short-length meta-path, we simply stretch its last node to match the length of the entire path set.

Specifically, walk away from the start node type and continuously extract triples from the link set until the target node type is reached, and discard the path directly when it is equal to the maximum path length limit.<br><br>Repeated this breadth has a priority traversal to get a metapath set between all the initial point pairs.<br>All metapaths can be combined into a hierarchical graph in order from the start node to the target node.<br><br>For a shorter metapath, we simply stretch its last node to match the length of the entire path collection.

Specifically, it starts from the starting node type and extracts triples from the link set until it reaches the destination node type. When the path is equal to the maximum path length limit, the path is discarded directly.<br>Repeated this breadth first traversal, we can get the meta path set between all initial point pairs.<br>According to the order from the start node to the target node, all the meta paths can be merged into a hierarchical graph.<br>For the short Metapath, we simply stretch the last node to match the length of the whole path set.<br>