AdjacencyListWeightedDirectedGraph(T) Class

AdjacencyListWeightedDirectedGraphT Class

An implementation of the abstract datatype weighted directed graph using an adjacency list to encode the set of edges.

Inheritance Hierarchy

SystemObject
Slash.Collections.GraphsAdjacencyListWeightedDirectedGraphT

Namespace: Slash.Collections.Graphs
Assembly: Slash.Collections (in Slash.Collections.dll) Version: 1.0.6018.40177

Syntax

public class AdjacencyListWeightedDirectedGraph<T> : IWeightedGraph<T>
where T : IGraphVertex

Public Class AdjacencyListWeightedDirectedGraph(Of T As IGraphVertex)
	Implements IWeightedGraph(Of T)

generic<typename T>
where T : IGraphVertex
public ref class AdjacencyListWeightedDirectedGraph : IWeightedGraph<T>

type AdjacencyListWeightedDirectedGraph<'T when 'T : IGraphVertex> =  
    class
        interface IWeightedGraph<'T>
    end

The AdjacencyListWeightedDirectedGraphT type exposes the following members.

Constructors

	Name	Description
	AdjacencyListWeightedDirectedGraphT	Default constructor for this implementation of directed graphs. Takes an array of vertices as parameter, which should be the set of vertices of this graph. Initially there are no edges.

Properties

	Name	Description
	EdgeCount	Number of edges between the vertices of this graph.
	Edges	Edges between the vertices of this graph.
	EdgeWeights	Weights of the edges between the vertices of this graph.
	VertexCount	Number of vertices of this graph.
	Vertices	Vertices of this graph.

Methods

	Name	Description
	AddEdges	Adds two edges between two vertices in this graph in O(1), weighted with the given value.
	AddSingleEdge	Adds one edge between two vertices in this graph in O(1), weighted with the given value.
	Degree	Returns the degree of the given vertex, in other words the number of adjacent vertices, in O(1).
	GetEdgeWeight	Gets the weight of the edge between the specified vertices in O(n), where n is the number of adjacent vertices of the first one.
	HasEdge	Checks if there is an edge between two vertices of this graph in O(n), where n is the number of adjacent vertices of the first one.
	ListOfAdjacentVertices	Returns a list containing the adjacent vertices of a given vertex in this graph in O(1).