.. _program_listing_file_src_graph_io.hpp:

Program Listing for File graph_io.hpp
=====================================

|exhale_lsh| :ref:`Return to documentation for file <file_src_graph_io.hpp>` (``src/graph_io.hpp``)

.. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS

.. code-block:: cpp

   /***
    *  $Id$
    **
    *  File: graph_io.hpp
    *  Created: May 9, 2012
    *
    *  Author: Olga Wodo, Baskar Ganapathysubramanian
    *  Copyright (c) 2012 Olga Wodo, Baskar Ganapathysubramanian
    *  Distributed under the [LICENSE].
    *  See accompanying LICENSE.
    *
    *  This file is part of GraSPI.
    */
   
   #ifndef GRAPH_IO_HPP
   #define GRAPH_IO_HPP
   
   #include <fstream>
   #include <string>
   
   #include "graspi_types.hpp"
   
   
   namespace graspi {
   
       bool output_graph(std::ostream& os,
                         graph_t* G,
                         dim_g_t& d_g,
                         vertex_colors_t& C,
                         edge_weights_t& W,
                         edge_colors_t& L){
           /*
            os << d_g.n_bulk << std::endl;
            for(int i = 0; i < (d_g.n_bulk+2); i++){
            os << i << " " << C[i] << "\t";
            int s = i;
            graspi::graph_t::adjacency_iterator u, u_end;
            graspi::edge_descriptor_t e;
            bool e_res = false;
            boost::tie(u, u_end) = boost::adjacent_vertices(s, *G);
            for (; u != u_end; ++u) {
            if ( (*u) < (d_g.n_bulk + 2) ){
            boost::tie(e, e_res) = boost::edge(s, *u, *G);
            int t = *u;
            std::pair<int,int> p
            = std::pair<int,int>(std::min(s,t),std::max(s,t) );
            os << t << " "
   
            << W[e] << " "
   
            << L[p] << "\t";
            }
            }
            os << std::endl;
            }*/
           return true;
       }
   
   
       inline bool output_graph(const std::string& name,
                                graph_t* G,
                                dim_g_t& d_g,
                                vertex_colors_t& C,
                                edge_weights_t& W,
                                edge_colors_t& L){
           std::ofstream f(name.c_str());
           if (!f) return false;
           return output_graph(f, G, d_g, C, W, L);
       }
   
       inline bool print_id_ccs(std::ofstream& os,
                                const vertex_colors_t& C,
                                const vertex_ccs_t& vCC ){
           if(!os) {
               std::cerr << "Problem with stream - ids of ccs " << std::endl;
               return false;
           }
   
           for(int i = 0; i < vCC.size(); i++){
               os << vCC[i] << " " << C[i] << std::endl;
           }
   
           return true;
       }
   
   
       inline bool print_id_ccs(const std::string& filename,
                                const vertex_colors_t& C,
                                const vertex_ccs_t& vCC ){
           std::ofstream f(filename.c_str());
           if (!f) return false;
           return print_id_ccs(f, C, vCC);
       }
   }
   
   #endif