/// <summary>
/// Check the graph contains an edge from <paramref name="u"/>
/// to <paramref name="v"/>.
/// </summary>
/// <param name="u"></param>
/// <param name="v"></param>
/// <returns></returns>
public bool ContainsEdge(IVertex u, IVertex v)
{
if (u == null)
{
throw new ArgumentNullException(@"u");
}
if (v == null)
{
throw new ArgumentNullException(@"v");
}
return(ReversedGraph.ContainsEdge(v, u));
}
/// <summary>
/// Returns a transposed in-edges enumerable
/// </summary>
/// <param name="v">vertex to compute</param>
/// <returns>transposed in edges enumerable</returns>
public IEdgeEnumerable OutEdges(IVertex v)
{
return(new ReversedEdgeEnumerable(ReversedGraph.InEdges(v)));
}
/// <summary>
/// Vertex degree
/// </summary>
/// <param name="v">vertex to compute</param>
/// <returns>vertex edgree</returns>
public int Degree(IVertex v)
{
return(ReversedGraph.Degree(v));
}
