Interface IReadOnlyGraph

Namespace

AlgorithmsSW.Graph

Assembly

AlgorithmsSW.dll

Represents a graph data structure.

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

Inherited Members

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

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)

Formatter.AsText<T>(T?)

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

Formatter.Log<T>(T)

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

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)

Remarks

Self-loops are supported, but parallel edges are not.

Properties

EdgeCount

Gets the number of edges in the graph.

int EdgeCount { get; }

Property Value

int

IsEmpty

Gets a value indicating whether the graph is empty (no vertices).

bool IsEmpty { get; }

Property Value

bool

VertexCount

Gets the number of vertices in the graph.

int VertexCount { get; }

Property Value

int

Vertexes

Gets the vertices in the graph.

IEnumerable<int> Vertexes { get; }

Property Value

IEnumerable<int>

Methods

AsText()

Creates a human-readable string representation of the graph.

string AsText()

Returns

string

A string representing the graph's structure.

ContainsEdge(int, int)

Gets whether the graph contains an edge between two vertices.

bool ContainsEdge(int vertex0, int vertex1)

Parameters

vertex0 int

vertex1 int

Returns

bool

GetAdjacents(int)

Gets the adjacent vertices of a given vertex.

IEnumerable<int> GetAdjacents(int vertex)

Parameters

vertex int

The vertex to find adjacents for.

Returns

IEnumerable<int>

An enumerable of adjacent vertices.