graph_exporter.h

#ifndef GRAPH_EXPORTER_
#define GRAPH_EXPORTER_

#include <iostream>
#include <fstream>

#include "grapher.h"


template< typename GraphType >
class GraphExporter {
  private:
    std::ostream& out;
    GraphType& g_;
    
  public:

    GraphExporter(std::ostream& stream, GraphType& g) : out(stream), g_(g) {
    }    
   
    void write_graphml(GraphProperties<GraphType>* extra_properties = 0){
      out << "graphml output not implemented" << std::endl;
    }

    void write_graphviz(GraphProperties<GraphType>* extra_properties = 0) {
      out << "digraph G {" << std::endl;
    
      typename GraphType::node_iterator node = g_.node_begin();

      for(unsigned int i = 0; node != g_.node_end(); ++node, ++i) {
        // Print each node
        out << node->first+1 <<  " [label=" << node->second->name();

        // Print dependencies and dependents
        out << ", dependencies=" << node->second->dependencies()->size() << ", dependents=" << node->second->dependents()->size();

        // Print out all properties
        typename GraphType::property_map_t* properties = g_.properties().get_all_properties(node->second);
        if(properties != NULL) {
          typename GraphType::property_map_t::iterator it;
          for(it = properties->begin(); it != properties->end(); it++) {
             out << "," <<  it->first << "=" << it->second;
          }
        }

        if(extra_properties != 0) {
          properties = extra_properties->get_all_properties(node->second);
          if(properties != NULL) {
            typename GraphType::property_map_t::iterator it;
            for(it = properties->begin(); it != properties->end(); it++) {
               out << "," <<  it->first << "=" << it->second;
            }
          }
        }

        // Print the x,y position
        if(g_.has_layout())
          out << ", x=" << g_.position(node->second).first << ", y=" << g_.position(node->second).second;

        // End the line
        out << "];" << std::endl;
      }

      typename GraphType::edge_iterator eit;

      for(eit = g_.edge_begin(); eit != g_.edge_end(); ++eit) {
        out << eit->first.first+1 << "->" << eit->first.second+1
            << " [label=" << (eit->second->absolute() ? "absolute" : "relative") << "];"
            << std::endl;
            // TODO: add more edge properties here
      }

      out << "}" << std::endl;
    }

    void write_csv() {
      out << "Unfortunately CSV export not implemented yet." << std::endl;
    }
};

#endif