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
AverageDegree(IReadOnlyGraph)
public static float AverageDegree(this IReadOnlyGraph graph)
Parameters
graphIReadOnlyGraph
Returns
ContainsEdge(IReadOnlyGraph, int, int)
[ExerciseReference(4, 1, 4)]
public static bool ContainsEdge(this IReadOnlyGraph graph, int vertex1, int vertex2)
Parameters
graphIReadOnlyGraphvertex1intvertex2int
Returns
GetDegree(IReadOnlyGraph, int)
public static int GetDegree(this IReadOnlyGraph graph, int vertex)
Parameters
graphIReadOnlyGraphvertexint
Returns
GetSelfLoopCount(IReadOnlyGraph)
public static int GetSelfLoopCount(this IReadOnlyGraph graph)
Parameters
graphIReadOnlyGraph
Returns
HasParallelEdges(IReadOnlyGraph)
public static bool HasParallelEdges(this IReadOnlyGraph graph)
Parameters
graphIReadOnlyGraph
Returns
HasSelfLoops(IReadOnlyGraph)
public static bool HasSelfLoops(this IReadOnlyGraph graph)
Parameters
graphIReadOnlyGraph
Returns
MaxDegree(IReadOnlyGraph)
public static int MaxDegree(this IReadOnlyGraph graph)
Parameters
graphIReadOnlyGraph
Returns
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
graphIReadOnlyGraphThe graph to convert.