Interface IEdgeWeightedDigraph<TWeight>

Namespace

AlgorithmsSW.EdgeWeightedDigraph

Assembly

AlgorithmsSW.dll

Represents a directed edge weighted graph data structure.

public interface IEdgeWeightedDigraph<TWeight> : IReadOnlyEdgeWeightedDigraph<TWeight>, IReadOnlyDigraph, IEnumerable<(int vertex0, int vertex1)>, IEnumerable

Type Parameters

TWeight

The type of the edge weights.

Inherited Members

IReadOnlyEdgeWeightedDigraph<TWeight>.WeightedEdges

IReadOnlyEdgeWeightedDigraph<TWeight>.GetIncidentEdges(int)

IReadOnlyEdgeWeightedDigraph<TWeight>.Edges

IReadOnlyDigraph.VertexCount

IReadOnlyDigraph.EdgeCount

IReadOnlyDigraph.Vertexes

IReadOnlyDigraph.GetAdjacents(int)

IReadOnlyDigraph.AsText()

IReadOnlyDigraph.AreAdjacent(int, int)

IReadOnlyDigraph.SupportsParallelEdges

IReadOnlyDigraph.SupportsSelfLoops

IEnumerable<(int vertex0, int vertex1)>.GetEnumerator()

IEnumerable.GetEnumerator()

Extension Methods

Algorithms.AsGraph(IReadOnlyDigraph)

EdgeWeightedDigraphExtensions.ToEdgeWeightedDigraph<TWeight>(IReadOnlyDigraph, TWeight[], IComparer<TWeight>, TWeight)

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

EdgeWeightedDigraphExtensions.AddEdge<TWeight>(IEdgeWeightedDigraph<TWeight>, int, int, TWeight)

EdgeWeightedDigraphExtensions.RemoveUniqueEdge<TWeight>(IEdgeWeightedDigraph<TWeight>, int, int)

EdgeWeightedDigraphExtensions.RemoveVertex<TWeight>(IEdgeWeightedDigraph<TWeight>, int)

EdgeWeightedDigraphExtensions.Reverse<TWeight>(IEdgeWeightedDigraph<TWeight>)

Formatter.AsText<T>(T?)

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

Formatter.Log<T>(T)

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

EdgeWeightedDigraphExtensions.GetUniqueEdge<TWeight>(IReadOnlyEdgeWeightedDigraph<TWeight>, int, int)

EdgeWeightedDigraphExtensions.HasUniqueEdge<TWeight>(IReadOnlyEdgeWeightedDigraph<TWeight>, int, int)

EdgeWeightedDigraphExtensions.TryGetUniqueEdge<TWeight>(IReadOnlyEdgeWeightedDigraph<TWeight>, int, int, out DirectedEdge<TWeight>?)

Algorithms.Buffer2<T>(IEnumerable<T>)

Algorithms.IndexWhere<T>(IEnumerable<T>, Func<T, bool>)

Algorithms.JosephusSequence<T>(IEnumerable<T>, int)

CollectionExtensions.CopyTo<T>(IEnumerable<T>, IRandomAccessList<T>, int)

CollectionExtensions.CopyTo<T>(IEnumerable<T>, T[], int)

CollectionExtensions.GenerateAllPairs<T>(IEnumerable<T>)

CollectionExtensions.GenerateDistinctPairs<T>(IEnumerable<T>)

CollectionExtensions.Group<T>(IEnumerable<T>, int)

CollectionExtensions.ToResizableArray<T>(IEnumerable<T>)

CollectionExtensions.ToResizableArray<T>(IEnumerable<T>, int)

CollectionExtensions.ToSet<T>(IEnumerable<T>, IComparer<T>)

DataStructures.ToDigraph(IEnumerable<(int source, int target)>)

DataStructures.ToGraph(IEnumerable<(int source, int target)>)

ListExtensions.AsList<T>(IEnumerable<T>)

ListExtensions.CircularSlidingWindow2<T>(IEnumerable<T?>)

ListExtensions.CircularSlidingWindow<T>(IEnumerable<T>, int)

ListExtensions.SlidingWindow2<T>(IEnumerable<T?>)

ListExtensions.SlidingWindow<T>(IEnumerable<T>, int)

ListExtensions.ToRandomAccessList<T>(IEnumerable<T>)

StringSort.CountOccurrences<T>(IEnumerable<T>, IComparer<T>)

SymbolTableAlgorithms.ToSymbolTable<TKey, TValue>(IEnumerable<(TKey key, TValue value)>, IComparer<TKey>)

Formatter.AsText<T>(IEnumerable<T>?, string)

Methods

AddEdge(DirectedEdge<TWeight>)

Adds an edge to the graph.

void AddEdge(DirectedEdge<TWeight> edge)

Parameters

edge DirectedEdge<TWeight>

The edge to add.

RemoveEdge(DirectedEdge<TWeight>)

Removes an edge from the graph.

bool RemoveEdge(DirectedEdge<TWeight> edge)

Parameters

edge DirectedEdge<TWeight>

The edge to remove.

Returns

bool

true if the edge was removed, false otherwise.