SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
DotHelper.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include <iostream>
4 #include <vector>
5 
6 namespace smtrat {
7 namespace cad {
8 namespace debug {
9 
10 struct DotSubgraph {
11  std::string name;
12  std::vector<std::string> nodes;
13  DotSubgraph(const std::string& n): name(n) {}
14  void add(const std::string& n) {
15  nodes.push_back(n);
16  }
17  friend std::ostream& operator<<(std::ostream& os, const DotSubgraph& dsg) {
18  os << "subgraph " << dsg.name << " { rank = same; ";
19  for (const auto& n: dsg.nodes) {
20  os << n << "; ";
21  }
22  return os << "}";
23  }
24 };
25 
26 }
27 }
28 }
Class to create the formulas for axioms.
std::vector< std::string > nodes
Definition: DotHelper.h:12
DotSubgraph(const std::string &n)
Definition: DotHelper.h:13
void add(const std::string &n)
Definition: DotHelper.h:14
friend std::ostream & operator<<(std::ostream &os, const DotSubgraph &dsg)
Definition: DotHelper.h:17