public void GraphEndpointMatching_InsertFromStart()
{
DoubleLinkedDirectedGraph <string, string> graph = new DoubleLinkedDirectedGraph <string, string>();
graph.InsertFromStart("i").Insert("n").Insert("t");
graph.InsertFromStart("i").Insert("c").Insert("e");
graph.FinishGraph();
(graph.Start).Count().ShouldBe(1);
(graph.End).Count().ShouldBe(2);
}
public void GraphEndpointMatching_InsertNotFromStart()
{
DoubleLinkedDirectedGraph <string, string> graph = new DoubleLinkedDirectedGraph <string, string>();
graph.InsertFromStart("1").Insert("2").Insert("3");
graph.Insert("1", "4").Insert("3");
graph.FinishGraph();
(graph.Start).Count().ShouldBe(1);
(graph.End).Count().ShouldBe(1);
}
public ISagaStepBehavior GetSagaStepBehaviorForNode(DoubleLinkedDirectedGraph <NodeData, EdgeData> .Node node)
{
ISagaStepBehavior sagaStepBehavior = _sagaStepBehaviorFactory.GetSagaStepBehavior(node.NodeData.BehaviorModuleKey, node.NodeData.BehaviorKey, node.NodeData.BehaviorVersion, node.NodeData.BehaviorConfiguration, Name);
if (sagaStepBehavior == null)
{
throw new WorkflowRuntimeException($"Workflow {Name}.{Version} cannot find SagaStepBehavior {node.NodeData.BehaviorKey}.{node.NodeData.BehaviorVersion}");
}
else
{
return(sagaStepBehavior);
}
}
public void GraphEndpointMatching_InsertWithExplicitEndPoint()
{
DoubleLinkedDirectedGraph <string, string> graph = new DoubleLinkedDirectedGraph <string, string>();
graph.InsertFromStart("omo").Insert("moma").InsertEnd();
graph.Insert("moma", "merm").InsertEnd();
graph.Insert("omo", "mama").Insert("merm").InsertEnd();
graph.Insert("mama", "marm").InsertEnd();
graph.InsertFromStart("ohm").InsertEnd();
graph.FinishGraph();
(graph.Start).Count().ShouldBe(2);
(graph.End).Count().ShouldBe(4);
}
public void GraphEndpointMatching_InsertWithExplicitEndPoint_OptionsLocallyUnique()
{
DoubleLinkedDirectedGraph <string, string> graph = new DoubleLinkedDirectedGraph <string, string>(new DoubleLinkedDirectedGraph <string, string> .Options()
{
TreatNodeKeysAsOnlyLocallyUnique = true
});
graph.InsertFromStart("projection1").Insert("projection2").InsertEnd();
graph.InsertFromStart("projection1").Insert("projection3").InsertEnd();
graph.InsertFromStart("projection2").Insert("projection3").InsertEnd();
graph.InsertFromStart("projection1").InsertEnd();
graph.FinishGraph();
(graph.Start).Count().ShouldBe(2);
(graph.Start).Single(n => n.NodeKey.Equals("projection1")).NextEdges.Values.Count().ShouldBe(3);
(graph.Start).Single(n => n.NodeKey.Equals("projection1")).WalkEdge("projection2").NextEdges.Values.Count().ShouldBe(1);
(graph.Start).Single(n => n.NodeKey.Equals("projection1")).WalkEdge("projection3").NextEdges.Values.Count().ShouldBe(1);
(graph.Start).Single(n => n.NodeKey.Equals("projection2")).NextEdges.Values.Count().ShouldBe(1);
(graph.Start).Single(n => n.NodeKey.Equals("projection1")).WalkEdge("projection2").WalkEdge(DoubleLinkedDirectedGraph <string, string> .END_NODE_KEY);
(graph.Start).Single(n => n.NodeKey.Equals("projection1")).WalkEdge("projection3").WalkEdge(DoubleLinkedDirectedGraph <string, string> .END_NODE_KEY);
(graph.Start).Single(n => n.NodeKey.Equals("projection2")).WalkEdge("projection3").WalkEdge(DoubleLinkedDirectedGraph <string, string> .END_NODE_KEY);
(graph.Start).Single(n => n.NodeKey.Equals("projection1")).WalkEdge(DoubleLinkedDirectedGraph <string, string> .END_NODE_KEY);
}
public void GraphEndpointMatching_InsertFromStart_OptionsLocallyUnique()
{
DoubleLinkedDirectedGraph <string, string> graph = new DoubleLinkedDirectedGraph <string, string>(new DoubleLinkedDirectedGraph <string, string> .Options()
{
TreatNodeKeysAsOnlyLocallyUnique = true
});
graph.InsertFromStart("i").Insert("n").Insert("t").InsertEnd();
graph.InsertFromStart("i").Insert("n").Insert("i").InsertEnd();
graph.FinishGraph();
graph.Start.Count().ShouldBe(1);
graph.Start.First().NodeKey.ShouldBe("i");
graph.Start.First().NextEdges.Count().ShouldBe(1);
graph.Start.First().NextEdges.First().Value.ToNode.NodeKey.ShouldBe("n");
graph.Start.First().NextEdges.First().Value.ToNode.NextEdges.Count().ShouldBe(2);
Should.Throw <DoubleLinkedDirectedGraphException>(() => graph.Start.First().WalkEdge("i"));
graph.Start.First().WalkEdge("n").NodeKey.ShouldBe("n");
graph.Start.First().WalkEdge("n").NextEdges.Count().ShouldBe(2);
graph.Start.First().WalkEdge("n").WalkEdge("t").NextEdges.Count().ShouldBe(1);
graph.Start.First().WalkEdge("n").WalkEdge("t").WalkEdge(DoubleLinkedDirectedGraph <string, string> .END_NODE_KEY);
graph.Start.First().WalkEdge("n").WalkEdge("i").NextEdges.Count().ShouldBe(1);
graph.Start.First().WalkEdge("n").WalkEdge("i").WalkEdge(DoubleLinkedDirectedGraph <string, string> .END_NODE_KEY);
}
