From 3e0e3d1b9e6aefcef3ebca5ee9a7b3983499253e Mon Sep 17 00:00:00 2001 From: Alyssa Travitz Date: Mon, 2 Dec 2024 11:27:02 -0800 Subject: [PATCH] switching to a note box --- .../network_planners/generators/maximal_network_generator.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/konnektor/network_planners/generators/maximal_network_generator.py b/src/konnektor/network_planners/generators/maximal_network_generator.py index 30a18d2..9a4ce44 100644 --- a/src/konnektor/network_planners/generators/maximal_network_generator.py +++ b/src/konnektor/network_planners/generators/maximal_network_generator.py @@ -27,8 +27,8 @@ def __init__( The `Transformation` s of this graph are realized as `AtomMapping` s of pairwise `Component` s. If not all mappings can be created, it will ignore the mapping failure and return a nearly fully connected graph. - Note: This approach is not recommended for Free Energy calculations in application cases, as it is - very computationally expensive. + ... note:: + This approach is not recommended for Free Energy calculations in application cases, as it is very computationally expensive. However, this approach is very important, as all other approaches use the Maximal Network as an initial solution, then remove edges to achieve the desired design.