public void KKLayoutAlgorithm(
[NotNull] IBidirectionalGraph <string, Edge <string> > graph,
int maxCrossCount)
{
IDictionary <string, Size> verticesSizes = GetVerticesSizes(graph.Vertices);
var parameters = new KKLayoutParameters
{
Width = 1000,
Height = 1000
};
foreach (bool exchange in new[] { true, false })
{
parameters.ExchangeVertices = exchange;
int iteration = 0;
var algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(
graph,
parameters)
{
Rand = new Random(12345)
};
algorithm.IterationEnded += (sender, args) =>
{
Assert.LessOrEqual(args.Iteration, parameters.MaxIterations);
Assert.AreEqual(iteration++, args.Iteration);
};
LayoutResults results = ExecuteLayoutAlgorithm(algorithm, verticesSizes, true);
results.CheckResult(maxCrossCount);
}
}
public void Constructor()
{
var verticesPositions = new Dictionary <string, Point>();
var graph = new BidirectionalGraph <string, Edge <string> >();
var algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph);
AssertAlgorithmProperties(algorithm, graph);
algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph);
algorithm.IterationEnded += (sender, args) => { };
AssertAlgorithmProperties(algorithm, graph, expectedReportIterationEnd: true);
algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph);
algorithm.ProgressChanged += (sender, args) => { };
AssertAlgorithmProperties(algorithm, graph, expectedReportProgress: true);
algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph);
algorithm.IterationEnded += (sender, args) => { };
algorithm.ProgressChanged += (sender, args) => { };
AssertAlgorithmProperties(algorithm, graph, expectedReportIterationEnd: true, expectedReportProgress: true);
algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph, verticesPositions);
AssertAlgorithmProperties(algorithm, graph, verticesPositions);
var parameters = new KKLayoutParameters();
algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph, null, parameters);
AssertAlgorithmProperties(algorithm, graph, parameters: parameters);
algorithm = new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(graph, verticesPositions, parameters);
AssertAlgorithmProperties(algorithm, graph, verticesPositions, parameters: parameters);
}
public void InvalidParameters()
{
var parameters = new KKLayoutParameters();
Assert.Throws <ArgumentOutOfRangeException>(() => parameters.Width = -1);
Assert.Throws <ArgumentOutOfRangeException>(() => parameters.Height = -1);
Assert.Throws <ArgumentOutOfRangeException>(() => parameters.MaxIterations = -1);
Assert.Throws <ArgumentOutOfRangeException>(() => parameters.LengthFactor = -1);
}
/// <summary>
/// Performs the actual layout algorithm.
/// </summary>
/// <param name="graph">The object containing the graph data</param>
/// <param name="rootNode">Root node</param>
protected override void PerformLayout(GraphMapData graph, INode rootNode)
{
BidirectionalGraph <string, WeightedEdge <string> > bGraph = GraphSharpUtility.GetBidirectionalGraph(graph);
IDictionary <string, Vector> nodePositions = GraphSharpUtility.GetNodePositions(graph);
KKLayoutParameters kkLayoutParameters = new KKLayoutParameters();
KKLayoutAlgorithm <string, WeightedEdge <string>, BidirectionalGraph <string, WeightedEdge <string> > > kkLayoutAlgorithm = new KKLayoutAlgorithm <string, WeightedEdge <string>, BidirectionalGraph <string, WeightedEdge <string> > >(bGraph, nodePositions, kkLayoutParameters);
kkLayoutAlgorithm.Compute();
GraphSharpUtility.SetNodePositions(graph, kkLayoutAlgorithm.VertexPositions);
GraphSharpUtility.FSAOverlapRemoval(graph);
}
public void Constructor_Throws()
{
var verticesPositions = new Dictionary <string, Point>();
var parameters = new KKLayoutParameters();
// ReSharper disable ObjectCreationAsStatement
// ReSharper disable AssignNullToNotNullAttribute
Assert.Throws <ArgumentNullException>(
() => new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(null, parameters));
Assert.Throws <ArgumentNullException>(
() => new KKLayoutAlgorithm <string, Edge <string>, IBidirectionalGraph <string, Edge <string> > >(null, verticesPositions, parameters));
// ReSharper restore AssignNullToNotNullAttribute
// ReSharper restore ObjectCreationAsStatement
}
public SandboxChart(ImFontPtr font)
{
chartSize = new Vector2(300, 300);
KKLayoutParameters layoutParams = new KKLayoutParameters()
{
Height = chartSize.Y - (2 * padding),
Width = chartSize.X - (2 * padding),
LengthFactor = 1,
DisconnectedMultiplier = 2,
ExchangeVertices = true
};
layout = new GraphShape.Algorithms.Layout.KKLayoutAlgorithm <ItemNode, Edge <ItemNode>, BidirectionalGraph <ItemNode, Edge <ItemNode> > >(sbgraph, parameters: layoutParams);
layout.Compute();
}
public void Clone()
{
var parameters = new KKLayoutParameters();
var clonedParameters = (KKLayoutParameters)parameters.Clone();
Assert.AreEqual(parameters, clonedParameters);
parameters = new KKLayoutParameters();
parameters.Width = 400;
parameters.Height = 400;
parameters.MaxIterations = 250;
parameters.K = 2;
parameters.ExchangeVertices = true;
parameters.LengthFactor = 5;
parameters.DisconnectedMultiplier = 0.6;
clonedParameters = (KKLayoutParameters)parameters.Clone();
Assert.AreEqual(parameters, clonedParameters);
}
public void RefineLayout(int iterations)
{
// Prepare state for algorithm.
BidirectionalGraph <string, IEdge <string> > graph
= new BidirectionalGraph <string, IEdge <string> >(false);
Dictionary <string, Point> positions
= new Dictionary <string, Point>();
// Anything to do?
if (BayesianNetwork.VariablesOrdered.Any() == false)
{
this.Positions = new Dictionary <string, Point>();
IterationCount += iterations;
return;
}
Random random = new Random(0);
foreach (var rv in BayesianNetwork.VariablesOrdered)
{
graph.AddVertex(rv.Name);
foreach (var child
in rv.Children.Select(c => BayesianNetwork.GetVariable(c)))
{
graph.AddVertex(child.Name);
graph.AddEdge(new Edge <string>(rv.Name, child.Name));
}
// If we have no existing layout yet, lets try to prime the
// alg by putting pure parents at top and pure children at
// bottom.
if (Positions.Count != 0)
{
// We have existing layout. Start with it but add slight
// randomness.
Point positionNoised;
if (Positions.ContainsKey(rv.Name))
{
positionNoised = Positions[rv.Name];
}
else
{
positionNoised = new Point();
}
positionNoised.X += (random.NextDouble() - 0.5) * 0.01;
positionNoised.Y += (random.NextDouble() - 0.5) * 0.01;
positions[rv.Name] = positionNoised;
}
}
// Initialize algorithm.
var layoutAlgorithms
= new StandardLayoutAlgorithmFactory <string, IEdge <string>, IBidirectionalGraph <string, IEdge <string> > >();
var layoutContext = new LayoutContext <string, IEdge <string>, IBidirectionalGraph <string, IEdge <string> > >(
graph,
positions,
_sizes,
LayoutMode.Simple);
ILayoutAlgorithm <string, IEdge <string>, IBidirectionalGraph <string, IEdge <string> > > layoutAlgorithm;
var algorithm = this._options.Algorithm;
// Hack: SugiyamaEfficient breaks if no edges.
if (algorithm == NetworkLayoutOptions.AlgorithmEnum.KK || graph.Edges.Count() == 0)
{
var layoutParameters = new KKLayoutParameters();
layoutParameters.Height = 1000;
layoutParameters.Width = 1000;
layoutParameters.MaxIterations = iterations;
layoutParameters.LengthFactor = 1.35;
layoutParameters.K *= 10.1;
layoutParameters.AdjustForGravity = false;
layoutAlgorithm = layoutAlgorithms.CreateAlgorithm("KK", layoutContext, layoutParameters);
}
else if (algorithm == NetworkLayoutOptions.AlgorithmEnum.SugiyamaEfficient)
{
var layoutParameters = new EfficientSugiyamaLayoutParameters();
layoutParameters.MinimizeEdgeLength = true;
layoutParameters.OptimizeWidth = true;
layoutParameters.WidthPerHeight = 1.65;
layoutParameters.VertexDistance = this._options.NodeSeparationTarget;
layoutParameters.LayerDistance = 5.0;
layoutAlgorithm = layoutAlgorithms.CreateAlgorithm("EfficientSugiyama", layoutContext, layoutParameters);
}
else if (algorithm == NetworkLayoutOptions.AlgorithmEnum.Sugiyama)
{
var layoutParameters = new SugiyamaLayoutParameters();
layoutParameters.MaxWidth = 1024;
layoutParameters.VerticalGap = 1.0f;
layoutParameters.DirtyRound = true;
layoutAlgorithm = layoutAlgorithms.CreateAlgorithm("Sugiyama", layoutContext, layoutParameters);
}
else if (algorithm == NetworkLayoutOptions.AlgorithmEnum.CompoundFDP)
{
var layoutParameters = new CompoundFDPLayoutParameters();
layoutParameters.GravitationFactor = 0.8;
layoutParameters.IdealEdgeLength = 30;
layoutParameters.RepulsionConstant = 300;
layoutAlgorithm = layoutAlgorithms.CreateAlgorithm("CompoundFDP", layoutContext, layoutParameters);
}
else
{
throw new InvalidOperationException("Unknown layout.");
}
// Compute.
layoutAlgorithm.Compute();
// Store Results.
this.Positions
= layoutAlgorithm.VertexPositions.ToDictionary(
(kvp) => kvp.Key,
(kvp) => kvp.Value
);
// Done.
IterationCount += iterations;
}
public void ParameterRaise()
{
string expectedPropertyName = null;
var parameters = new KKLayoutParameters();
parameters.PropertyChanged += (sender, args) =>
{
// ReSharper disable AccessToModifiedClosure
if (expectedPropertyName is null)
{
Assert.Fail("Must not raise.");
}
else
{
Assert.AreEqual(expectedPropertyName, args.PropertyName);
}
// ReSharper restore AccessToModifiedClosure
};
parameters.Width = 300;
expectedPropertyName = nameof(KKLayoutParameters.Width);
parameters.Width = 400;
expectedPropertyName = null;
parameters.Height = 300;
expectedPropertyName = nameof(KKLayoutParameters.Height);
parameters.Height = 400;
expectedPropertyName = null;
parameters.MaxIterations = 200;
expectedPropertyName = nameof(KKLayoutParameters.MaxIterations);
parameters.MaxIterations = 400;
expectedPropertyName = null;
parameters.K = 1;
expectedPropertyName = nameof(KKLayoutParameters.K);
parameters.K = 2;
expectedPropertyName = null;
parameters.ExchangeVertices = false;
expectedPropertyName = nameof(KKLayoutParameters.ExchangeVertices);
parameters.ExchangeVertices = true;
expectedPropertyName = null;
parameters.LengthFactor = 1;
expectedPropertyName = nameof(KKLayoutParameters.LengthFactor);
parameters.LengthFactor = 2;
expectedPropertyName = null;
parameters.DisconnectedMultiplier = 0.5;
expectedPropertyName = nameof(KKLayoutParameters.DisconnectedMultiplier);
parameters.DisconnectedMultiplier = 0.6;
}
void tst_but_gen_Click(object sender, RoutedEventArgs e)
{
var _graph = new GraphExample();
var v1 = new DataVertex()
{
Text = "Test1", ID = 1
};
_graph.AddVertex(v1);
var v2 = new DataVertex()
{
Text = "Test2", ID = 2
};
_graph.AddVertex(v2);
var v3 = new DataVertex()
{
Text = "Test3", ID = 3
};
_graph.AddVertex(v3);
var v4 = new DataVertex()
{
Text = "Test4", ID = 4
};
_graph.AddVertex(v4);
_graph.AddEdge(new DataEdge(v1, v2, 1)
{
ID = 1000
});
_graph.AddEdge(new DataEdge(v1, v2, 1)
{
ID = 1
});
_graph.AddEdge(new DataEdge(v1, v4, 1)
{
ID = 1000
});
_graph.AddEdge(new DataEdge(v1, v4, 1)
{
ID = 1
});
_graph.AddEdge(new DataEdge(v1, v4, 1)
{
ID = 2
});
_graph.AddEdge(new DataEdge(v2, v4, 1)
{
ID = 1001
});
_graph.AddEdge(new DataEdge(v3, v4, 1)
{
ID = 1002
});
_graph.AddEdge(new DataEdge(v3, v4, 1)
{
ID = 1003
});
_graph.AddEdge(new DataEdge(v4, v3, 1)
{
ID = 1004
});
_graph.AddEdge(new DataEdge(v4, v3, 1)
{
ID = 1005
});
_graph.AddEdge(new DataEdge(v4, v3, 1)
{
ID = 1006
});
tst_Area.ShowAllEdgesArrows(true);
var ergTreeLayoutParameters = new KKLayoutParameters {
};
var logic = new LogicCoreExample();
TSTLC = logic;
logic.Graph = _graph;
logic.EnableParallelEdges = true;
logic.ParallelEdgeDistance = 15;
logic.DefaultLayoutAlgorithm = LayoutAlgorithmTypeEnum.KK;
logic.DefaultLayoutAlgorithmParams = ergTreeLayoutParameters;
logic.DefaultOverlapRemovalAlgorithm = OverlapRemovalAlgorithmTypeEnum.FSA;
logic.DefaultOverlapRemovalAlgorithmParams = logic.AlgorithmFactory.CreateOverlapRemovalParameters(OverlapRemovalAlgorithmTypeEnum.FSA);
((GraphX.GraphSharp.Algorithms.OverlapRemoval.OverlapRemovalParameters)logic.DefaultOverlapRemovalAlgorithmParams).HorizontalGap = 140;
((GraphX.GraphSharp.Algorithms.OverlapRemoval.OverlapRemovalParameters)logic.DefaultOverlapRemovalAlgorithmParams).VerticalGap = 140;
tst_Area.GenerateGraph(_graph, true);
//tst_Area.VertexList[v1].Visibility = System.Windows.Visibility.Collapsed;
//tst_Area.VertexList[v2].Visibility = System.Windows.Visibility.Collapsed;
//tst_Area.VertexList[v3].Visibility = System.Windows.Visibility.Collapsed;
//tst_Area.VertexList[v4].SetPosition(new Point(0, 0));
tst_Area.ShowAllEdgesLabels();
tst_Area.AlignAllEdgesLabels();
tst_zoomctrl.ZoomToFill();
/* var img = new BitmapImage(new Uri(@"pack://application:,,,/ShowcaseExample;component/Images/birdy.png", UriKind.Absolute)) { CacheOption = BitmapCacheOption.OnLoad };
* GraphAreaBase.SetX(img, -100);
* GraphAreaBase.SetY(img, -100);
* var image = new Image() { Source = img, Width = 100, Height = 100 };
* var border = new Border() { BorderBrush = Brushes.Black, BorderThickness = new Thickness(2), Background = Brushes.Black, Width = 100, Height = 100 };
* image.Visibility = System.Windows.Visibility.Visible;
* border.Visibility = System.Windows.Visibility.Visible;
* tst_Area.InsertCustomChildControl(0, image);
* tst_Area.InsertCustomChildControl(0, border);*/
}
public void StandardFactory()
{
var positions = new Dictionary <TestVertex, Point>();
var sizes = new Dictionary <TestVertex, Size>();
var borders = new Dictionary <TestVertex, Thickness>();
var layoutTypes = new Dictionary <TestVertex, CompoundVertexInnerLayoutType>();
var graph = new BidirectionalGraph <TestVertex, Edge <TestVertex> >();
var simpleContext = new LayoutContext <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(
graph,
positions,
sizes,
LayoutMode.Simple);
var compoundContext1 = new LayoutContext <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(
graph,
positions,
sizes,
LayoutMode.Compound);
var compoundContext2 = new CompoundLayoutContext <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(
graph,
positions,
sizes,
LayoutMode.Compound,
borders,
layoutTypes);
var nullGraphContext = new LayoutContext <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(
null,
positions,
sizes,
LayoutMode.Simple);
var factory = new StandardLayoutAlgorithmFactory <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >();
CollectionAssert.AreEqual(
new[]
{
"Circular", "Tree", "FR", "BoundedFR", "KK",
"ISOM", "LinLog", "Sugiyama", "CompoundFDP",
"Random"
},
factory.AlgorithmTypes);
Assert.IsNull(
factory.CreateAlgorithm(
string.Empty,
simpleContext,
new CircularLayoutParameters()));
Assert.IsNull(
factory.CreateAlgorithm(
"NotExist",
simpleContext,
new CircularLayoutParameters()));
Assert.IsNull(
factory.CreateAlgorithm(
"Circular",
nullGraphContext,
new CircularLayoutParameters()));
Assert.IsInstanceOf <CircularLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"Circular",
simpleContext,
new CircularLayoutParameters()));
Assert.IsInstanceOf <SimpleTreeLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"Tree",
simpleContext,
new SimpleTreeLayoutParameters()));
Assert.IsInstanceOf <FRLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"FR",
simpleContext,
new FreeFRLayoutParameters()));
Assert.IsInstanceOf <FRLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"BoundedFR",
simpleContext,
new BoundedFRLayoutParameters()));
Assert.IsInstanceOf <KKLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"KK",
simpleContext,
new KKLayoutParameters()));
Assert.IsInstanceOf <ISOMLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"ISOM",
simpleContext,
new ISOMLayoutParameters()));
Assert.IsInstanceOf <LinLogLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"LinLog",
simpleContext,
new LinLogLayoutParameters()));
Assert.IsInstanceOf <SugiyamaLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"Sugiyama",
simpleContext,
new SugiyamaLayoutParameters()));
Assert.IsInstanceOf <CompoundFDPLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"CompoundFDP",
simpleContext,
new CompoundFDPLayoutParameters()));
Assert.IsInstanceOf <RandomLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"Random",
simpleContext,
new RandomLayoutParameters()));
Assert.IsNull(
factory.CreateAlgorithm(
"CompoundFDP",
compoundContext1,
new CompoundFDPLayoutParameters()));
Assert.IsNull(
factory.CreateAlgorithm(
"Circular",
compoundContext2,
new CompoundFDPLayoutParameters()));
Assert.IsInstanceOf <CompoundFDPLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > > >(
factory.CreateAlgorithm(
"CompoundFDP",
compoundContext2,
new CompoundFDPLayoutParameters()));
var testParameters = new TestLayoutParameters();
var circularParameters = new CircularLayoutParameters();
ILayoutParameters createdParameters = factory.CreateParameters(string.Empty, circularParameters);
Assert.IsNull(createdParameters);
createdParameters = factory.CreateParameters("NotExist", circularParameters);
Assert.IsNull(createdParameters);
createdParameters = factory.CreateParameters("Circular", null);
Assert.IsInstanceOf <CircularLayoutParameters>(createdParameters);
Assert.AreNotSame(circularParameters, createdParameters);
createdParameters = factory.CreateParameters("Circular", testParameters);
Assert.IsInstanceOf <CircularLayoutParameters>(createdParameters);
Assert.AreNotSame(testParameters, createdParameters);
createdParameters = factory.CreateParameters("Circular", circularParameters);
Assert.IsInstanceOf <CircularLayoutParameters>(createdParameters);
Assert.AreNotSame(circularParameters, createdParameters);
var treeParameters = new SimpleTreeLayoutParameters();
createdParameters = factory.CreateParameters("Tree", null);
Assert.IsInstanceOf <SimpleTreeLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("Tree", testParameters);
Assert.IsInstanceOf <SimpleTreeLayoutParameters>(createdParameters);
Assert.AreNotSame(testParameters, createdParameters);
createdParameters = factory.CreateParameters("Tree", treeParameters);
Assert.IsInstanceOf <SimpleTreeLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
var frParameters = new FreeFRLayoutParameters();
createdParameters = factory.CreateParameters("FR", null);
Assert.IsInstanceOf <FreeFRLayoutParameters>(createdParameters);
Assert.AreNotSame(frParameters, createdParameters);
createdParameters = factory.CreateParameters("FR", testParameters);
Assert.IsInstanceOf <FreeFRLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("FR", frParameters);
Assert.IsInstanceOf <FreeFRLayoutParameters>(createdParameters);
Assert.AreNotSame(frParameters, createdParameters);
var boundedFrParameters = new BoundedFRLayoutParameters();
createdParameters = factory.CreateParameters("BoundedFR", null);
Assert.IsInstanceOf <BoundedFRLayoutParameters>(createdParameters);
Assert.AreNotSame(boundedFrParameters, createdParameters);
createdParameters = factory.CreateParameters("BoundedFR", testParameters);
Assert.IsInstanceOf <BoundedFRLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("BoundedFR", boundedFrParameters);
Assert.IsInstanceOf <BoundedFRLayoutParameters>(createdParameters);
Assert.AreNotSame(boundedFrParameters, createdParameters);
var kkParameters = new KKLayoutParameters();
createdParameters = factory.CreateParameters("KK", null);
Assert.IsInstanceOf <KKLayoutParameters>(createdParameters);
Assert.AreNotSame(kkParameters, createdParameters);
createdParameters = factory.CreateParameters("KK", testParameters);
Assert.IsInstanceOf <KKLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("KK", kkParameters);
Assert.IsInstanceOf <KKLayoutParameters>(createdParameters);
Assert.AreNotSame(kkParameters, createdParameters);
var isomParameters = new ISOMLayoutParameters();
createdParameters = factory.CreateParameters("ISOM", null);
Assert.IsInstanceOf <ISOMLayoutParameters>(createdParameters);
Assert.AreNotSame(isomParameters, createdParameters);
createdParameters = factory.CreateParameters("ISOM", testParameters);
Assert.IsInstanceOf <ISOMLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("ISOM", isomParameters);
Assert.IsInstanceOf <ISOMLayoutParameters>(createdParameters);
Assert.AreNotSame(isomParameters, createdParameters);
var linLogParameters = new LinLogLayoutParameters();
createdParameters = factory.CreateParameters("LinLog", null);
Assert.IsInstanceOf <LinLogLayoutParameters>(createdParameters);
Assert.AreNotSame(linLogParameters, createdParameters);
createdParameters = factory.CreateParameters("LinLog", testParameters);
Assert.IsInstanceOf <LinLogLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("LinLog", linLogParameters);
Assert.IsInstanceOf <LinLogLayoutParameters>(createdParameters);
Assert.AreNotSame(linLogParameters, createdParameters);
var sugiyamaParameters = new SugiyamaLayoutParameters();
createdParameters = factory.CreateParameters("Sugiyama", null);
Assert.IsInstanceOf <SugiyamaLayoutParameters>(createdParameters);
Assert.AreNotSame(sugiyamaParameters, createdParameters);
createdParameters = factory.CreateParameters("Sugiyama", testParameters);
Assert.IsInstanceOf <SugiyamaLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("Sugiyama", sugiyamaParameters);
Assert.IsInstanceOf <SugiyamaLayoutParameters>(createdParameters);
Assert.AreNotSame(sugiyamaParameters, createdParameters);
var compoundFDPParameters = new CompoundFDPLayoutParameters();
createdParameters = factory.CreateParameters("CompoundFDP", null);
Assert.IsInstanceOf <CompoundFDPLayoutParameters>(createdParameters);
Assert.AreNotSame(compoundFDPParameters, createdParameters);
createdParameters = factory.CreateParameters("CompoundFDP", testParameters);
Assert.IsInstanceOf <CompoundFDPLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("CompoundFDP", compoundFDPParameters);
Assert.IsInstanceOf <CompoundFDPLayoutParameters>(createdParameters);
Assert.AreNotSame(compoundFDPParameters, createdParameters);
var randomParameters = new RandomLayoutParameters();
createdParameters = factory.CreateParameters("Random", null);
Assert.IsInstanceOf <RandomLayoutParameters>(createdParameters);
Assert.AreNotSame(randomParameters, createdParameters);
createdParameters = factory.CreateParameters("Random", testParameters);
Assert.IsInstanceOf <RandomLayoutParameters>(createdParameters);
Assert.AreNotSame(treeParameters, createdParameters);
createdParameters = factory.CreateParameters("Random", randomParameters);
Assert.IsInstanceOf <RandomLayoutParameters>(createdParameters);
Assert.AreNotSame(randomParameters, createdParameters);
Assert.IsFalse(factory.IsValidAlgorithm(null));
Assert.IsFalse(factory.IsValidAlgorithm(string.Empty));
Assert.IsTrue(factory.IsValidAlgorithm("Circular"));
Assert.IsFalse(factory.IsValidAlgorithm("circular"));
Assert.IsTrue(factory.IsValidAlgorithm("Tree"));
Assert.IsTrue(factory.IsValidAlgorithm("FR"));
Assert.IsTrue(factory.IsValidAlgorithm("BoundedFR"));
Assert.IsTrue(factory.IsValidAlgorithm("KK"));
Assert.IsTrue(factory.IsValidAlgorithm("ISOM"));
Assert.IsTrue(factory.IsValidAlgorithm("LinLog"));
Assert.IsTrue(factory.IsValidAlgorithm("Sugiyama"));
Assert.IsTrue(factory.IsValidAlgorithm("CompoundFDP"));
Assert.IsTrue(factory.IsValidAlgorithm("Random"));
var algorithm1 = new TestLayoutAlgorithm();
Assert.IsEmpty(factory.GetAlgorithmType(algorithm1));
var algorithm2 = new CircularLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, sizes, circularParameters);
Assert.AreEqual("Circular", factory.GetAlgorithmType(algorithm2));
var algorithm3 = new SimpleTreeLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, sizes, treeParameters);
Assert.AreEqual("Tree", factory.GetAlgorithmType(algorithm3));
var algorithm4 = new FRLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, frParameters);
Assert.AreEqual("FR", factory.GetAlgorithmType(algorithm4));
var algorithm5 = new FRLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, boundedFrParameters);
Assert.AreEqual("BoundedFR", factory.GetAlgorithmType(algorithm5));
var algorithm6 = new KKLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, kkParameters);
Assert.AreEqual("KK", factory.GetAlgorithmType(algorithm6));
var algorithm7 = new ISOMLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, isomParameters);
Assert.AreEqual("ISOM", factory.GetAlgorithmType(algorithm7));
var algorithm8 = new LinLogLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph);
Assert.AreEqual("LinLog", factory.GetAlgorithmType(algorithm8));
var algorithm9 = new SugiyamaLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, positions, sizes, sugiyamaParameters);
Assert.AreEqual("Sugiyama", factory.GetAlgorithmType(algorithm9));
var algorithm10 = new CompoundFDPLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, sizes, borders, layoutTypes);
Assert.AreEqual("CompoundFDP", factory.GetAlgorithmType(algorithm10));
var algorithm11 = new RandomLayoutAlgorithm <TestVertex, Edge <TestVertex>, BidirectionalGraph <TestVertex, Edge <TestVertex> > >(graph, sizes, null, randomParameters);
Assert.AreEqual("Random", factory.GetAlgorithmType(algorithm11));
Assert.IsFalse(factory.NeedEdgeRouting(string.Empty));
Assert.IsTrue(factory.NeedEdgeRouting("Circular"));
Assert.IsTrue(factory.NeedEdgeRouting("Tree"));
Assert.IsTrue(factory.NeedEdgeRouting("FR"));
Assert.IsTrue(factory.NeedEdgeRouting("BoundedFR"));
Assert.IsTrue(factory.NeedEdgeRouting("KK"));
Assert.IsTrue(factory.NeedEdgeRouting("ISOM"));
Assert.IsTrue(factory.NeedEdgeRouting("LinLog"));
Assert.IsFalse(factory.NeedEdgeRouting("Sugiyama"));
Assert.IsTrue(factory.NeedEdgeRouting("CompoundFDP"));
Assert.IsTrue(factory.NeedEdgeRouting("Random"));
Assert.IsFalse(factory.NeedOverlapRemoval(string.Empty));
Assert.IsFalse(factory.NeedOverlapRemoval("Circular"));
Assert.IsFalse(factory.NeedOverlapRemoval("Tree"));
Assert.IsTrue(factory.NeedOverlapRemoval("FR"));
Assert.IsTrue(factory.NeedOverlapRemoval("BoundedFR"));
Assert.IsTrue(factory.NeedOverlapRemoval("KK"));
Assert.IsTrue(factory.NeedOverlapRemoval("ISOM"));
Assert.IsTrue(factory.NeedOverlapRemoval("LinLog"));
Assert.IsFalse(factory.NeedOverlapRemoval("Sugiyama"));
Assert.IsFalse(factory.NeedOverlapRemoval("CompoundFDP"));
Assert.IsTrue(factory.NeedOverlapRemoval("Random"));
}
