Class CriticalEdgesExamineIntersectingShortestPaths<TWeight>

Namespace

AlgorithmsSW.EdgeWeightedDigraph

Assembly

AlgorithmsSW.dll

Supports all classes in the .NET class hierarchy and provides low-level services to derived classes. This is the ultimate base class of all .NET classes; it is the root of the type hierarchy.

[ExerciseReference(4, 4, 37)]
public class CriticalEdgesExamineIntersectingShortestPaths<TWeight> : ICriticalEdge<TWeight> where TWeight : INumber<TWeight>, IMinMaxValue<TWeight>

Type Parameters

TWeight

Inheritance

object

CriticalEdgesExamineIntersectingShortestPaths<TWeight>

Implements

ICriticalEdge<TWeight>

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>)

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Interpolate<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Substitute<T, TBuffer>(TBuffer, (T input, T[] output)[])

Comparable.ToComparable<T>(T, IComparer<T>)

Formatter.AsText<T>(T?)

Formatter.Describe<TLabel, TDescription>(TLabel, TDescription, string)

Formatter.Log<T>(T)

Formatter.Pretty<T>(T, params int[])

Constructors

CriticalEdgesExamineIntersectingShortestPaths(IEdgeWeightedDigraph<TWeight>, int, int)

Initializes a new instance of the CriticalEdgesExamineIntersectingShortestPaths<TWeight> class.

public CriticalEdgesExamineIntersectingShortestPaths(IEdgeWeightedDigraph<TWeight> graph, int source, int destination)

Parameters

graph IEdgeWeightedDigraph<TWeight>

The graph to find the critical edge in.

source int

The source vertex.

destination int

The destination vertex.

Properties

CriticalEdges

Gets the critical edge, if any.

public IEnumerable<DirectedEdge<TWeight>> CriticalEdges { get; }

Property Value

IEnumerable<DirectedEdge<TWeight>>

Remarks

The critical edge is the edge that when removed will increases the shortest path between the source and the destination the most.

DistanceWithoutCriticalEdge

Gets the distance of the shortest path oif the critical edge would be removed.

public TWeight? DistanceWithoutCriticalEdge { get; }

Property Value

TWeight

HasCriticalEdges

Gets a value indicating whether there are any critical edges in a graph, where a critical edge is defined as an edge that, when removed, increases the shortest path between two nodes the most, but does not remove all shortest paths.

public bool HasCriticalEdges { get; }

Property Value

bool

See Also

ICriticalEdge<TWeight>