C# Class Cilador.Graph.GraphCropper

Given a set of vertices and an ICilGraph, produces a new ICilGraph composed solely of vertices and edges traversable from the given vertices.
Afficher le fichier Open project: rileywhite/Cilador Class Usage Examples

Méthodes publiques

Méthode Description
Crop ( ICilGraph sourceGraph ) : ICilGraph

Given a source graph and a set of start items, returns a minimal subset of the source graph that contains all start items

Private Methods

Méthode Description
FindMinimalVerticesSubset ( ICilGraph sourceGraph, IEnumerable startItems ) : HashSet

Retrieves the minimal subset of vertices from the sourceGraph that are required to fully support the startItems.

Method Details

Crop() public méthode

Given a source graph and a set of start items, returns a minimal subset of the source graph that contains all start items
public Crop ( ICilGraph sourceGraph ) : ICilGraph
sourceGraph ICilGraph Source graph for the crop operation
Résultat ICilGraph