hypergraphlib_neato.cpp

Aller à la documentation de ce fichier.

//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//  MAGiC
//####//  Jean Christophe Cuilliere et Vincent FRANCOIS
//####//  Departement de Genie Mecanique - UQTR
//####//------------------------------------------------------------
//####//  MAGIC est un projet de recherche de l equipe ERICCA
//####//  du departement de genie mecanique de l Universite du Quebec a Trois Rivieres
//####//  http://www.uqtr.ca/ericca
//####//  http://www.uqtr.ca/
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//
//####//       hypergraphlib_neato.cpp
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:53:59 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
#include <iostream>
#include <sstream>
 
#pragma hdrstop
 
#include "hypergraphlib_platform.h"
 
#include "hypergraphlib_neato.h"
#include "hypergraphlib_graph.h"
#include "hypergraphlib_node.h"
 
 
 
std::string NeatoGraph(const HypergraphLib::Graph & __G)
{/*
    std::cout << "graph 1 { ";
       std::cout << "node [ color = red ]\n";
    std::cout << std::endl;
   for (HypergraphLib::Graph::MapArcsById::const_iterator it=__G.GetArcs().begin();
         it != __G.GetArcs().end(); it++)
       {
           std::cout << "A_"<<it->first <<"[ shape=plaintext, style=filled, fillcolor=white  , width=.3, height=.3 , color=black]"<<std::endl ;
        for (HypergraphLib::Arc::MultimapNodesById::const_iterator it2=it->second->Nodes().begin();
             it2!=it->second->Nodes().end();it2++)
            {
                std::cout<< "N_"<<it2->first << " -- " << "A_"<<it->first <<" [ len=1.2  ]"<<std::endl;
            }
        std::cout << std::endl;
       }
        std::cout << std::endl;
    std::cout << "}";
        std::cout << std::endl;
*/
 
    std::ostringstream result;
    result << "graph 2 { ";
    result << std::endl;
    result << "node [ color = red ]\n";
    result << std::endl;
    for (HypergraphLib::Graph::MapNodesById::const_iterator it=__G.GetNodes().begin();
            it != __G.GetNodes().end(); it++)
    {
        for (HypergraphLib::Node::MultimapArcsById::const_iterator it2=it->second->IncidentArcs().begin();
                it2!=it->second->IncidentArcs().end();it2++)
        {
            result <<"A_"<<it2->first << " [ shape=plaintext, style=filled, fillcolor=white  , width=.3, height=.3 , color=black  ]" << std::endl;
            result<< "A_"<<it2->first << " -- " << "N_"<<it->first <<"[len=1.2]"<<std::endl;
        }
        result << std::endl;
    }
    result << std::endl;
    result << "}";
    result << std::endl;
    result << std::endl;
    return result.str();
}