code: public void walkPath(Map<String, Double> relationMap) {
          Term term = null;
          // BEGIN先行打分
          merger(root, 0, relationMap);
          // 从第一个词开始往后打分
          for (int i = 0; i < terms.length; i++) {
              term = terms[i];
              while (term != null && term.from() != null && term != end) {
                  int to = term.toValue();
                  merger(term, to, relationMap);
                  term = term.next();
              }
          }
          optimalRoot();
      }
docs: 干涉性增加相对权重
  
  @param relationMap