Table of Contents

Class GraphExtensions

Namespace
AlgorithmsSW.Graph
Assembly
AlgorithmsSW.dll
public static class GraphExtensions
Inheritance
GraphExtensions
Inherited Members

Methods

Add(IGraph, int, int)

public static void Add(this IGraph graph, int vertex0, int vertex1)

Parameters

graph IGraph
vertex0 int
vertex1 int

AverageDegree(IReadOnlyGraph)

public static float AverageDegree(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

float

ContainsEdge(IReadOnlyGraph, int, int)

[ExerciseReference(4, 1, 4)]
public static bool ContainsEdge(this IReadOnlyGraph graph, int vertex1, int vertex2)

Parameters

graph IReadOnlyGraph
vertex1 int
vertex2 int

Returns

bool

GetDegree(IReadOnlyGraph, int)

public static int GetDegree(this IReadOnlyGraph graph, int vertex)

Parameters

graph IReadOnlyGraph
vertex int

Returns

int

GetSelfLoopCount(IReadOnlyGraph)

public static int GetSelfLoopCount(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

int

HasParallelEdges(IReadOnlyGraph)

public static bool HasParallelEdges(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

bool

HasSelfLoops(IReadOnlyGraph)

public static bool HasSelfLoops(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

bool

MaxDegree(IReadOnlyGraph)

public static int MaxDegree(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

Returns

int

ToDigraph(IReadOnlyGraph)

Converts a graph to a digraph by two edges (in opposite directions) for each edge in the original graph.

public static IReadOnlyDigraph ToDigraph(this IReadOnlyGraph graph)

Parameters

graph IReadOnlyGraph

The graph to convert.

Returns

IReadOnlyDigraph