code: public static boolean haveSameTransitions(MDAGNode node1, MDAGNode node2)
      {
          TreeMap<Character, MDAGNode> outgoingTransitionTreeMap1 = node1.outgoingTransitionTreeMap;
          TreeMap<Character, MDAGNode> outgoingTransitionTreeMap2 = node2.outgoingTransitionTreeMap;
          
          if(outgoingTransitionTreeMap1.size() == outgoingTransitionTreeMap2.size())
          {
              //For each _transition in outgoingTransitionTreeMap1, get the identically lableed _transition
              //in outgoingTransitionTreeMap2 (if present), and test the equality of the transitions' target nodes
              for(Entry<Character, MDAGNode> transitionKeyValuePair : outgoingTransitionTreeMap1.entrySet())
              {
                  Character currentCharKey = transitionKeyValuePair.getKey();
                  MDAGNode currentTargetNode = transitionKeyValuePair.getValue();
                  
                  if(!outgoingTransitionTreeMap2.containsKey(currentCharKey) || !outgoingTransitionTreeMap2.get(currentCharKey).equals(currentTargetNode))
                      return false;
              }
              /////
          }
          else
              return false;
          
          return true;
      }
docs: 是否含有相同的转移函数
  @param node1
  @param node2
  @return