AdjacencyListWeightedDirectedGraph(T).HasEdge Method

AdjacencyListWeightedDirectedGraphTHasEdge Method

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.

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

Syntax

C++

Copy

public bool HasEdge(
	T firstNode,
	T secondNode
)

Public Function HasEdge ( 
	firstNode As T,
	secondNode As T
) As Boolean

public:
virtual bool HasEdge(
	T firstNode, 
	T secondNode
) sealed

abstract HasEdge : 
        firstNode : 'T * 
        secondNode : 'T -> bool 
override HasEdge : 
        firstNode : 'T * 
        secondNode : 'T -> bool

Parameters

firstNode: Type: T
First vertex to check.
secondNode: Type: T
Second vertex to check.

Return Value

Type: Boolean
True if there is an edge, and false otherwise.

Implements

IWeightedGraphTHasEdge(T, T)

Reference

AdjacencyListWeightedDirectedGraphT Class

Slash.Collections.Graphs Namespace