Class GraphAlgorithms

Namespace

AlgorithmsSW.Graph

Assembly

AlgorithmsSW.dll

public static class GraphAlgorithms

Inheritance

object

GraphAlgorithms

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Methods

AllDegreesEven(IReadOnlyGraph)

public static bool AllDegreesEven(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

bool

ConnectComponents(IGraph)

public static void ConnectComponents(this IGraph graph)

Parameters

graph IGraph

DistanceHistogram<T>(IReadOnlyGraph, int)

[ExerciseReference(4, 1, 23)]
public static Counter<int> DistanceHistogram<T>(this IReadOnlyGraph graph, int sourceVertex)

Parameters

graph IReadOnlyGraph

sourceVertex int

Returns

Counter<int>

Type Parameters

T

FindNodeSafeToDelete(IReadOnlyGraph)

[ExerciseReference(4, 1, 10)]
public static int FindNodeSafeToDelete(IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

int

GetFullGrid(int, int)

[ExerciseReference(4, 4, 33)]
public static GridGraph GetFullGrid(int width, int height)

Parameters

width int

height int

Returns

GridGraph

HasEulerCycle(IReadOnlyGraph)

public static bool HasEulerCycle(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

bool

IsBridge(IGraph, int, int)

public static bool IsBridge(this IGraph graph, int vertex0, int vertex1)

Parameters

graph IGraph

vertex0 int

vertex1 int

Returns

bool

ShareEdge(IEnumerable<(int, int)>, IEnumerable<(int, int)>)

Checks whether two paths share an edge.

public static bool ShareEdge(IEnumerable<(int, int)> path0, IEnumerable<(int, int)> path1)

Parameters

path0 IEnumerable<(int source, int target)>

The first path.

path1 IEnumerable<(int source, int target)>

The second path.

Returns

bool

true if the paths share an edge; otherwise, false.