topology_graph.hpp

Go to the documentation of this file.

/*
 _____                _                    ____                 _
|_   _|__  _ __   ___ | | ___   __ _ _   _ / ___|_ __ __ _ _ __ | |__
  | |/ _ \| '_ \ / _ \| |/ _ \ / _` | | | | |  _| '__/ _` | '_ \| '_ \
  | | (_) | |_) | (_) | | (_) | (_| | |_| | |_| | | | (_| | |_) | | | |
  |_|\___/| .__/ \___/|_|\___/ \__, |\__, |\____|_|  \__,_| .__/|_| |_|
          |_|                 |___/ |___/                 |_|
 
Pure DOT-graph builder backing `mads doctor --graph` (src/main/doctor.cpp).
 
Takes an already-parsed map of `section name -> {pub_topic, sub_topic[]}` --
one entry per `mads.ini` agent section -- and returns Graphviz DOT text
describing the declared pub/sub topology. No ZMQ, no `Agent`, no file I/O:
the ini-parsing and file/stdout writing both stay in src/main/doctor.cpp,
exactly like src/topic_match.hpp (from P2), which this module reuses
directly for edge/dangling detection so the graph is faithful to the exact
matching semantics `Agent::connect_sub()` applies at runtime.
 
Author(s): Paolo Bosetti
*/
#pragma once
 
#include <map>
#include <optional>
#include <string>
#include <vector>
 
namespace Mads {
 
struct AgentTopicInfo {
  std::string pub_topic;
  std::vector<std::string> sub_topic;
  bool pub_implicit = false;
};
 
using LiveSubscriptions = std::map<std::string, int>;
 
bool is_implicitly_subscribed_topic(const std::string &topic);
 
struct GraphOptions {
  bool expand_catch_all = false;
 
  std::optional<LiveSubscriptions> live;
};
 
std::string topology_graph(const std::map<std::string, AgentTopicInfo> &agents,
                           const GraphOptions &options = {});
 
} // namespace Mads