dot.cpp

Go to the documentation of this file.

/*
 Modular Psi - A graph tracker of the Parapsychologcal scientific development
 Copyright (C) 2005 Leonardo Stern

 This program is free software; you can redistribute it and/or modify it under
 the terms of the Common Public License Version 1.0 or (at your option) any later version.

 This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
 without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 See the Common Public License for more details.

 You should have received a copy of the Common Public License along with this program;
*/

#include "dot.hpp"
#include "dotneato.h"
#include "../edgelist.hpp"
#include <qfile.h>
#include <qregexp.h>

Dot::Dot(PropositionGraph* cl)
{
   caller = cl;
}

Dot::~Dot()
{
}

void Dot::exportDot(QString filename) 
{
        QFile file(dir + "/" + filename);
        if ( file.open( IO_WriteOnly | IO_Translate ) ) {
                QTextStream stream( &file );
                stream << "Digraph G {\r\n";
                QDictIterator<Proposition> it ( *caller );
                for( ; it.current(); ++it )      {
                        stream << it.current()->name() << "[label=\"" << it.current()->publicName() << "\"];\r\n";
                }
                EdgeList::iterator ix = caller->edges->begin();
                while ( ix != caller->edges->end()) {
                        stream << "    " << (*ix)->source()->name() << " -> " << (*ix)->target()->name() << ";\r\n";
                        ++ix;
                }
                stream << "}";
                file.close();
        }
 }

void Dot::callDot()
{
    Agraph_t* g , *prev = NULL;
    Agnode_t* s, *t;
    Agedge_t* e;
 
    // initialize graphviz
    aginit();
    
    // prepare for strict digraph 
    g = agopen ("propositions", AGDIGRAPHSTRICT);
    
    // insert nodes in graphviz
    QDictIterator<Proposition> it ( *caller );
    agnodeattr(g,"label"," ");
    agraphattr(g,"rankdir", "TB");
    agraphattr(g,"shape", " ");
    agedgeattr(g,"trust"," ");
    for( ; it.current(); ++it )          {
        s = agnode(g,(char *) it.current()->name());
        agset(s,"label",(char*) it.current()->publicName().ascii() );
    }
    if (caller->gui->orientation == 0) agset (g, "rankdir", "TB");
    else agset(g,"rankdir","LR");
   
    // insert edges in graphviz
    EdgeList::iterator ix = caller->edges->begin();
    while ( ix != caller->edges->end()) {
        s = agfindnode(g, (char *) (*ix)->source()->name());
        t = agfindnode(g, (char *) (*ix)->target()->name());
        e = agedge(g, s, t);
        agset(e,"trust",(char *) (*ix)->trustString().ascii());
        ++ix;
    }
    
    // tells graphviz to calculate nodes position and size and edges bendpoints.
    dot_layout(g);
    
     // send information back to the modularpsi
    point p;
    int h, w;
    
    // set bounds
    QPoint maxXY = QPoint(GD_bb(g).UR.x , GD_bb(g).UR.y);
    caller->checkPos(maxXY);

    //delete edges (because its faster than find and edit then or to use unique ids for edges0
    caller->clearAllEdges();
    
    // nodes    
    for (s = agfstnode(g); s; s = agnxtnode(g,s)) {
        p = ND_coord_i(s);
        h = ND_height(s) * 72;
        w = ND_width(s) * 72;
        // coordenates reffers to the node center
        caller->operator[](s->name)->center = QPoint (p.x +5, maxXY.y() - p.y +5);
        p.x = p.x - w/2;
        p.y =  maxXY.y() - p.y + h/2;
        caller->operator[](s->name)->setGeometry(p.x +5 ,p.y + 5,w,h);
        //finish edge cleanning
        caller->operator[](s->name)->outgoing->clear();
        //edges
        for (e = agfstout(g,s); e; e = agnxtout(g,e)) {
                // create edges
                Edge* E;
                E = caller->connect(s->name , e->head->name);
                E->setTrust(agget(e,"trust"));
                // get bezier control points
                splines* spl = getsplinepoints(e);
                // process each bezier;
                int ind = 0;
                for (int k = 0 ; k < spl->size ; k++) {
                        bezier* bzr = spl->list;
                        spl->list ++ ;
                        for (int b = 0 ; b < bzr->size; b++) {
                                (E)->vNodes.putPoints(ind, 1, bzr->list->x + 5, maxXY.y() - bzr->list->y + 5);
                                bzr->list++;
                                ind++;
                        }
                }
        }
    }
    agclose(g);
}