Interface IDigraph

Namespace

AlgorithmsSW.Digraph

Assembly

AlgorithmsSW.dll

public interface IDigraph : IReadOnlyDigraph, IEnumerable<(int vertex0, int vertex1)>, IEnumerable

Inherited Members

IReadOnlyDigraph.VertexCount

IReadOnlyDigraph.EdgeCount

IReadOnlyDigraph.Vertexes

IReadOnlyDigraph.GetAdjacents(int)

IReadOnlyDigraph.AsText()

IReadOnlyDigraph.AreAdjacent(int, int)

IReadOnlyDigraph.Edges

IReadOnlyDigraph.SupportsParallelEdges

IReadOnlyDigraph.SupportsSelfLoops

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

Algorithms.ConnectComponents(IDigraph)

Algorithms.IsTopologicalOrder(IDigraph, IEnumerable<int>)

Algorithms.Reverse(IDigraph)

DigraphValiditor.ValidateInRange(IDigraph, int, int, string?, string?)

DigraphValiditor.ValidateInRange(IDigraph, int, string?)

RandomGraph.AddRandomWeights<TWeight>(IDigraph, IEnumerable<TWeight>)

Formatter.AsText<T>(T?)

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

Formatter.Log<T>(T)

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

Algorithms.AsGraph(IReadOnlyDigraph)

EdgeWeightedDigraphExtensions.ToEdgeWeightedDigraph<TWeight>(IReadOnlyDigraph, TWeight[], IComparer<TWeight>, 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(int, int)

Adds an edge between two vertices in the graph.

void AddEdge(int vertex0, int vertex1)

Parameters

vertex0 int

The first vertex of the edge to add.

vertex1 int

The second vertex of the edge to add.

RemoveEdge(int, int)

Removes an edge between two vertices in the graph.

bool RemoveEdge(int vertex0, int vertex1)

Parameters

vertex0 int

The first vertex of the edge to remove.

vertex1 int

The second vertex of the edge to remove.

Returns

bool

true if the edge was removed, false otherwise.