Class DigraphWithAdjacentsLists

Namespace

AlgorithmsSW.Digraph

Assembly

AlgorithmsSW.dll

Represents a directed graph using an array of adjacency lists.

public sealed class DigraphWithAdjacentsLists : IDigraph, IReadOnlyDigraph, IEnumerable<(int vertex0, int vertex1)>, IEnumerable

Inheritance

object

DigraphWithAdjacentsLists

Implements

IDigraph

IReadOnlyDigraph

IEnumerable<(int source, int target)>

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.ReferenceEquals(object, object)

object.ToString()

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

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

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)

Constructors

DigraphWithAdjacentsLists(IDigraph)

[ExerciseReference(4, 2, 3)]
public DigraphWithAdjacentsLists(IDigraph digraph)

Parameters

digraph IDigraph

DigraphWithAdjacentsLists(int)

Initializes a new instance of the DigraphWithAdjacentsLists class.

public DigraphWithAdjacentsLists(int vertexCount)

Parameters

vertexCount int

The number of vertices in the graph.

DigraphWithAdjacentsLists(int, EdgeList)

Initializes a new instance of the DigraphWithAdjacentsLists class.

public DigraphWithAdjacentsLists(int vertexCount, EdgeList edges)

Parameters

vertexCount int

The number of vertices in the graph.

edges EdgeList

The edges to add to the graph.

Properties

EdgeCount

Gets the number of edges in the graph.

public int EdgeCount { get; }

Property Value

int

Edges

public IEnumerable<(int, int)> Edges { get; }

Property Value

IEnumerable<(int source, int target)>

SupportsParallelEdges

public bool SupportsParallelEdges { get; }

Property Value

bool

SupportsSelfLoops

public bool SupportsSelfLoops { get; }

Property Value

bool

VertexCount

Gets the number of vertices in the graph.

public int VertexCount { get; }

Property Value

int

Methods

Add((int vertex0, int vertex1))

public void Add((int vertex0, int vertex1) edge)

Parameters

edge (int vertex0, int vertex1)

AddEdge(int, int)

Adds an edge between two vertices in the graph.

public 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.

ContainsEdge(int, int)

Checks if the graph contains an edge between from one vertex to another.

[ExerciseReference(4, 2, 3)]
public bool ContainsEdge(int vertex0, int vertex1)

Parameters

vertex0 int

The start of the edge.

vertex1 int

The end of the edge.

Returns

bool

true if the graph contains the edge, false otherwise.

GetAdjacents(int)

Gets the adjacent vertices of a given vertex.

public IEnumerable<int> GetAdjacents(int vertex)

Parameters

vertex int

The vertex to find adjacents for.

Returns

IEnumerable<int>

An enumerable of adjacent vertices.

GetEnumerator()

Returns an enumerator that iterates through the collection.

public IEnumerator<(int vertex0, int vertex1)> GetEnumerator()

Returns

IEnumerator<(int vertex0, int vertex1)>

An enumerator that can be used to iterate through the collection.

RemoveEdge(int, int)

Removes an edge between two vertices in the graph.

public 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.