Examples of org.mantikhor.llapi.Path

org.mantikhor.llapi.Path
kipedia.org/wiki/Path_%28graph_theory%29'>a Path in Graph theory, but is different in one specific respect: a Mantikhor path is expressed in terms of properties, arc-node pairs considered as a unit. In graph theory, the definition is made in terms of the nodes a path visits, and the arc is deemphasized except as an access coduit to the node. A Mantikhor path is restricted to the set of paths:
- That are property-simple, i.e. they do not visit any property more than once (in other words, they do not traverse any arc more than once). Note the difference from the definition of "simplicity" in graph theory TODO can we do this? seems like maybe a can o worms.
- That start with the namenode of a graph;
- That are complete, i.e. they do not terminate until they reach a terminating property, i.e., a property that fulfills one of these conditions:
  - the property value has no properties of its own;
  - the property value is the namenode;
  - the property value has properties of its own, but these properties are excluded from path inclusion by a condition of the analysis.
Paths are used to optimize and formalize the process of graph analysis. In general, a collection of paths is meaningful only within the context of a single graph. When implementing Comparable, the natural ordering of Paths is:
- First, by their start nodes;
- Then by the ordering of their Property elements, in List order. If two Paths are equal up until the end of one of them, the path that ends (when the other does not) is considered to be first in the ordering. INTENDED FOR DIRECT IMPLEMENTATION @author Bill Blondeau

        paths.toArray(arrayOfPaths);
        assertTrue(arrayOfPaths.length == this.numberOfTerminatingNodes);
        
        for (int ndx = 0; ndx < this.numberOfTerminatingNodes; ndx++)
        {
            Path path = arrayOfPaths[ndx];
            assertTrue(path.getProperties().size() == 2);
            ResourceNode resNode = path.getStartNode();
            ResourceNode nameNode = (ResourceNode)getNode(TreeImplTest.NODES.NAME_NODE_TREEI);
            assertTrue(resNode.getProperties().containsAll(nameNode.getProperties()));
            assertTrue(nameNode.getProperties().containsAll(resNode.getProperties()));
        }
    }

View Full Code Here

        Path[] arrayOfPaths = new Path[paths.size()];
        paths.toArray(arrayOfPaths);
        assertTrue(arrayOfPaths.length == 3);
        for (int ndx = 0; ndx < 3; ndx++)
        {
            Path path = arrayOfPaths[ndx];
            assertTrue(path.getProperties().size() == 1);
            ResourceNode resNode = path.getStartNode();
            ResourceNode nameNode = (ResourceNode)getNode(TreeImplTest.NODES.A);
            assertTrue(resNode.getProperties().containsAll(nameNode.getProperties()));
            assertTrue(nameNode.getProperties().containsAll(resNode.getProperties()));
        }
    }

View Full Code Here

        Path[] arrayOfPaths = new Path[paths.size()];
        paths.toArray(arrayOfPaths);
        assertTrue(arrayOfPaths.length == 3);
        for (int ndx = 0; ndx < 3; ndx++)
        {
            Path path = arrayOfPaths[ndx];
            assertTrue(path.getProperties().size() == 1);
            ResourceNode node = path.getStartNode();
            ResourceNode nameNode = (ResourceNode)getNode(TreeImplTest.NODES.C);
            assertTrue(node.getProperties().containsAll(nameNode.getProperties()));
            assertTrue(nameNode.getProperties().containsAll(node.getProperties()));
        }
    }

View Full Code Here

            for (int ndx2 = 0; ndx2 < 3; ndx2++)
            {
                List<BaseProperty> theProps = new ArrayList<BaseProperty>(2);
                theProps.add(getProperty(TreeImplTest.PROPERTIES.values()[ndx1]));
                theProps.add(getProperty(TreeImplTest.PROPERTIES.values()[start + ndx2]));
                Path aPathInTreeIII = PathImpl.newInstance(treeIII.getNamenode(), theProps);
                pathsInTreeIII.add(aPathInTreeIII);
                assertTrue(pathsTreeIII.contains(aPathInTreeIII));                
            }
        }
        
        // Can we verify that the paths in treeI are: 
        
        // [nTI, A, D], [nTI, A, E], [nTI, A, F], 
        // [nTI, B, G], [nTI, B, H], [nTI, B, I], 
        // [nTI, C, J], [nTI, C, K], [nTI, C, L]    


        List<Path> pathsInTreeI = new ArrayList<Path>(9);


        for ( int ndx1 = TreeImplTest.PROPERTIES.A.ordinal(); 
              ndx1 < TreeImplTest.PROPERTIES.C.ordinal() + 1; 
              ndx1++)
        {
            // 0 -> 3,4,5, 1 -> 6,7,8, 2 -> 9,10,11
            int start = (ndx1 + 1) * 3;
            
            for (int ndx2 = 0; ndx2 < 3; ndx2++)
            {
                List<BaseProperty> theProps = new ArrayList<BaseProperty>(2);
                theProps.add(getProperty(TreeImplTest.PROPERTIES.values()[ndx1]));
                theProps.add(getProperty(TreeImplTest.PROPERTIES.values()[start + ndx2]));
                Path aPathInTreeI = PathImpl.newInstance(treeI.getNamenode(), theProps);
                pathsInTreeI.add(aPathInTreeI);
                assertTrue(pathsTreeI.contains(aPathInTreeI));                
            }
        }

View Full Code Here

        
        // So, is the content of "this" in the other?
        //        private ResourceNode startNode;
        //        private List<BaseProperty> propertyList;
        
        Path otherAsPath = (Path)other;
        ResourceNode othersResourceNode = otherAsPath.getStartNode();
        if (!this.getStartNode().isContentContainedBy(othersResourceNode))
        {
            return false;
        }
        
        List<BaseProperty> othersProperties = otherAsPath.getProperties();
        if (!othersProperties.containsAll(this.getProperties()))
        {
            return false;
        }

View Full Code Here

TOP

Related Classes of org.mantikhor.llapi.Path

org.mantikhor.llapi.impl.PathImpl

org.mantikhor.llapi.impl.TreeImplTest

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.