Examples of AbstractNode

ca.nengo.model.impl.AbstractNode
A base implementation of Node. @author Bryan Tripp
com.github.jknack.antlr4ide.ui.railroad.figures.primitives.AbstractNode
com.halware.nakedide.eclipse.ext.annot.common.AbstractNode
Common to an object spec, or to any member.
com.vividsolutions.jts.index.strtree.AbstractNode
A node of the STR tree. The children of this node are either more nodes (AbstractNodes) or real data (ItemBoundables). If this node contains real data (rather than nodes), then we say that this node is a "leaf node". @version 1.7
org.apache.batik.dom.AbstractNode
This class implements the {@link org.w3c.dom.Node} interface. @author Stephane Hillion @version $Id: AbstractNode.java,v 1.12 2002/08/14 14:12:22 hillion Exp $
org.apache.flex.forks.batik.dom.AbstractNode
This class implements the {@link org.w3c.dom.Node} interface. @author Stephane Hillion @version $Id: AbstractNode.java,v 1.19 2005/03/27 08:58:32 cam Exp $
org.apache.jetspeed.page.document.AbstractNode

AbstractNode

@author Scott T. Weaver @version $Id: AbstractNode.java,v 1.9 2005/01/25 00:56:38 rwatler Exp $
org.eclipse.xtext.nodemodel.impl.AbstractNode
org.fusesource.ide.camel.model.AbstractNode
@author lhein
org.gephi.graph.dhns.node.AbstractNode
Implementation of node with default behaviour. @author Mathieu Bastian
org.htmlparser.nodes.AbstractNode
The concrete base class for all types of nodes (tags, text remarks). This class provides basic functionality to hold the {@link Page}, the starting and ending position in the page, the parent and the list of {@link NodeList children}.
org.jboss.dashboard.ui.config.AbstractNode
org.openbp.jaspira.propertybrowser.nodes.AbstractNode
Base class for all nodes of the property browser tree. @author Erich Lauterbach
org.openide.nodes.AbstractNode
org.rascalmpl.parser.gtd.result.AbstractNode
All nodes in the resulting tree are a subtype of this class.
org.structr.core.entity.AbstractNode
Abstract base class for all node entities in structr. @author Axel Morgner @author Christian Morgner
org.woped.qualanalysis.soundness.datamodel.AbstractNode
this abstract class represents a node in a low level petri net all nodes e.g transitions, places should be extend @author Patrick Spies, Patrick Kirchgaessner, Joern Liebau, Enrico Moeller, Sebastian Fuss

