Class EuclideanDistanceGraph

Namespace

AlgorithmsSW.EdgeWeightedGraph

Assembly

AlgorithmsSW.dll

Graph where the weight of the edges is the euclidean distance between the vertexes, which are points in 3D space.

public class EuclideanDistanceGraph : IEdgeWeightedGraph<double>, IReadOnlyEdgeWeightedGraph<double>, IReadOnlyGraph, IEnumerable<(int vertex0, int vertex1)>, IEnumerable

Inheritance

object

EuclideanDistanceGraph

Implements

IEdgeWeightedGraph<double>

IReadOnlyEdgeWeightedGraph<double>

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

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

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

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

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

EuclideanDistanceGraph(IEnumerable<Vector3>)

Initializes a new instance of the EuclideanDistanceGraph class.

public EuclideanDistanceGraph(IEnumerable<Vector3> vertexes)

Parameters

vertexes IEnumerable<Vector3>

The spatial representation of the vertexes.

Properties

EdgeCount

Gets the number of edges in the graph.

public int EdgeCount { get; }

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; }

Property Value

int

WeightedEdges

Gets the edges that is part of this IReadOnlyEdgeWeightedGraph<TWeight>.

public IEnumerable<Edge<double>> WeightedEdges { get; }

Property Value

IEnumerable<Edge<double>>

Methods

AddEdge(Edge<double>)

Adds an edge to the graph.

public void AddEdge(Edge<double> edge)

Parameters

edge Edge<double>

The edge to add.

AddEdge(int, int)

Adds an edge between the two given vertexes to the graph.

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

Returns

Edge<double>

The added edge.

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.

GetIncidentEdges(int)

Gets the edges that is incident to the given vertex.

public IEnumerable<Edge<double>> GetIncidentEdges(int vertex)

Parameters

vertex int

The vertex to get the incident edges of.

Returns

IEnumerable<Edge<double>>

MakeEdge(int, int)

Makes an edge between the two given vertexes.

public Edge<double> MakeEdge(int vertex0, int vertex1)

Parameters

vertex0 int

The first vertex of the edge to make.

vertex1 int

The second vertex of the edge to make.

Returns

Edge<double>

An edge between the two given vertexes.

Remarks

The weight of the edge is the euclidean distance between the vertexes.

RemoveEdge(Edge<double>)

Represents a weighted graph data structure.

public bool RemoveEdge(Edge<double> edge)

Parameters

edge Edge<double>

Returns

bool