Ran formatter.

Author: JansthcirlU

tests/Mermaid.Flowcharts.Tests/FlowchartTests.cs

@@ -58,7 +58,7 @@ public void Flowchart_WhenLinkNodesExist_ShouldAddLink()
             .AddNode(n1)
             .AddNode(n2)
             .AddLink(link);
-        
+
         // Assert
         Assert.NotEmpty(flowchart.AllNodes);
         Assert.Equal(2, flowchart.AllNodes.Count());
@@ -81,7 +81,7 @@ public void Flowchart_WhenLinkNodesAreNestedButExist_ShouldAddLink()
             .AddNode(sg1.AddNode(sg1Node))
             .AddNode(sg2.AddNode(sg2Node))
             .AddLink(link);
-        
+
         // Assert
         Assert.NotEmpty(flowchart.AllNodes);
         Assert.Equal(2, flowchart.AllNodes.Count());
@@ -102,7 +102,7 @@ public void Flowchart_WhenLinkNodeIsSubgraphAndExists_ShouldAddLink()
             .AddNode(n)
             .AddNode(subgraph)
             .AddLink(link);
-        
+
         // Assert
         Assert.NotEmpty(flowchart.AllNodeChildren);
         Assert.Equal(2, flowchart.AllNodeChildren.Count());
@@ -729,7 +729,7 @@ public void Flowchart_WhenNestedLinksParentToChild_ShouldNotAddDuplicateNodes()
                 )
             .AddLink(nToSgn)
             .AddLink(sgnToSsgn);
-        
+
         string expected =
         $"""
         flowchart TD
@@ -747,7 +747,7 @@ subgraph ssg ["Subsubgraph"]
             sgn ---> ssgn
 
         """;
-        
+
         // Act
         string actual = flowchart.ToMermaidString(0, "    ");
 
@@ -779,7 +779,7 @@ public void Flowchart_WhenNestedLinksChildToParent_ShouldNotAddDuplicateNodes()
                     .AddLink(ssgnToSgn)
                 )
             .AddLink(sgnToN);
-        
+
         string expected =
         $"""
         flowchart TD
@@ -798,7 +798,7 @@ subgraph ssg ["Subsubgraph"]
             sgn ---> n
 
         """;
-        
+
         // Act
         string actual = flowchart.ToMermaidString(0, "    ");
 

tests/Mermaid.Flowcharts.Tests/SubgraphTests.cs

@@ -112,7 +112,7 @@ public void Subgraph_WhenLinkNodeIsSubgraphAndExists_ShouldAddLink()
             .AddNode(n)
             .AddNode(subsubgraph)
             .AddLink(link);
-        
+
         // Assert
         Assert.NotEmpty(subgraph.AllNodeChildren);
         Assert.Equal(2, subgraph.AllNodeChildren.Count());