EdgeFilterGraph

public struct EdgeFilterGraph<Underlying, EdgeFilter: EdgeFilterProtocol>: GraphProtocol
where EdgeFilter.Graph == Underlying
extension EdgeFilterGraph: VertexListGraph where Underlying: VertexListGraph
extension EdgeFilterGraph: EdgeListGraph where Underlying: EdgeListGraph
extension EdgeFilterGraph: IncidenceGraph where Underlying: IncidenceGraph
extension EdgeFilterGraph: BidirectionalGraph where Underlying: BidirectionalGraph
extension EdgeFilterGraph: PropertyGraph where Underlying: PropertyGraph
extension EdgeFilterGraph: SearchDefaultsGraph where Underlying: SearchDefaultsGraph

Wraps an underlying graph and filters out undesired edges.

  • The name of a vertex in self.

    Declaration

    Swift

    public typealias VertexId = Underlying.VertexId
  • The name of an edge in self.

    Declaration

    Swift

    public typealias EdgeId = Underlying.EdgeId
  • A sparse collection that excludes edges based on the user-provided filter.

    See more

    Declaration

    Swift

    public struct EdgeFilteringCollection<C> : Collection where C : Collection, Underlying.EdgeId == C.Element

Available where Underlying: VertexListGraph

  • All vertices in self.

    Declaration

    Swift

    public var vertices: Underlying.VertexCollection { get }

Available where Underlying: EdgeListGraph

Available where Underlying: IncidenceGraph

Available where Underlying: BidirectionalGraph

Available where Underlying: PropertyGraph

Available where Underlying: SearchDefaultsGraph