/// <summary>
///
/// </summary>
/// <typeparam name="V"></typeparam>
/// <typeparam name="E"></typeparam>
/// <typeparam name="K"></typeparam>
/// <param name="start"></param>
/// <param name="getKey"></param>
/// <returns></returns>
public static E NearestMin <V, E, K>(this HeStructure <V, E> .Halfedge start, Func <E, K> getKey)
where V : HeStructure <V, E> .Vertex
where E : HeStructure <V, E> .Halfedge
where K : IComparable <K>
{
return(GraphSearch.NearestMin(start.Self, GetConnected <V, E>, getKey));
}
/// <summary>
///
/// </summary>
/// <typeparam name="V"></typeparam>
/// <typeparam name="E"></typeparam>
/// <typeparam name="K"></typeparam>
/// <param name="start"></param>
/// <param name="getKey"></param>
/// <returns></returns>
public static IEnumerable <V> WalkToMax <V, E, K>(this HeStructure <V, E> .Vertex start, Func <V, K> getKey)
where V : HeStructure <V, E> .Vertex
where E : HeStructure <V, E> .Halfedge
where K : IComparable <K>
{
return(GraphSearch.WalkToMax(start.Self, v => v.ConnectedVertices, getKey));
}
/// <summary>
///
/// </summary>
/// <typeparam name="V"></typeparam>
/// <typeparam name="E"></typeparam>
/// <typeparam name="F"></typeparam>
/// <typeparam name="K"></typeparam>
/// <param name="start"></param>
/// <param name="getKey"></param>
/// <returns></returns>
public static IEnumerable <F> WalkToMax <V, E, F, K>(this HeStructure <V, E, F> .Face start, Func <F, K> getKey)
where V : HeStructure <V, E, F> .Vertex
where E : HeStructure <V, E, F> .Halfedge
where F : HeStructure <V, E, F> .Face
where K : IComparable <K>
{
return(GraphSearch.WalkToMax(start.Self, f => f.AdjacentFaces, getKey));
}
/// <summary>
///
/// </summary>
/// <typeparam name="V"></typeparam>
/// <typeparam name="E"></typeparam>
/// <typeparam name="F"></typeparam>
/// <typeparam name="K"></typeparam>
/// <param name="start"></param>
/// <param name="getKey"></param>
/// <returns></returns>
public static F NearestMin <V, E, F, K>(this HeStructure <V, E, F> .Face start, Func <F, K> getKey)
where V : HeStructure <V, E, F> .Vertex
where E : HeStructure <V, E, F> .Halfedge
where F : HeStructure <V, E, F> .Face
where K : IComparable <K>
{
return(GraphSearch.NearestMin(start.Self, f => f.AdjacentFaces, getKey));
}