Package edu.isi.karma.modeling.alignment

Examples of edu.isi.karma.modeling.alignment.SteinerTree


      if (this.graphBuilder instanceof GraphBuilderTopK)
        topKSteinerTrees =  ((GraphBuilderTopK)this.graphBuilder).getTopKSteinerTrees(sn.getNodes(), ModelingConfiguration.getMaxCandidateModels());
      else
      {
        topKSteinerTrees = new LinkedList<DirectedWeightedMultigraph<Node, LabeledLink>>();
        SteinerTree steinerTree = new SteinerTree(
            new AsUndirectedGraph<Node, DefaultLink>(this.graphBuilder.getGraph()), Lists.newLinkedList(sn.getNodes()));
        WeightedMultigraph<Node, DefaultLink> t = steinerTree.getDefaultSteinerTree();
        TreePostProcess treePostProcess = new TreePostProcess(this.graphBuilder, t);
        if (treePostProcess.getTree() != null)
          topKSteinerTrees.add(treePostProcess.getTree());
      }
     
View Full Code Here


//        topKSteinerTrees =  ((GraphBuilderTopK)this.graphBuilder).getTopKSteinerTrees(sn.getNodes(), ModelingConfiguration.getMaxCandidateModels());
//      }
//      else
      {
        topKSteinerTrees = new LinkedList<DirectedWeightedMultigraph<Node, LabeledLink>>();
        SteinerTree steinerTree = new SteinerTree(
            new AsUndirectedGraph<Node, DefaultLink>(this.graphBuilder.getGraph()), Lists.newLinkedList(sn.getNodes()));
        WeightedMultigraph<Node, DefaultLink> t = steinerTree.getDefaultSteinerTree();
        TreePostProcess treePostProcess = new TreePostProcess(this.graphBuilder, t);
        if (treePostProcess.getTree() != null)
          topKSteinerTrees.add(treePostProcess.getTree());
      }
     
View Full Code Here

       
    logger.debug("compute the steiner tree from the alignment tree with input nodes as steiner nodes ...");
    UndirectedGraph<Node, LabeledLink> undirectedGraph =
      new AsUndirectedGraph<Node, LabeledLink>(treeModel);
    List<Node> steinerNodes = inputNodes;
    SteinerTree steinerTree = new SteinerTree(GraphUtil.asDefaultGraph(undirectedGraph), steinerNodes);
   

    Model m = new Model("inputModel");
    if (steinerTree == null || steinerTree.getLabeledSteinerTree() == null)
      return m;
   
    for (Node n : steinerTree.getLabeledSteinerTree().vertexSet()) {
     
      inputModelVertexes.add(n.getId());
     
      if (n instanceof ColumnNode || n instanceof LiteralNode)
        continue;
     
      if (vertexIdToArgument.get(n.getId()) == null)
        continue;
     
      Label classPredicate = new Label(n.getLabel().getUri(), n.getLabel().getNs(), n.getLabel().getPrefix());

      ClassAtom classAtom = new ClassAtom(classPredicate, vertexIdToArgument.get(n.getId()));
      m.getAtoms().add(classAtom);
    }
   
    for (LabeledLink e : steinerTree.getLabeledSteinerTree().edgeSet()) {

      inputModelEdges.add(e.getId());
     
      if (vertexIdToArgument.get(e.getSource().getId()) == null ||
          vertexIdToArgument.get(e.getTarget().getId()) == null)
View Full Code Here

    long start = System.currentTimeMillis();
    UndirectedGraph<Node, DefaultLink> undirectedGraph = new AsUndirectedGraph<Node, DefaultLink>(this.graphBuilder.getGraph());

    logger.debug("computing steiner tree ...");
    SteinerTree steinerTree = new SteinerTree(undirectedGraph, steinerNodeList);
    DirectedWeightedMultigraph<Node, LabeledLink> tree = new TreePostProcess(this.graphBuilder, steinerTree.getDefaultSteinerTree(), null, false).getTree();
    //(DirectedWeightedMultigraph<Node, LabeledLink>)GraphUtil.asDirectedGraph(steinerTree.getDefaultSteinerTree());

    logger.debug(GraphUtil.labeledGraphToString(tree));

    long steinerTreeElapsedTimeMillis = System.currentTimeMillis() - start;
View Full Code Here

TOP

Related Classes of edu.isi.karma.modeling.alignment.SteinerTree

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.