From 46c26723fbe583a0bfbb5d0edb3b22e181e7af4b Mon Sep 17 00:00:00 2001 From: Alyssa Travitz Date: Fri, 8 Nov 2024 13:59:18 -0800 Subject: [PATCH] fixing network typo --- examples/konnektor_networks.ipynb | 2 +- .../network_planners/generators/star_network_generator.py | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/examples/konnektor_networks.ipynb b/examples/konnektor_networks.ipynb index daa2390..0048c81 100644 --- a/examples/konnektor_networks.ipynb +++ b/examples/konnektor_networks.ipynb @@ -76,7 +76,7 @@ "Next it selects in the default variant the in average best transformation score performing `Component` as the central component.\n", "Finally all Components are connected with a `Transformation` to the central `Component`\n", "\n", - "The Star Netwrok is most edge efficient, but not most graph score efficient, as it has to find a central `Component`, which usually is a compromise for all 'Component's.\n", + "The Star Network is most edge efficient, but not most graph score efficient, as it has to find a central `Component`, which usually is a compromise for all 'Component's.\n", "From a robustness point of view, the Star Network, will immediatly be disconnected if one `Transformation` fails. \n", "However the loss of `Component`s is very limited, as only one ligand is lost per `Transformation` failure." ] diff --git a/src/konnektor/network_planners/generators/star_network_generator.py b/src/konnektor/network_planners/generators/star_network_generator.py index ac74c2a..a9f6b5c 100644 --- a/src/konnektor/network_planners/generators/star_network_generator.py +++ b/src/konnektor/network_planners/generators/star_network_generator.py @@ -29,7 +29,7 @@ def __init__( Next it selects in the default variant the in average best transformation score performing `Component` as the central component. Finally all Components are connected with a `Transformation` to the central `Component` - The Star Netwrok is most edge efficient, but not most graph score efficient, as it has to find a + The Star Network is most edge efficient, but not most graph score efficient, as it has to find a central `Component`, which usually is a compromise for all 'Component's. From a robustness point of view, the Star Network, will immediatly be disconnected if one `Transformation` fails. However the loss of `Component` s is very limited, as only one ligand is lost per `Transformation` failure.