Fixed table syntax

src/graph/GraphView.cpp

@@ -1115,23 +1115,25 @@ void Aidge::GraphView::insertParent(NodePtr childNode,
 }
 
 /**
- *  old    \     new   | 1 node, 1 input  | >1 node, 1 input  | 1 node, >1 inputs  | >1 node, >1 inputs
- * ----------------------------------------------------------------------------------------------------
- * 1 node, 1 input     |     trivial      |      trivial      |     broadcast      |    broadcast
- * >1 node, 1 input    |     trivial      |      trivial      |     broadcast      |    broadcast
- * 1 node, >1 inputs   |   (take first)   |   (take first)    |     same order     |       X
- * >1 node, >1 inputs  |       X          |        X          |         X          |       X
+ * Inputs conditions:
+ * |  old    \     new   | 1 node, 1 input  | >1 node, 1 input  | 1 node, >1 inputs  | >1 node, >1 inputs |
+ * | ------------------- | ---------------- | ----------------- | ------------------ | ------------------ |
+ * | 1 node, 1 input     |     trivial      |      trivial      |     broadcast      |    broadcast       |
+ * | >1 node, 1 input    |     trivial      |      trivial      |     broadcast      |    broadcast       |
+ * | 1 node, >1 inputs   |   (take first)   |   (take first)    |     same order     |       X            |
+ * | >1 node, >1 inputs  |       X          |        X          |         X          |       X            |
  * 
- *  old    \     new   | 1 node, 1 output | >1 node, 1 output | 1 node, >1 outputs | >1 node, >1 outputs
- * -----------------------------------------------------------------------------------------------------
- * 1 node, 1 output    |     trivial      |      trivial      |     take first     |       X
- * >1 node, 1 output   |     trivial      |      trivial      |     take first     |       X
- * 1 node, >1 outputs  |   (take first)   |   (take first)    |     same order     |       X
- * >1 node, >1 outputs |       X          |        X          |         X          |       X
+ * Outputs conditions:
+ * |  old    \     new   | 1 node, 1 output | >1 node, 1 output | 1 node, >1 outputs | >1 node, >1 outputs |
+ * | ------------------- | ---------------- | ----------------- | ------------------ | ------------------- |
+ * | 1 node, 1 output    |     trivial      |      trivial      |     take first     |       X             |
+ * | >1 node, 1 output   |     trivial      |      trivial      |     take first     |       X             |
+ * | 1 node, >1 outputs  |   (take first)   |   (take first)    |     same order     |       X             |
+ * | >1 node, >1 outputs |       X          |        X          |         X          |       X             |
  * 
  * Only the X cases cannot possibly be resolved deterministically with sets of node.
- * These cases are therefore forbidden for the set-based replace() interface.
- * The remaining cases are handled by the GraphView-based replace() interface.
+ * These cases are therefore forbidden for the set-based `replace()` interface.
+ * The remaining cases are handled by the GraphView-based `replace()` interface.
  * If they are not supported, the function returns false.
  */
 bool Aidge::GraphView::replace(const std::set<Aidge::NodePtr>& oldNodes, const std::set<Aidge::NodePtr>& newNodes) {