Interface ICriticalEdge<TWeight>

Namespace

AlgorithmsSW.EdgeWeightedDigraph

Assembly

AlgorithmsSW.dll

Given two nodes, the edges that when any is removed will increases the shortest path between them the most, but not remove all shortest paths.

[ExerciseReference(4, 4, 37)]
public interface ICriticalEdge<TWeight>

Type Parameters

TWeight

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[])

Properties

CriticalEdges

Gets the critical edge, if any.

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.

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.

bool HasCriticalEdges { get; }

Property Value

bool

See Also

ICriticalEdge<TWeight>