Examples of com.google.devtools.depan.model.GraphModel

com.google.devtools.depan.model.GraphModel
Main Graph implementation. Also implements GraphBuilder, so it takes care of building the graph. This class handle all the operations related to the Graph itself. A graph is like a transition matrix (even it is not stored like that). it stores a list of nodes, and a list of edges. It also offers convenient methods to look for a node, an edge, successors and predecessors of a node given a set of relations, roots of the graph. Finally, it maintains a list of views opened for this graph, so we can apply binary operations on views easily. Node that any inserted node in the graph should be involved in at least one edge. Otherwise, it will not be saved by PersistentGraph. @author ycoppel@google.com (Yohann Coppel)

  }


  @Override
  public Object unmarshal(HierarchicalStreamReader reader,
      UnmarshallingContext context) {
    GraphModel graph = viewConverter.getGraphModel(context);
    String nodeId = reader.getValue();
    GraphNode result = (GraphNode) graph.findNode(nodeId);
    if (null == result) {
      throw new IllegalStateException(
          "Edge reference to undefined node " + nodeId);
    }
    return result;

View Full Code Here

   */
  @Override
  public Object unmarshal(HierarchicalStreamReader reader,
      UnmarshallingContext context) {
    try {
      GraphModel graph = (GraphModel) context.get(GraphModel.class);


      reader.moveDown();
      Relation relation = unmarshallRelation(reader, context);
      reader.moveUp();

View Full Code Here


    Collection<GraphEdge> edges = Lists.newArrayList();
    gizmo.addExposedEdges(edges, graph.getEdges());


    // Add the exposed components to the generated result
    GraphModel result = new GraphModel();
    GraphBuilder builder = result.getBuilder();
    for (GraphNode node : nodes) {
      builder.newNode(node);
    }
    for (GraphEdge edge : edges) {
      builder.addEdge(edge);

View Full Code Here


    // Step 1) Create the GraphModel to hold the analysis results
    // TODO(leeca): Add filters, etc.
    // TODO(leeca): Extend UI to allow lists of directories.


    GraphModel result = new GraphModel();
    DependenciesListener builder =
        new FileSystemDependencyDispatcher(result.getBuilder());


    monitor.worked(1);


    // Step 2) Read through the file system to build the analysis graph
    monitor.setTaskName("Loading file tree...");

View Full Code Here

   * Create a simple complete-5 graph, and verify that everything arrives
   * in the complete view.
   */
  @Test
  public void testBasic() {
    GraphModel testGraph = new GraphModel();
    @SuppressWarnings("unused")
    GraphNode srcNodes[] =
        TestUtils.buildComplete(testGraph, 5, SampleRelation.sampleRelation);
  }

View Full Code Here

   * the least 2 significant nodes into a collapsed node.
   */
  @Test
  public void testCollapse() {
    Collapser collapser = new Collapser();
    GraphModel testGraph = new GraphModel();
    GraphNode srcNodes[] =
        TestUtils.buildComplete(testGraph, 5, SampleRelation.sampleRelation);


    assertGraphNodesEdges(testGraph, 5, 10);

View Full Code Here

   * from step 1
   */
  @Test
  public void testNestedCollapse() {
    Collapser collapser = new Collapser();
    GraphModel testGraph = new GraphModel();
    GraphNode srcNodes[] =
        TestUtils.buildComplete(testGraph, 5, SampleRelation.sampleRelation);


    assertGraphNodesEdges(testGraph, 5, 10);

View Full Code Here

   * collapse group does not change if the input variables are altered.
   */
  @Test
  public void testDoubleCollapse() {
    Collapser collapser = new Collapser();
    GraphModel testGraph = new GraphModel();
    GraphNode srcNodes[] =
        TestUtils.buildComplete(testGraph, 5, SampleRelation.sampleRelation);


    assertGraphNodesEdges(testGraph, 5, 10);

View Full Code Here

  }


  @Test
  public void testAutoCollapse() {
    Collapser collapser = new Collapser();
    GraphModel testGraph = new GraphModel();
    GraphNode srcNodes[] =
        TestUtils.buildComplete(testGraph, 5, SampleRelation.sampleRelation);


    assertGraphNodesEdges(testGraph, 5, 10);


    MultipleDirectedRelationFinder finder =
      new MultipleDirectedRelationFinder();
    finder.addRelation(SampleRelation.sampleRelation, true, false);
    TreeModel treeData = new HierarchicalTreeModel(
        testGraph.computeSuccessorHierarchy(finder));


    @SuppressWarnings("unused")
    Collection<CollapseData> collapseChanges =
        collapser.collapseTree(testGraph, treeData);

View Full Code Here

  private GraphModel graph;
  private DependenciesListener builder;


  @Before
  public void setUp() throws Exception {
    graph = new GraphModel();
    builder = new DependenciesDispatcher(
        ElementFilter.ALL_NODES, graph.getBuilder());
  }

View Full Code Here

0 1 2

TOP

Related Classes of com.google.devtools.depan.model.GraphModel

com.google.devtools.depan.eclipse.editors.ViewDocument

com.google.devtools.depan.eclipse.persist.EdgeConverter

com.google.devtools.depan.eclipse.persist.EdgeReferenceConverter

com.google.devtools.depan.eclipse.persist.GraphModelConverter

com.google.devtools.depan.eclipse.persist.NodeReferenceConverter

com.google.devtools.depan.eclipse.wizards.NewMergedGraphWizard

com.google.devtools.depan.filesystem.builder.FileSystemTreeBuilderTest

com.google.devtools.depan.filesystem.builder.TreeBuilderTest

com.google.devtools.depan.filesystem.eclipse.NewFileSystemWizard

com.google.devtools.depan.filters.FilterTest

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.