The QuickGraph.Predicates namespace contains predicate
implementations for filtered graphs.
Classes
| Class | Description | |
|---|---|---|
 | ConnectsEdgePredicate |
A predicate that filter edge connecting two vertices
|
| EdgePredicate |
Edge predicate
|
| InCollectionVertexPredicate |
Predicate for checking that a vertex is in a collection
|
| InDictionaryVertexPredicate |
Predicate for checking that a vertex is in a collection
|
| InEdgePredicate |
In edge predicate
|
| IsAdjacentEdgePredicate |
Predicate that checks if a edge is an edge
|
| IsInEdgePredicate |
Predicate that checks if a edge is an inedge
|
| IsOutEdgePredicate | |
| KeepAllEdgesPredicate |
Predicate that always returns true
|
| KeepAllVerticesPredicate |
Predicate that always returns true
|
| NotInCircuitEdgePredicate |
An predicate that checks that the edge is not in both circuit
and temporary circuit.
|
| NotVertexPredicate |
Not operator to predicate
|
| OutEdgePredicate |
Out-edge predicate
|
| Preds |
Static helper class for creating predicates
|
| ResidualEdgePredicate |
Predicate that test if an edge is residual
|
| ReversedResidualEdgePredicate |
Predicate that test if an edge's reverse is residual
|
| SinkVertexPredicate |
A predicate to test if a IVertex is a root vertex (no
in-edges).
|
| SourceVertexPredicate |
A predicate to test if a IVertex is a root vertex (no
in-edges).
|
| VertexEqualPredicate |
Predicate that checks to two vertex are equal
|
Remarks
Predicates can be used to filter the edge set or the vertex set of graphs.
A static helper class, Preds, is provided to help the instanciation of predicates.
