Examples of GraphEdge

com.google.devtools.depan.model.GraphEdge
Class representing an Edge between two Nodes. @author ycoppel@google.com (Yohann Coppel)
edu.mit.csail.sdg.alloy4graph.GraphEdge
Mutable; represents a graphical edge.
Thread Safety: Can be called only by the AWT event thread.
org.jitterbit.ui.graph.edge.GraphEdge
Represents the edge between two nodes in a graph. @author Torgil Zethson @since 2.0.0
org.locationtech.geogig.storage.GraphDatabase.GraphEdge
org.maltparserx.core.syntaxgraph.edge.GraphEdge
@author Johan Hall
weka.gui.graphvisualizer.GraphEdge
This class represents an edge in the graph @author Ashraf M. Kibriya (amk14@cs.waikato.ac.nz) @version $Revision: 1.4 $ - 23 Apr 2003 - Initial version (Ashraf M. Kibriya)

Examples of org.locationtech.geogig.storage.GraphDatabase.GraphEdge

            ancestorQueue.add(v);
            while (!ancestorQueue.isEmpty()) {
                GraphNode ancestor = ancestorQueue.poll();
                Iterator<GraphEdge> edges = ancestor.getEdges(Direction.OUT);
                while (edges.hasNext()) {
                    GraphEdge parent = edges.next();
                    GraphNode parentNode = parent.getToNode();
                    if (parentNode.getIdentifier() != ancestor.getIdentifier()) {
                        if (leftSet.contains(parentNode) || rightSet.contains(parentNode)) {
                            if (!processed.contains(parentNode)) {
                                ancestorQueue.add(parentNode);
                                processed.add(parentNode);

View Full Code Here

Examples of org.maltparserx.core.syntaxgraph.edge.GraphEdge

    setSingleHeadedConstraint(true);
    root = new Root();
    root.setBelongsToGraph(this);
    graphEdges = new TreeSet<Edge>();
    edgePool = new ObjectPoolList<Edge>() {
      protected Edge create() { return new GraphEdge(); }
      public void resetObject(Edge o) throws MaltChainedException { o.clear(); }
    };
    
    nonTerminalNodes = new TreeMap<Integer,NonTerminal>();
    nonTerminalPool = new ObjectPoolList<NonTerminal>() {

View Full Code Here

Examples of org.maltparserx.core.syntaxgraph.edge.GraphEdge

    setSingleHeadedConstraint(true);
    root = new Root();
    root.setBelongsToGraph(this);
    graphEdges = new TreeSet<Edge>();
    edgePool = new ObjectPoolList<Edge>() {
      protected Edge create() { return new GraphEdge(); }
      public void resetObject(Edge o) throws MaltChainedException { o.clear(); }
    };
    clear();
  }

View Full Code Here

Examples of org.maltparserx.core.syntaxgraph.edge.GraphEdge

    root = new Root();
    root.setBelongsToGraph(this);
    
    graphEdges = new TreeSet<Edge>();
    edgePool = new ObjectPoolList<Edge>() {
      protected Edge create() { return new GraphEdge(); }
      public void resetObject(Edge o) throws MaltChainedException { o.clear(); }
    };
    
    nonTerminalNodes = new TreeMap<Integer,NonTerminal>();
    nonTerminalPool = new ObjectPoolList<NonTerminal>() {

View Full Code Here

Examples of weka.gui.graphvisualizer.GraphEdge

    
    //Adding parents, and those edges to a node which are coming out from it
    int tmpEdges[], noOfEdgesOfNode[]=new int[m_nodes.size()];
    int noOfPrntsOfNode[]=new int[m_nodes.size()];
    for(int i=0; i<m_edges.size(); i++) {
      GraphEdge e = (GraphEdge)m_edges.elementAt(i);
      noOfEdgesOfNode[e.src]++;
      noOfPrntsOfNode[e.dest]++;
    }
    for(int i=0; i<m_edges.size(); i++) {
      GraphEdge e  = (GraphEdge)m_edges.elementAt(i);
      GraphNode n  = (GraphNode)m_nodes.elementAt(e.src);
      GraphNode n2 = (GraphNode)m_nodes.elementAt(e.dest);
      if(n.edges==null) {
        n.edges = new int[noOfEdgesOfNode[e.src]][2];
        for(int k=0; k<n.edges.length; k++)

View Full Code Here

Examples of weka.gui.graphvisualizer.GraphEdge

  
  protected void edgeStmt(StreamTokenizer tk, final int nindex)
  throws Exception {
    tk.nextToken();
    
    GraphEdge e=null;
    if(tk.ttype=='>') {
      tk.nextToken();
      if(tk.ttype=='{') {
        while(true) {
          tk.nextToken();
          if(tk.ttype=='}')
            break;
          else {
            nodeID(tk);
            e = new GraphEdge(nindex,
            m_nodes.indexOf( new GraphNode(tk.sval, null) ),
            DIRECTED);
            if( m_edges!=null && !(m_edges.contains(e)) ) {
              m_edges.addElement( e );
              //System.out.println("Added edge from "+
              //                  ((GraphNode)(m_nodes.elementAt(nindex))).ID+
              //                  " to "+
              //          ((GraphNode)(m_nodes.elementAt(e.dest))).ID);
            }
          }
        }
      }
      else {
        nodeID(tk);
        e = new GraphEdge(nindex,
        m_nodes.indexOf( new GraphNode(tk.sval, null) ),
        DIRECTED);
        if( m_edges!=null && !(m_edges.contains(e)) ) {
          m_edges.addElement( e );
          //System.out.println("Added edge from "+

View Full Code Here

Examples of weka.gui.graphvisualizer.GraphEdge

      os.write("digraph ", 0, ("digraph ").length());
      if(graphName!=null)
        os.write(graphName+" ", 0, graphName.length()+1);
      os.write("{\n", 0, ("{\n").length());
      
      GraphEdge e;
      for(int i=0; i<edges.size(); i++) {
        e = (GraphEdge) edges.elementAt(i);
        os.write(((GraphNode)nodes.elementAt(e.src)).ID, 0,
        ((GraphNode)nodes.elementAt(e.src)).ID.length());
        os.write("->", 0, ("->").length() );

View Full Code Here

Examples of weka.gui.graphvisualizer.GraphEdge

    
    //Adding parents, and those edges to a node which are coming out from it
    int tmpEdges[], noOfEdgesOfNode[]=new int[m_nodes.size()];
    int noOfPrntsOfNode[]=new int[m_nodes.size()];
    for(int i=0; i<m_edges.size(); i++) {
      GraphEdge e = (GraphEdge)m_edges.elementAt(i);
      noOfEdgesOfNode[e.src]++;
      noOfPrntsOfNode[e.dest]++;
    }
    for(int i=0; i<m_edges.size(); i++) {
      GraphEdge e  = (GraphEdge)m_edges.elementAt(i);
      GraphNode n  = (GraphNode)m_nodes.elementAt(e.src);
      GraphNode n2 = (GraphNode)m_nodes.elementAt(e.dest);
      if(n.edges==null) {
        n.edges = new int[noOfEdgesOfNode[e.src]][2];
        for(int k=0; k<n.edges.length; k++)

View Full Code Here

Examples of weka.gui.graphvisualizer.GraphEdge

  
  protected void edgeStmt(StreamTokenizer tk, final int nindex)
  throws Exception {
    tk.nextToken();
    
    GraphEdge e=null;
    if(tk.ttype=='>') {
      tk.nextToken();
      if(tk.ttype=='{') {
        while(true) {
          tk.nextToken();
          if(tk.ttype=='}')
            break;
          else {
            nodeID(tk);
            e = new GraphEdge(nindex,
            m_nodes.indexOf( new GraphNode(tk.sval, null) ),
            DIRECTED);
            if( m_edges!=null && !(m_edges.contains(e)) ) {
              m_edges.addElement( e );
              //System.out.println("Added edge from "+
              //                  ((GraphNode)(m_nodes.elementAt(nindex))).ID+
              //                  " to "+
              //          ((GraphNode)(m_nodes.elementAt(e.dest))).ID);
            }
          }
        }
      }
      else {
        nodeID(tk);
        e = new GraphEdge(nindex,
        m_nodes.indexOf( new GraphNode(tk.sval, null) ),
        DIRECTED);
        if( m_edges!=null && !(m_edges.contains(e)) ) {
          m_edges.addElement( e );
          //System.out.println("Added edge from "+

View Full Code Here

Examples of weka.gui.graphvisualizer.GraphEdge

      os.write("digraph ", 0, ("digraph ").length());
      if(graphName!=null)
        os.write(graphName+" ", 0, graphName.length()+1);
      os.write("{\n", 0, ("{\n").length());
      
      GraphEdge e;
      for(int i=0; i<edges.size(); i++) {
        e = (GraphEdge) edges.elementAt(i);
        os.write(((GraphNode)nodes.elementAt(e.src)).ID, 0,
        ((GraphNode)nodes.elementAt(e.src)).ID.length());
        os.write("->", 0, ("->").length() );

View Full Code Here

0 1 2 3

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.