load_digraph.H

Go to the documentation of this file.

 
/*
                          Aleph_w
 
  Data structures & Algorithms
  version 2.0.0b
  https://github.com/lrleon/Aleph-w
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2026 Leandro Rabindranath Leon
 
  Permission is hereby granted, free of charge, to any person obtaining a copy
  of this software and associated documentation files (the "Software"), to deal
  in the Software without restriction, including without limitation the rights
  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  copies of the Software, and to permit persons to whom the Software is
  furnished to do so, subject to the following conditions:
 
  The above copyright notice and this permission notice shall be included in all
  copies or substantial portions of the Software.
 
  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  SOFTWARE.
*/
 
 
#ifndef LOAD_DIGRAPH_H
#define LOAD_DIGRAPH_H
 
#include <fstream>
#include <string>
#include <tpl_graph.H>
#include <topological_sort.H>
#include <Tarjan.H>
 
namespace Aleph
{
 
using Info_Nodo = std::pair<std::string, DynDlist<std::string>>;
 
using Nodo = Graph_Node<Info_Nodo>;
 
using Arco = Graph_Arc<std::string>;
 
using Digrafo = List_Digraph<Nodo, Arco>;
 
inline void split(const std::string & text,
                  const std::string & separators,
                  DynDlist<std::string> & words)
{
  const size_t n = text.length();
  size_t start = text.find_first_not_of(separators);
 
  while (start < n)
    {
      size_t stop = text.find_first_of(separators, start);
      if (stop > n)
        stop = n;
      words.append(text.substr(start, stop - start));
      start = text.find_first_not_of(separators, stop + 1);
    }
}
 
struct Equal_Node
{
  bool operator()(const Info_Nodo & o1, const Info_Nodo & o2) const
  {
    return o1.first == o2.first;
  }
};
 
inline Digrafo::Node * search_node(Digrafo & g, const std::string & s)
{
  // Linear search by id
  for (auto it = g.get_node_it(); it.has_curr(); it.next_ne())
    {
      auto *n = it.get_curr();
      if (n->get_info().first == s)
        return n;
    }
  // Not found -> insert a node with empty fields list
  DynDlist<std::string> empty_fields;
  return g.insert_node(Info_Nodo(s, empty_fields));
}
 
constexpr size_t MIN_NODE_FIELDS = 7;
 
inline void load_digraph(Digrafo & g,
                         std::istream & nodes_input,
                         std::istream & arcs_input)
{
  std::string line;
 
  // Skip header line if present
  std::getline(nodes_input, line);
 
  while (std::getline(nodes_input, line))
    {
      DynDlist<std::string> fields;
      split(line, "|", fields);
      if (fields.size() < MIN_NODE_FIELDS)
        continue;
      g.insert_node(Info_Nodo(fields[0], fields));
    }
 
  while (std::getline(arcs_input, line))
    {
      DynDlist<std::string> nums;
      split(line, " ,", nums);
      if (nums.size() < 2)
        continue;
      g.insert_arc(search_node(g, nums[0]), search_node(g, nums[1]));
    }
}
 
 
inline bool with_power = false;
 
inline bool with_nes = false;
 
inline bool only_num = false;
 
inline bool with_class = false;
 
inline size_t font_size = 6;
 
inline bool vertical = true;
 
 
inline void generate_dot_file(Digrafo & g, std::ostream & output)
{
  output << "digraph G {\n"
         << "fontsize = " << font_size << "\n";
 
  for (Node_Iterator<Digrafo> it(g); it.has_curr(); it.next_ne())
    {
      Digrafo::Node *p = it.get_curr();
      Info_Nodo & info = p->get_info();
      output << info.first << " [color=";
      DynDlist<std::string> & fields = info.second;
      const std::string & plazo = fields[1];
      if (plazo == "cp")
        output << "Green";
      else if (plazo == "mp")
        output << "Yellow";
      else if (plazo == "lp")
        output << "Red";
 
      output << " label=\"" << info.first;
 
      if (not only_num)
        output << "\\n" << fields[6];
 
      if (with_power)
        output << "\\nP=" << fields[5];
 
      if (with_nes)
        output << "\\n" << fields[4] << "%";
 
      output << "\" ";
 
      if (with_class)
        {
          const std::string & clase = fields[2];
          if (clase == "it")
            output << " shape = box ";
          else if (clase == "ef")
            output << " shape = ellipse ";
          else if (clase == "pp")
            output << " shape = hexagon ";
        }
 
      output << "]\n";
    }
 
  Path<Digrafo> p(g);
  const bool with_cycle = Compute_Cycle_In_Digraph<Digrafo>()(g, p);
  if (with_cycle)
    {
      output << "// WARNING: Cycle detected in ";
      for (Path<Digrafo>::Iterator it(p); it.has_curr(); it.next_ne())
        {
          Info_Nodo & info = it.get_current_node_ne()->get_info();
          output << "(" << info.first << ")" << info.second[6];
          if (not it.is_in_last())
            output << "->";
        }
      output << "\n";
    }
  else
    {
      DynList<DynList<Digrafo::Node *>> ranks;
 
      Q_Topological_Sort<Digrafo>()(g, ranks);
 
      for (auto it = ranks.get_it(); it.has_curr(); it.next_ne())
        {
          DynList<Digrafo::Node *> & level = it.get_curr();
          output << "{ rank = same; \n";
          for (auto ni = level.get_it(); ni.has_curr(); ni.next_ne())
            output << ni.get_curr()->get_info().first << " ";
          output << "}\n";
        }
    }
 
  for (Arc_Iterator<Digrafo> it(g); it.has_curr(); it.next_ne())
    {
      Digrafo::Arc *a = it.get_curr();
      output << g.get_src_node(a)->get_info().first << " -> "
             << g.get_tgt_node(a)->get_info().first << "\n";
    }
 
  output << "}\n";
}
 
} // end namespace Aleph
 
// Backward compatibility: expose types and functions at global scope
using Aleph::Info_Nodo;
using Aleph::Nodo;
using Aleph::Arco;
using Aleph::Digrafo;
using Aleph::split;
using Aleph::Equal_Node;
using Aleph::search_node;
using Aleph::load_digraph;
using Aleph::generate_dot_file;
using Aleph::with_power;
using Aleph::with_nes;
using Aleph::only_num;
using Aleph::with_class;
using Aleph::font_size;
using Aleph::vertical;
using Aleph::MIN_NODE_FIELDS;
 
#endif // LOAD_DIGRAPH_H