Class DynamicGraph

Namespace

AlgorithmsSW.Graph

Assembly

AlgorithmsSW.dll

public class DynamicGraph : IGraph, IReadOnlyGraph, IEnumerable<(int vertex0, int vertex1)>, IEnumerable

Inheritance

object

DynamicGraph

Implements

IGraph

IReadOnlyGraph

IEnumerable<(int source, int target)>

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

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

GraphAlgorithms.ConnectComponents(IGraph)

GraphAlgorithms.IsBridge(IGraph, int, int)

GraphExtensions.Add(IGraph, int, int)

GraphValidator.ValidateContainsEdge(IGraph, int, int, string?, string?)

GraphValidator.ValidateInRange(IGraph, int, int, string?, string?)

GraphValidator.ValidateInRange(IGraph, int, string?)

GraphValidator.ValidateNotParallelEdge(IGraph, int, int, string?, string?)

GraphValidator.ValidateNotSelfLoop(IGraph, int, int, string?, string?)

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)

Constructors

DynamicGraph(params int[])

public DynamicGraph(params int[] vertexes)

Parameters

vertexes int[]

Properties

EdgeCount

Gets the number of edges in the graph.

public int EdgeCount { get; set; }

Property Value

int

SupportsParallelEdges

Gets a value indicating whether the graph supports parallel edges.

public bool SupportsParallelEdges { get; }

Property Value

bool

Remarks

This can be used to ensure algorithms are implemented correctly.

SupportsSelfLoops

Gets a value indicating whether the graph supports self-loops.

public bool SupportsSelfLoops { get; }

Property Value

bool

Remarks

This can be used to ensure algorithms are implemented correctly.

VertexCount

Gets the number of vertices in the graph.

public int VertexCount { get; set; }

Property Value

int

Vertexes

Gets the vertices in the graph.

public IEnumerable<int> Vertexes { get; }

Property Value

IEnumerable<int>

Methods

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.

AddVertexes(params int[])

public void AddVertexes(params int[] vertexes)

Parameters

vertexes int[]

ContainsEdge(int, int)

Gets whether the graph contains an edge between two vertices.

public bool ContainsEdge(int vertex0, int vertex1)

Parameters

vertex0 int

vertex1 int

Returns

bool

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.

RemoveVertex(int)

public void RemoveVertex(int vertex)

Parameters

vertex int