Interface IEdgeWeightedGraph<TWeight>

Namespace

AlgorithmsSW.EdgeWeightedGraph

Assembly

AlgorithmsSW.dll

Represents a weighted graph data structure.

public interface IEdgeWeightedGraph<TWeight> : IReadOnlyEdgeWeightedGraph<TWeight>, IReadOnlyGraph, IEnumerable<(int vertex0, int vertex1)>, IEnumerable

Type Parameters

TWeight

The type of the edge weights.

Inherited Members

IReadOnlyEdgeWeightedGraph<TWeight>.WeightedEdges

IReadOnlyEdgeWeightedGraph<TWeight>.GetIncidentEdges(int)

IReadOnlyGraph.VertexCount

IReadOnlyGraph.EdgeCount

IReadOnlyGraph.IsEmpty

IReadOnlyGraph.Vertexes

IReadOnlyGraph.GetAdjacents(int)

IReadOnlyGraph.ContainsEdge(int, int)

IReadOnlyGraph.AsText()

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

IEnumerable.GetEnumerator()

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

EdgeWeightedGraphExtensions.AddEdge<TWeight>(IEdgeWeightedGraph<TWeight>, int, int, TWeight)

EdgeWeightedGraphExtensions.GetUniqueEdge<T>(IEdgeWeightedGraph<T>, int, int)

EdgeWeightedGraphExtensions.ToEdgeWeightedDigraph<TWeight>(IEdgeWeightedGraph<TWeight>)

Formatter.AsText<T>(T?)

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

Formatter.Log<T>(T)

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

GraphAlgorithms.AllDegreesEven(IReadOnlyGraph)

GraphAlgorithms.DistanceHistogram<T>(IReadOnlyGraph, int)

GraphAlgorithms.HasEulerCycle(IReadOnlyGraph)

GraphExtensions.AverageDegree(IReadOnlyGraph)

GraphExtensions.ContainsEdge(IReadOnlyGraph, int, int)

GraphExtensions.GetDegree(IReadOnlyGraph, int)

GraphExtensions.GetSelfLoopCount(IReadOnlyGraph)

GraphExtensions.HasParallelEdges(IReadOnlyGraph)

GraphExtensions.HasSelfLoops(IReadOnlyGraph)

GraphExtensions.MaxDegree(IReadOnlyGraph)

GraphExtensions.ToDigraph(IReadOnlyGraph)

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(Edge<TWeight>)

Adds an edge to the graph.

void AddEdge(Edge<TWeight> edge)

Parameters

edge Edge<TWeight>

The edge to add.

RemoveEdge(Edge<TWeight>)

Removes an edge from the graph.

bool RemoveEdge(Edge<TWeight> edge)

Parameters

edge Edge<TWeight>

The edge to remove.

Returns

bool