public override FuncParameter ExecFunc(IAttributeDefinition myAttributeDefinition,
Object myCallingObject,
IVertex myStartVertex,
IGraphDB myGraphDB,
SecurityToken mySecurityToken,
Int64 myTransactionToken,
params FuncParameter[] myParams)
{
#region initialization
if (myStartVertex == null)
throw new InvalidFunctionParameterException("StartVertex", "Vertex that represents the start vertex", "null");
//set the start node
var currentVertex = myStartVertex;
if ((myParams[0].Value as IEnumerable<IVertex>).First() == null)
throw new InvalidFunctionParameterException("EndVertex", "Set of vertices that represents the target vertices", "null");
//set the target node
var endVertex = (myParams[0].Value as IEnumerable<IVertex>).First();
//set the maximum depth
if (myAttributeDefinition == null)
throw new InvalidFunctionParameterException("EdgeType ", "Edge type not found", "faild");
UInt64 maxDepth = Convert.ToUInt64(myParams[1].Value);
if (maxDepth < 1)
throw new InvalidFunctionParameterException("MaxDepth", "Max depth to low", maxDepth.ToString());
var myType = myGraphDB.GetVertexType<IVertexType>(
mySecurityToken,
myTransactionToken,
new sones.GraphDB.Request.RequestGetVertexType(myAttributeDefinition.RelatedType.Name),
(statistics, type) => type);
var myEdgeType = myAttributeDefinition.ID;
var hasProperty = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.HasProperty("Weight");
long myPropertyID = 0;
if (hasProperty == true)
{
myPropertyID = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.GetPropertyDefinition("Weight").ID;
}
Dictionary<IOutgoingEdgeDefinition, Tuple<bool, long>> edgeTypeID = new Dictionary<IOutgoingEdgeDefinition, Tuple<bool, long>>();
var edgeType = myParams[2].Value.ToString();
if (edgeType == "")
{
edgeTypeID.Add(myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name), Tuple.Create(hasProperty, myPropertyID));
}
else
{
if (edgeType.Contains("all edgeType"))
{
edgeTypeID = this.AllEdgeWithTargetVertex(myType);
}
else
{
edgeTypeID = this.StringParser(edgeType, myType);
if (!edgeTypeID.ContainsKey(myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name)))
edgeTypeID.Add(myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name), Tuple.Create(hasProperty, myPropertyID));
}
}
List<UInt64> depthBuffer = new List<UInt64>();
List<Tuple<ISingleEdge, IOutgoingEdgeDefinition>> edgeBuffer = new List<Tuple<ISingleEdge, IOutgoingEdgeDefinition>>();
List<double> distanceBuffer = new List<double>();
List<IVertex> VertexBuffer = new List<IVertex>();
BufferDijkstra buf = new BufferDijkstra();
DataDijkstra lists = new DataDijkstra();
buf.Add(myStartVertex, 0, 0);
lists.Add(currentVertex, 0, 0, null,null, currentVertex);
bool endVertexFlag = false;
#endregion
#region Dijkstra algorithm
double currentVertexDistance = 0;
ulong currentVertexDepth = 0;
double endVertexDistance = 0;
ulong endvertexDepth = 0;
Stopwatch clock = new Stopwatch();
clock.Start();
while (buf.Count != 0)
{
if (currentVertexDepth < maxDepth)
{
List<Tuple<ISingleEdge, IOutgoingEdgeDefinition>> AllsingleEdge = new List<Tuple<ISingleEdge, IOutgoingEdgeDefinition>>();
foreach (IOutgoingEdgeDefinition id in edgeTypeID.Keys)
{
var hyperEdge = currentVertex.GetOutgoingHyperEdge(id.ID);
if (hyperEdge != null)
{
var singleEdge = hyperEdge.GetAllEdges();
foreach (ISingleEdge value in singleEdge)
{
AllsingleEdge.Add(Tuple.Create(value,id));
}
}
}
if (AllsingleEdge != null)
{
for (int iCount = 0; iCount < AllsingleEdge.Count(); iCount++)
{
var elementSingleEdge = AllsingleEdge.ElementAt(iCount);
var TargetVertex = elementSingleEdge.Item1.GetTargetVertex();
double current_distance=0;
if (edgeTypeID[elementSingleEdge.Item2].Item1 == true)
{
current_distance = Math.Abs(AllsingleEdge.ElementAt(iCount).Item1.GetProperty<double>(edgeTypeID[elementSingleEdge.Item2].Item2));
}
else
{
current_distance = 1;
}
var current_singleEdge = AllsingleEdge.ElementAt(iCount).Item1;
var TargetVertexID = lists.GetElement(TargetVertex.VertexID);
if (TargetVertexID == null)
{
if (!endVertexFlag)
{
buf.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
else
if (endVertexDistance > currentVertexDistance + current_distance ||
(endVertexDistance == currentVertexDistance + current_distance &&
endvertexDepth > currentVertexDepth + 1))
{
buf.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
}
else
{
if (currentVertexDistance + current_distance < TargetVertexID.Item2)
{
if (!endVertexFlag)
{
buf.Set(TargetVertexID.Item2,TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
else
if (endVertexDistance > currentVertexDistance + current_distance ||
(endVertexDistance == currentVertexDistance + current_distance &&
endvertexDepth > currentVertexDepth + 1))
{
buf.Set(TargetVertexID.Item2,TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
}
else if (currentVertexDistance + current_distance == TargetVertexID.Item2 && currentVertexDepth + 1 < TargetVertexID.Item3)
{
if (!endVertexFlag)
{
buf.Set(TargetVertexID.Item2,TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
else
if (endVertexDistance > currentVertexDistance + current_distance ||
(endVertexDistance == currentVertexDistance + current_distance &&
endvertexDepth > currentVertexDepth + 1))
{
buf.Set(TargetVertexID.Item2,TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
}
}
if (TargetVertex == endVertex)
{
endVertexFlag = true;
var endNode = lists.GetElement(endVertex.VertexID);
endVertexDistance = endNode.Item2;
endvertexDepth = endNode.Item3;
}
}
}
}
//delate from Buffer current Vertex or all
if (currentVertex == endVertex)
{
buf.Clear();
}
else
{
buf.Remove(currentVertexDistance,currentVertex.VertexID);
}
//Minimum distance from Buffer
if (buf.Count != 0)
{
var minVertex = buf.Min();
currentVertex = minVertex.Item1;
currentVertexDistance = minVertex.Item2;
currentVertexDepth = minVertex.Item3;
}
}
#endregion
clock.Stop();
#region create output
edgeBuffer.Add(null);
currentVertex = endVertex;
while (currentVertex != myStartVertex)
{
var current_tuple = lists.GetElement(currentVertex.VertexID);
if (current_tuple == null)
throw new InvalidFunctionParameterException("MaxDepth", "Max depth to low or end node is not with start node connected, find't end node", maxDepth);
VertexBuffer.Add(currentVertex);
distanceBuffer.Add(current_tuple.Item2);
depthBuffer.Add(current_tuple.Item3);
edgeBuffer.Add(current_tuple.Item4);
currentVertex = current_tuple.Item5;
}
depthBuffer.Add(0);
distanceBuffer.Add(0);
VertexBuffer.Add(myStartVertex);
edgeBuffer.Add(null);
var path = CreateVertexView(myPropertyID, VertexBuffer, distanceBuffer, edgeBuffer, depthBuffer);
#endregion
distanceBuffer = null;
VertexBuffer = null;
edgeBuffer = null;
depthBuffer = null;
buf.Clear();
lists.Clear();
buf = null;
lists = null;
return new FuncParameter(path);
}
/// <summary>
/// Algorithm Dijkstra for find all shortest path from start Vertex to all others Vertices
/// </summary>
/// <param name="myAttributeDefinition"></param>
/// <param name="myCallingObject"></param>
/// <param name="myStartVertex"></param>
/// <param name="myGraphDB"></param>
/// <param name="maxDepth"></param>
/// <param name="mySecurityToken"></param>
/// <param name="myTransactionToken"></param>
/// <returns></returns>
private Tuple <IVertex, DataDijkstra> FindShortPathToAll(IAttributeDefinition myAttributeDefinition,
Object myCallingObject,
IVertex myStartVertex,
IGraphDB myGraphDB,
UInt64 maxDepth,
SecurityToken mySecurityToken,
Int64 myTransactionToken)
{
if (myStartVertex == null)
{
throw new InvalidFunctionParameterException("StartVertex", "Vertex that represents the start vertex", "null");
}
//set the start node
var currentVertex = myStartVertex;
var myType = myGraphDB.GetVertexType <IVertexType>(mySecurityToken,
myTransactionToken,
new sones.GraphDB.Request.RequestGetVertexType(myAttributeDefinition.RelatedType.Name),
(statistics, type) => type);
var myEdgeType = myAttributeDefinition.ID;
var hasProperty = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.HasProperty("Weight");
long myPropertyID = 0;
if (hasProperty == true)
{
myPropertyID = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.GetPropertyDefinition("Weight").ID;
}
var edgeTypeDifinition = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name);
DataDijkstra lists = new DataDijkstra();
BufferDijkstra buffer = new BufferDijkstra();
buffer.Add(myStartVertex, 0, 0);
lists.Add(currentVertex, 0, 0, null, null, currentVertex);
double currentVertexDistance = 0;
ulong currentVertexDepth = 0;
while (buffer.Count != 0)
{
if (currentVertexDepth < maxDepth)
{
var hyperEdge = currentVertex.GetOutgoingHyperEdge(myEdgeType);
if (hyperEdge != null)
{
var singleEdge = hyperEdge.GetAllEdges();
for (int iCount = 0; iCount < singleEdge.Count(); iCount++)
{
var TargetVertex = singleEdge.ElementAt(iCount).GetTargetVertex();
double current_distance;
if (hasProperty == true)
{
current_distance = Math.Abs(singleEdge.ElementAt(iCount).GetProperty <double>(myPropertyID));
}
else
{
current_distance = 1;
}
var current_singleEdge = singleEdge.ElementAt(iCount);
var TargetVertexID = lists.GetElement(TargetVertex.VertexID);
if (TargetVertexID == null)
{
buffer.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
edgeTypeDifinition,
currentVertex);
}
else
{
if (currentVertexDistance + current_distance < TargetVertexID.Item2)
{
buffer.Set(TargetVertexID.Item2, TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
edgeTypeDifinition,
currentVertex);
}
else
if (currentVertexDistance + current_distance == TargetVertexID.Item2 && currentVertexDepth + 1 < TargetVertexID.Item3)
{
buffer.Set(TargetVertexID.Item2, TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
edgeTypeDifinition,
currentVertex);
}
}
}
//delate from Buffer Vertex and any information
}
}
buffer.Remove(currentVertexDistance, currentVertex.VertexID);
//Minimum in distance from Buffer
if (buffer.Count != 0)
{
var minVertex = buffer.Min();
currentVertex = minVertex.Item1;
currentVertexDistance = minVertex.Item2;
currentVertexDepth = minVertex.Item3;
}
}
var result = Tuple.Create(myStartVertex, lists);
buffer.Clear();
lists.Clear();
buffer = null;
lists = null;
return(result);
}
/// <summary>
/// Algorithm Dijkstra for find all shortest path from start Vertex to all others Vertices
/// </summary>
/// <param name="myAttributeDefinition"></param>
/// <param name="myCallingObject"></param>
/// <param name="myStartVertex"></param>
/// <param name="myGraphDB"></param>
/// <param name="maxDepth"></param>
/// <param name="mySecurityToken"></param>
/// <param name="myTransactionToken"></param>
/// <returns></returns>
private Tuple<IVertex, DataDijkstra> FindShortPathToAll(IAttributeDefinition myAttributeDefinition,
Object myCallingObject,
IVertex myStartVertex,
IGraphDB myGraphDB,
UInt64 maxDepth,
SecurityToken mySecurityToken,
Int64 myTransactionToken)
{
if (myStartVertex == null)
throw new InvalidFunctionParameterException("StartVertex", "Vertex that represents the start vertex", "null");
//set the start node
var currentVertex = myStartVertex;
var myType = myGraphDB.GetVertexType<IVertexType>(mySecurityToken,
myTransactionToken,
new sones.GraphDB.Request.RequestGetVertexType(myAttributeDefinition.RelatedType.Name),
(statistics, type) => type);
var myEdgeType = myAttributeDefinition.ID;
var hasProperty = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.HasProperty("Weight");
long myPropertyID = 0;
if (hasProperty == true)
{
myPropertyID = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.GetPropertyDefinition("Weight").ID;
}
var edgeTypeDifinition = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name);
DataDijkstra lists = new DataDijkstra();
BufferDijkstra buffer = new BufferDijkstra();
buffer.Add(myStartVertex, 0, 0);
lists.Add(currentVertex, 0, 0, null,null, currentVertex);
double currentVertexDistance = 0;
ulong currentVertexDepth = 0;
while (buffer.Count != 0)
{
if (currentVertexDepth < maxDepth)
{
var hyperEdge = currentVertex.GetOutgoingHyperEdge(myEdgeType);
if (hyperEdge != null)
{
var singleEdge = hyperEdge.GetAllEdges();
for (int iCount = 0; iCount < singleEdge.Count(); iCount++)
{
var TargetVertex = singleEdge.ElementAt(iCount).GetTargetVertex();
double current_distance;
if (hasProperty == true)
{
current_distance = Math.Abs(singleEdge.ElementAt(iCount).GetProperty<double>(myPropertyID));
}
else
{
current_distance = 1;
}
var current_singleEdge = singleEdge.ElementAt(iCount);
var TargetVertexID = lists.GetElement(TargetVertex.VertexID);
if (TargetVertexID == null)
{
buffer.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
edgeTypeDifinition,
currentVertex);
}
else
{
if (currentVertexDistance + current_distance < TargetVertexID.Item2)
{
buffer.Set(TargetVertexID.Item2,TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
edgeTypeDifinition,
currentVertex);
}
else
if (currentVertexDistance + current_distance == TargetVertexID.Item2 && currentVertexDepth + 1 < TargetVertexID.Item3)
{
buffer.Set(TargetVertexID.Item2,TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
edgeTypeDifinition,
currentVertex);
}
}
}
//delate from Buffer Vertex and any information
}
}
buffer.Remove(currentVertexDistance,currentVertex.VertexID);
//Minimum in distance from Buffer
if (buffer.Count != 0)
{
var minVertex = buffer.Min();
currentVertex = minVertex.Item1;
currentVertexDistance = minVertex.Item2;
currentVertexDepth = minVertex.Item3;
}
}
var result = Tuple.Create(myStartVertex, lists);
buffer.Clear();
lists.Clear();
buffer = null;
lists = null;
return result;
}
public override FuncParameter ExecFunc(IAttributeDefinition myAttributeDefinition,
Object myCallingObject,
IVertex myStartVertex,
IGraphDB myGraphDB,
SecurityToken mySecurityToken,
Int64 myTransactionToken,
params FuncParameter[] myParams)
{
#region initialization
if (myStartVertex == null)
{
throw new InvalidFunctionParameterException("StartVertex", "Vertex that represents the start vertex", "null");
}
//set the start node
var currentVertex = myStartVertex;
if ((myParams[0].Value as IEnumerable <IVertex>).First() == null)
{
throw new InvalidFunctionParameterException("EndVertex", "Set of vertices that represents the target vertices", "null");
}
//set the target node
var endVertex = (myParams[0].Value as IEnumerable <IVertex>).First();
//set the maximum depth
if (myAttributeDefinition == null)
{
throw new InvalidFunctionParameterException("EdgeType ", "Edge type not found", "faild");
}
UInt64 maxDepth = Convert.ToUInt64(myParams[1].Value);
if (maxDepth < 1)
{
throw new InvalidFunctionParameterException("MaxDepth", "Max depth to low", maxDepth.ToString());
}
var myType = myGraphDB.GetVertexType <IVertexType>(
mySecurityToken,
myTransactionToken,
new sones.GraphDB.Request.RequestGetVertexType(myAttributeDefinition.RelatedType.Name),
(statistics, type) => type);
var myEdgeType = myAttributeDefinition.ID;
var hasProperty = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.HasProperty("Weight");
long myPropertyID = 0;
if (hasProperty == true)
{
myPropertyID = myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name).InnerEdgeType.GetPropertyDefinition("Weight").ID;
}
Dictionary <IOutgoingEdgeDefinition, Tuple <bool, long> > edgeTypeID = new Dictionary <IOutgoingEdgeDefinition, Tuple <bool, long> >();
var edgeType = myParams[2].Value.ToString();
if (edgeType == "")
{
edgeTypeID.Add(myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name), Tuple.Create(hasProperty, myPropertyID));
}
else
{
if (edgeType.Contains("all edgeType"))
{
edgeTypeID = this.AllEdgeWithTargetVertex(myType);
}
else
{
edgeTypeID = this.StringParser(edgeType, myType);
if (!edgeTypeID.ContainsKey(myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name)))
{
edgeTypeID.Add(myType.GetOutgoingEdgeDefinition(myAttributeDefinition.Name), Tuple.Create(hasProperty, myPropertyID));
}
}
}
List <UInt64> depthBuffer = new List <UInt64>();
List <Tuple <ISingleEdge, IOutgoingEdgeDefinition> > edgeBuffer = new List <Tuple <ISingleEdge, IOutgoingEdgeDefinition> >();
List <double> distanceBuffer = new List <double>();
List <IVertex> VertexBuffer = new List <IVertex>();
BufferDijkstra buf = new BufferDijkstra();
DataDijkstra lists = new DataDijkstra();
buf.Add(myStartVertex, 0, 0);
lists.Add(currentVertex, 0, 0, null, null, currentVertex);
bool endVertexFlag = false;
#endregion
#region Dijkstra algorithm
double currentVertexDistance = 0;
ulong currentVertexDepth = 0;
double endVertexDistance = 0;
ulong endvertexDepth = 0;
Stopwatch clock = new Stopwatch();
clock.Start();
while (buf.Count != 0)
{
if (currentVertexDepth < maxDepth)
{
List <Tuple <ISingleEdge, IOutgoingEdgeDefinition> > AllsingleEdge = new List <Tuple <ISingleEdge, IOutgoingEdgeDefinition> >();
foreach (IOutgoingEdgeDefinition id in edgeTypeID.Keys)
{
var hyperEdge = currentVertex.GetOutgoingHyperEdge(id.ID);
if (hyperEdge != null)
{
var singleEdge = hyperEdge.GetAllEdges();
foreach (ISingleEdge value in singleEdge)
{
AllsingleEdge.Add(Tuple.Create(value, id));
}
}
}
if (AllsingleEdge != null)
{
for (int iCount = 0; iCount < AllsingleEdge.Count(); iCount++)
{
var elementSingleEdge = AllsingleEdge.ElementAt(iCount);
var TargetVertex = elementSingleEdge.Item1.GetTargetVertex();
double current_distance = 0;
if (edgeTypeID[elementSingleEdge.Item2].Item1 == true)
{
current_distance = Math.Abs(AllsingleEdge.ElementAt(iCount).Item1.GetProperty <double>(edgeTypeID[elementSingleEdge.Item2].Item2));
}
else
{
current_distance = 1;
}
var current_singleEdge = AllsingleEdge.ElementAt(iCount).Item1;
var TargetVertexID = lists.GetElement(TargetVertex.VertexID);
if (TargetVertexID == null)
{
if (!endVertexFlag)
{
buf.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
else
if (endVertexDistance > currentVertexDistance + current_distance ||
(endVertexDistance == currentVertexDistance + current_distance &&
endvertexDepth > currentVertexDepth + 1))
{
buf.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Add(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
}
else
{
if (currentVertexDistance + current_distance < TargetVertexID.Item2)
{
if (!endVertexFlag)
{
buf.Set(TargetVertexID.Item2, TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
else
if (endVertexDistance > currentVertexDistance + current_distance ||
(endVertexDistance == currentVertexDistance + current_distance &&
endvertexDepth > currentVertexDepth + 1))
{
buf.Set(TargetVertexID.Item2, TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
}
else if (currentVertexDistance + current_distance == TargetVertexID.Item2 && currentVertexDepth + 1 < TargetVertexID.Item3)
{
if (!endVertexFlag)
{
buf.Set(TargetVertexID.Item2, TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
else
if (endVertexDistance > currentVertexDistance + current_distance ||
(endVertexDistance == currentVertexDistance + current_distance &&
endvertexDepth > currentVertexDepth + 1))
{
buf.Set(TargetVertexID.Item2, TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1);
lists.Set(TargetVertex,
current_distance + currentVertexDistance,
currentVertexDepth + 1,
current_singleEdge,
elementSingleEdge.Item2,
currentVertex);
}
}
}
if (TargetVertex == endVertex)
{
endVertexFlag = true;
var endNode = lists.GetElement(endVertex.VertexID);
endVertexDistance = endNode.Item2;
endvertexDepth = endNode.Item3;
}
}
}
}
//delate from Buffer current Vertex or all
if (currentVertex == endVertex)
{
buf.Clear();
}
else
{
buf.Remove(currentVertexDistance, currentVertex.VertexID);
}
//Minimum distance from Buffer
if (buf.Count != 0)
{
var minVertex = buf.Min();
currentVertex = minVertex.Item1;
currentVertexDistance = minVertex.Item2;
currentVertexDepth = minVertex.Item3;
}
}
#endregion
clock.Stop();
#region create output
edgeBuffer.Add(null);
currentVertex = endVertex;
while (currentVertex != myStartVertex)
{
var current_tuple = lists.GetElement(currentVertex.VertexID);
if (current_tuple == null)
{
throw new InvalidFunctionParameterException("MaxDepth", "Max depth to low or end node is not with start node connected, find't end node", maxDepth);
}
VertexBuffer.Add(currentVertex);
distanceBuffer.Add(current_tuple.Item2);
depthBuffer.Add(current_tuple.Item3);
edgeBuffer.Add(current_tuple.Item4);
currentVertex = current_tuple.Item5;
}
depthBuffer.Add(0);
distanceBuffer.Add(0);
VertexBuffer.Add(myStartVertex);
edgeBuffer.Add(null);
var path = CreateVertexView(myPropertyID, VertexBuffer, distanceBuffer, edgeBuffer, depthBuffer);
#endregion
distanceBuffer = null;
VertexBuffer = null;
edgeBuffer = null;
depthBuffer = null;
buf.Clear();
lists.Clear();
buf = null;
lists = null;
return(new FuncParameter(path));
}