Examples of com.jgraph.layout.hierarchical.model.JGraphHierarchyModel

Package com.jgraph.layout.hierarchical.model

Examples of com.jgraph.layout.hierarchical.model.JGraphHierarchyModel

com.jgraph.layout.hierarchical.model.JGraphHierarchyModel
Internal model of a hierarchical graph. This model stores nodes and edges equivalent to the real graph nodes and edges, but also stores the rank of the cells, the order within the ranks and the new candidate locations of cells. The internal model also reverses edge direction were appropriate , ignores self-loop and groups parallels together under one edge object.

   * @return the updated hierarchy model
   */
  public JGraphHierarchyModel run(JGraphFacade facade,
      JGraphHierarchyModel model) {
    if (model == null) {
      model = new JGraphHierarchyModel(facade);
    }
    model.initialRank();
    model.fixRanks();
    return model;
  }

View Full Code Here

    Iterator iter = hierarchyVertices.iterator();
    int i = 0;
    while (iter.hasNext()) {
      Set vertexSet = (Set)iter.next();
      
      model = new JGraphHierarchyModel(facade, vertexSet.toArray(), false, deterministic, layoutFromSinks);


      cycleStage = new JGraphMinimumCycleRemover();
      model = cycleStage.run(facade, model);
      if (model == null) {
        throw new RuntimeException(

View Full Code Here

  /**
   * 
   */
  private void feasibleTree(JGraphFacade facade, JGraphHierarchyModel model) {
    if (model == null) {
      model = new JGraphHierarchyModel(facade, facade.getVertices()
          .toArray(), false, false, true);
    }


  }

View Full Code Here

   * @return the updated hierarchy model
   */
  public JGraphHierarchyModel run(JGraphFacade facade,
      JGraphHierarchyModel model) {
    if (model == null) {
      model = new JGraphHierarchyModel(facade);
    }


    final Set seenNodes = new HashSet();
    final Set unseenNodes = new HashSet(model.getVertexMapping().values());
    // Perform a dfs through the internal model. If a cycle is found,

View Full Code Here

  public JGraphHierarchyModel run(JGraphFacade facade,
      JGraphHierarchyModel model) {
    if (model == null) {
      Object[] vertices = getOrderedVertices(facade);
      // create model using this ordering
      model = new JGraphHierarchyModel(facade, vertices, true, false, true);
    } else {
      // else we're removing the cycles in a currently constructed HM
      // TODO
      return null;
    }

View Full Code Here

TOP

Related Classes of com.jgraph.layout.hierarchical.model.JGraphHierarchyModel

com.jgraph.layout.hierarchical.JGraphGreedyCycleRemover

com.jgraph.layout.hierarchical.JGraphHierarchicalLayout

com.jgraph.layout.hierarchical.JGraphLongestPathLayering

com.jgraph.layout.hierarchical.JGraphMinimumCycleRemover

com.jgraph.layout.hierarchical.JGraphNetworkSimplexLayering

java.util.LinkedList

java.util.LinkedHashMap

java.util.HashSet

java.util.LinkedHashSet

java.util.Hashtable

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.