Show / Hide Table of Contents

    Interface IGraph<T>

    UnDirected graph. (When implemented on a directed graphs only outgoing edges are considered as Edges).

    Namespace: Advanced.Algorithms.DataStructures.Graph
    Assembly: Advanced.Algorithms.dll
    Syntax
    public interface IGraph<T>
    Type Parameters
    Name Description
    T

    Properties

    IsWeightedGraph

    Declaration
    bool IsWeightedGraph { get; }
    Property Value
    Type Description
    Boolean

    ReferenceVertex

    Declaration
    IGraphVertex<T> ReferenceVertex { get; }
    Property Value
    Type Description
    IGraphVertex<T>

    VerticesAsEnumberable

    Declaration
    IEnumerable<IGraphVertex<T>> VerticesAsEnumberable { get; }
    Property Value
    Type Description
    IEnumerable<IGraphVertex<T>>

    VerticesCount

    Declaration
    int VerticesCount { get; }
    Property Value
    Type Description
    Int32

    Methods

    Clone()

    Declaration
    IGraph<T> Clone()
    Returns
    Type Description
    IGraph<T>

    ContainsVertex(T)

    Declaration
    bool ContainsVertex(T key)
    Parameters
    Type Name Description
    T key
    Returns
    Type Description
    Boolean

    GetVertex(T)

    Declaration
    IGraphVertex<T> GetVertex(T key)
    Parameters
    Type Name Description
    T key
    Returns
    Type Description
    IGraphVertex<T>

    HasEdge(T, T)

    Declaration
    bool HasEdge(T source, T destination)
    Parameters
    Type Name Description
    T source
    T destination
    Returns
    Type Description
    Boolean
    Back to top Generated by DocFX