Examples of org.gephi.graph.dhns.node.AbstractNode

        graph.addNode(node2);
        graph.addNode(node3);


        //Test normal edge
        graph.addEdge(node1, node2);
        AbstractNode preNode1 = (AbstractNode) node1;
        AbstractNode preNode2 = (AbstractNode) node2;


        AbstractEdge edge = preNode1.getEdgesOutTree().getItem(preNode2.getNumber());
        assertNotNull("find OUT edge", edge);
        assertTrue("contains OUT edge", preNode1.getEdgesOutTree().contains(edge));


        AbstractEdge edge2 = preNode2.getEdgesInTree().getItem(preNode1.getNumber());
        assertNotNull("find IN edge", edge);
        assertTrue("contains IN edge", preNode2.getEdgesInTree().contains(edge2));
        assertSame("edges equal", edge, edge2);
        assertEquals("edges count", 1, graph.getEdgeCount());


        //Test mutual edge add fail
        graph.addEdge(node2, node1);


        assertNull("cant find OUT edge", preNode2.getEdgesOutTree().getItem(preNode1.getNumber()));
        assertEquals("edges count", 1, graph.getEdgeCount());




        //Test factoryedge
        graph.addEdge(edge);
        assertEquals("edges count", 1, graph.getEdgeCount());


        //Test self loop
        graph.addEdge(node3, node3);


        AbstractNode preNode3 = (AbstractNode) node3;


        AbstractEdge edge3 = preNode3.getEdgesOutTree().getItem(preNode3.getNumber());
        assertNotNull("find OUT edge", edge);
        assertTrue("contains OUT edge", preNode3.getEdgesOutTree().contains(edge3));


        AbstractEdge edge4 = preNode3.getEdgesInTree().getItem(preNode3.getNumber());
        assertNotNull("find IN edge", edge);
        assertTrue("contains IN edge", preNode3.getEdgesInTree().contains(edge3));


        assertSame("edges equal", edge3, edge4);


        assertTrue("is self loop", edge3.isSelfLoop());
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        return count;
    }


    //Directed
    public int getOutDegree(Node node) {
        AbstractNode absNode = checkNode(node);
        int count = absNode.getEnabledOutDegree();
        return count;
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        int count = absNode.getEnabledOutDegree();
        return count;
    }


    public int getMutualDegree(Node node) {
        AbstractNode absNode = checkNode(node);
        int count = absNode.getEnabledMutualDegree();
        return count;
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    }


    //Directed
    public EdgeIterable getInEdges(Node node) {
        readLock();
        AbstractNode absNode = checkNode(node);
        return dhns.newEdgeIterable(new EdgeNodeIterator(absNode, EdgeNodeIterator.EdgeNodeIteratorMode.IN, false, enabledNodePredicate, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    }


    //Directed
    public EdgeIterable getOutEdges(Node node) {
        readLock();
        AbstractNode absNode = checkNode(node);
        return dhns.newEdgeIterable(new EdgeNodeIterator(absNode, EdgeNodeIterator.EdgeNodeIteratorMode.OUT, false, enabledNodePredicate, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    }


    //Graph
    public EdgeIterable getEdges(Node node) {
        readLock();
        AbstractNode absNode = checkNode(node);
        return dhns.newEdgeIterable(new EdgeNodeIterator(absNode, EdgeNodeIterator.EdgeNodeIteratorMode.BOTH, false, enabledNodePredicate, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    }


    //Graph
    public NodeIterable getNeighbors(Node node) {
        readLock();
        AbstractNode absNode = checkNode(node);
        return dhns.newNodeIterable(new NeighborIterator(new EdgeNodeIterator(absNode, EdgeNodeIterator.EdgeNodeIteratorMode.BOTH, true, enabledNodePredicate, Tautology.instance), absNode, Tautology.instance));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    //Directed
    public Edge getEdge(Node source, Node target) {
        if (source == null || target == null) {
            return null;
        }
        AbstractNode sourceNode = checkNode(source);
        AbstractNode targetNode = checkNode(target);
        AbstractEdge res = sourceNode.getEdgesOutTree().getItem(targetNode.getNumber());
        return res;
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    }


    @Test
    public void testRemoveEdge() {
        GraphFactoryImpl factory = dhnsGlobal.factory();
        AbstractNode node3 = (AbstractNode) nodeMap.get("Node 1");
        AbstractNode node4 = (AbstractNode) nodeMap.get("Node 2");
        AbstractNode node5 = (AbstractNode) nodeMap.get("Node 5");
        AbstractNode node6 = (AbstractNode) nodeMap.get("Node 6");
        AbstractEdge edge = factory.newEdge(node3, node4);


        graphGlobal.addEdge(edge);


        graphGlobal.removeEdge(edge);
        AbstractEdge edge3 = node3.getEdgesOutTree().getItem(node4.getNumber());
        assertNull("OUT null", edge3);
        assertFalse("contains OUT edge", node3.getEdgesOutTree().contains(edge));


        AbstractEdge edge4 = node4.getEdgesInTree().getItem(node3.getNumber());
        assertNull("IN null", edge4);
        assertFalse("contains IN edge", node3.getEdgesInTree().contains(edge));
        assertFalse(graphGlobal.contains(edge));


        graphGlobal.removeEdge(edgeMap.get("5-6"));


        assertNull(node5.getEdgesOutTree().getItem(node6.getNumber()));
        assertNull(node6.getEdgesOutTree().getItem(node5.getNumber()));
        assertNull(node5.getEdgesInTree().getItem(node6.getNumber()));
        assertNull(node6.getEdgesInTree().getItem(node5.getNumber()));


        AbstractNode node7 = (AbstractNode) nodeMap.get("Node 7");
        graphGlobal.removeEdge(edgeMap.get("7-7"));


        assertNull(node7.getEdgesOutTree().getItem(node7.getNumber()));
        assertNull(node7.getEdgesInTree().getItem(node7.getNumber()));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        return view.getEdgesCountEnabled() + view.getMetaEdgesCountTotal();
    }


    //Graph
    public int getDegree(Node node) {
        AbstractNode absNode = checkNode(node);
        int count = absNode.getEdgesInTree().getCount() + absNode.getEdgesOutTree().getCount();
        return count;
    }

View Full Code Here

0 1 2 3 4 5 6

TOP

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.