Class DykstraWitnessCalculator<T>
A witness calculator based on dykstra's algorithm.
Inheritance
System.Object
DykstraWitnessCalculator<T>
Inherited Members
System.Object.ToString()
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
Namespace: System.Dynamic.ExpandoObject
Assembly: cs.temp.dll.dll
Syntax
public class DykstraWitnessCalculator<T> : IWitnessCalculator<T> where T : struct
Type Parameters
|
T
|
Constructors
DykstraWitnessCalculator(WeightHandler<T>, Int32)
Creates a new witness calculator.
Declaration
public DykstraWitnessCalculator(WeightHandler<T> weightHandler, int hopLimit)
Parameters
|
WeightHandler<T>
weightHandler
|
|
System.Int32
hopLimit
|
DykstraWitnessCalculator(WeightHandler<T>, Int32, Int32)
Creates a new witness calculator.
Declaration
public DykstraWitnessCalculator(WeightHandler<T> weightHandler, int hopLimit, int maxSettles)
Parameters
|
WeightHandler<T>
weightHandler
|
|
System.Int32
hopLimit
|
|
System.Int32
maxSettles
|
Properties
HopLimit
Gets or sets the hop limit.
Declaration
public int HopLimit { get; set; }
Property Value
|
System.Int32
|
MaxSettles
Gets or sets the max settles.
Declaration
public int MaxSettles { get; set; }
Property Value
|
System.Int32
|
Methods
Calculate(DirectedDynamicGraph, Func<UInt32, IEnumerable<UInt32[]>>, UInt32, List<UInt32>, List<T>, ref EdgePath<T>[], ref EdgePath<T>[], UInt32)
Calculates witness paths.
Declaration
public void Calculate(DirectedDynamicGraph graph, Func<uint, IEnumerable<uint[]>> getRestrictions, uint source, List<uint> targets, List<T> weights, ref EdgePath<T>[] forwardWitness, ref EdgePath<T>[] backwardWitness, uint vertexToSkip)
Parameters
|
DirectedDynamicGraph
graph
|
|
Func<System.UInt32, IEnumerable<System.UInt32[]>>
getRestrictions
|
|
System.UInt32
source
|
|
List<System.UInt32>
targets
|
|
List<T>
weights
|
|
EdgePath<T>[]
forwardWitness
|
|
EdgePath<T>[]
backwardWitness
|
|
System.UInt32
vertexToSkip
|
Implements
ExistsOneHop(DirectedDynamicGraph, UInt32, List<UInt32>, List<T>, ref EdgePath<T>[], ref EdgePath<T>[])
Calculates witness paths with just one hop.
Declaration
public void ExistsOneHop(DirectedDynamicGraph graph, uint source, List<uint> targets, List<T> weights, ref EdgePath<T>[] forwardExists, ref EdgePath<T>[] backwardExists)
Parameters
|
DirectedDynamicGraph
graph
|
|
System.UInt32
source
|
|
List<System.UInt32>
targets
|
|
List<T>
weights
|
|
EdgePath<T>[]
forwardExists
|
|
EdgePath<T>[]
backwardExists
|