ArrayList<Node> nodes = net.getNodesCopy();

    int size = nodes.size();

    for (int i = 0; i < size; i++) {

      Node node = (Node) nodes.get(i);

      DefaultMutableTreeNode treeNode = null;

     

      //by young

      if( getTextOutputMode() == TEXTOUTPUTMODEMODE_USE_NAME )

        treeNode = findUserObject(node.getName(), root);

      else

      if( getTextOutputMode() == TEXTOUTPUTMODEMODE_USE_DESC )

        treeNode = findUserObject(node.getDescription(), root);

     

      if (treeNode == null)

      {

        if( getTextOutputMode() == TEXTOUTPUTMODEMODE_USE_NAME )

          treeNode = new DefaultMutableTreeNode(node.getName());

        else

        if( getTextOutputMode() == TEXTOUTPUTMODEMODE_USE_DESC )

          treeNode = new DefaultMutableTreeNode(node.getDescription());

       

      

        root.add(treeNode);

      }

     

      objectsMap.put(treeNode, node);

     

      int statesSize = node.getStatesSize();

     

      Debug.println("new tree node "+ treeNode.toString() );

     

      //by Young 2011

      String strEngine = EDB.This().get("ROOT.NET_INFO.CURRENT_ENGINE").getData();

      EDBUnit BEL = EDB.This().get("ROOT.ENGINES." + strEngine + ".NODES." + node.getName() +".BEL");

      EDBUnit type = EDB.This().get("ROOT.ENGINES." + strEngine + ".NODES." + node.getName() +".INFO.TYPE");

      EDBUnit EVIDENCE = EDB.This().get("ROOT.ENGINES." + strEngine + ".NODES." + node.getName() +".EVIDENCE");

      EDBUnit EVIDENCE2 = EDB.This().get("ROOT.NODES." + node.getName() +".EVIDENCE");

      String label;

    

      if( EVIDENCE2 != null && EVIDENCE2.hasChildren() ){

        label = "EVIDENCE" + ": " + EVIDENCE2.getData();

        treeNode.add(new DefaultMutableTreeNode(label));

      }else if( EVIDENCE != null && EVIDENCE.hasChildren() ){

        label = "EVIDENCE" + ": " + EVIDENCE.getData();

        treeNode.add(new DefaultMutableTreeNode(label));

      }else{

          for (int j = 0; j < statesSize; j++) {

            //BEL.print("BEL ");

            }

            else{

              BEL = BEL.getNext();

              label = node.getStateAt(j) + ": " + nf.format(BEL.getDataByDouble().floatValue() * 100.0);

            }

 

      

    //4. create states

    for (int i = 0; i < pn.getNodeCount(); i++) {

      Node UNode = pn.getNodeAt(i);

      EDBUnit SNode = SNodes.get(UNode.getName());

     

        EDBUnit evidence = SNode.create("EVIDENCE"); 

        evidence.setData(ev);

      }

    }

     

  }

    DefaultMutableTreeNode parent =

      (DefaultMutableTreeNode) ((treeNode).getParent());

    Object obj = objectsMap.get((DefaultMutableTreeNode) parent);

    if (obj != null) {

      //Only propage description nodes

     

        if (node.getType() == Node.PROBABILISTIC_NODE_TYPE) {

         

          for (int i = 0; i < parent.getChildCount(); i++) {

            DefaultMutableTreeNode auxNode =

              (DefaultMutableTreeNode) parent.getChildAt(i);

        for(SimpleSSBNNode ssbnFindingNode: ssbn.getFindingList()){

          //Not all findings nodes are at the network.

          if(ssbnFindingNode.getProbNode()!= null){

            // extract node and finding state from the network managed by the algorithm

            String stateName = ssbnFindingNode.getState().getName();

           

            // TODO avoid usage of instanceof

            // TODO stop using static instance of DMP DB

            if ((node instanceof ContinuousNode)

                || (node instanceof GmmNodePluginStub)) {

              // findings to continuous nodes should be added directly to the DMP database.

                EDBUnit Evidence = edbNode.create("EVIDENCE");

                Evidence.setData(stateName);

            } else {

              // add discrete findings directly to the network managed by the inference algorithm

              // unfortunately, the network managed by the algorithm and the one linked to the SSBN may not be the same (because algorithm may instantiate another network)

              boolean isStateInNode = false;   // indicates if node contains the specified state (true if evidence is to a valid state)

                // check if the name of the state in the SSBN node is the same in the node in actual network managed by the algorithm

                  isStateInNode = true;

                  break;

                }

              }