MST->MSF

Author: GomezGab

algorithms/mst.md renamed to algorithms/msf.md

@@ -1,30 +1,30 @@
 ---
-title: "Minimum Spanning Tree (MST)"
-description: "Minimum Spanning Tree (MST)"
+title: "Minimum Spanning Forest (MSF)"
+description: "Minimum Spanning Forest (MSF)"
 parent: "Algorithms"
 ---
 
-# Minimum Spanning Tree (MST)
+# Minimum Spanning Forest (MSF)
 
 ## Overview
 
-The Minimum Spanning Tree (MST) finds the relationships with minimum weights such that any weakly connected component in the graph stays connected. It treats all edges as bi-directional and ensures that any pair of nodes that previously shared a path will still share a unique path in the MST subgraph. 
+The Minimum Spanning Forest (MSF) finds the relationships with minimum weights such that any weakly connected component in the graph stays connected. It treats all edges as bi-directional and ensures that any pair of nodes that previously shared a path will still share a unique path in the MSF subgraph. 
 
-MST serves as a common algorithm in scenarios such as:
+MSF serves as a common algorithm in scenarios such as:
 - Designing a cost-effective road network connecting several cities.
 - Power Grid / Utility cost optimization.
 - Identifying redundancies in networks.
 
 ## Algorithm Details
 
-MST first assigns each node to its own component. It iteratively scans for the minimum edges linking nodes across different components and merges them, ignoring the direction of edges throughout the process. The algorithm terminates when no further merges occur, producing a collection of trees.
+MSF first assigns each node to its own component. It iteratively scans for the minimum edges linking nodes across different components and merges them, ignoring the direction of edges throughout the process. The algorithm terminates when no further merges occur, producing a collection of trees.
 
-The procedure finds a minimum or maximum weight spanning tree based on the specified `objective` and optimizes for the given `weightAttribute`. If no attribute is given, MST returns any collection of spanning trees. If any specified edges do not have the given weight attribute, or the value of the attribute is non-numeric, then they are treated as if they had infinite weight. Such an edge would only be included in the minimum spanning tree if no other edges with a valid weight attribute bridge the components it connects.
+The procedure finds a minimum or maximum weight spanning forest based on the specified `objective` and optimizes for the given `weightAttribute`. If no attribute is given, MSF returns any collection of spanning trees. If any specified edges do not have the given weight attribute, or the value of the attribute is non-numeric, then they are treated as if they had infinite weight. Such an edge would only be included in the minimum spanning tree if no other edges with a valid weight attribute bridge the components it connects.
 
 ## Syntax
 
 ```cypher
-CALL algo.mst([config])
+CALL algo.MSF([config])
 ```
 
 ### Parameters
@@ -43,7 +43,7 @@ The procedure returns a stream of records with the following fields:
 
 | Name     | Type   | Description                                   |
 |----------|--------|-----------------------------------------------|
-| `edge`   | Edge   | An edge entity which is part of the MST graph |
+| `edge`   | Edge   | An edge entity which is part of the MSF graph |
 | `weight` | Double | The weight of the Edge                        |
 
 
@@ -77,15 +77,15 @@ RETURN *
 
 Suppose you are an urban planner tasked with designing a new transportation network for a town. There are several vital buildings that must be connected by this new network. A cost estimator has already provided you with the estimated cost for some of the potential routes between these buildings.
 
-Your goal is to connect every major building with the lowest total cost, even if travel between some buildings requires multiple stops and different modes of transport. The Minimum Spanning Tree algorithm helps you achieve this by identifying the most cost-effective network.
+Your goal is to connect every major building with the lowest total cost, even if travel between some buildings requires multiple stops and different modes of transport. The Minimum Spanning Forest algorithm helps you achieve this by identifying the most cost-effective network.
 
 ![City Graph](../images/city_plan.png)
 
 ```cypher
-CALL algo.mst({weightAttribute: 'cost'}) YIELD edge, weight
+CALL algo.MSF({weightAttribute: 'cost'}) YIELD edge, weight
 ```
 
 #### Expected Results
 The algorithm would yeild the following edge objects and their weights:
 
-![City MST Graph](../images/city_mst.png)
+![City MSF Graph](../images/city_msf.png)