C# Class Smrf.NodeXL.Algorithms.EdgeReciprocationCalculator

Calculates whether the edges in a connected graph are reciprocated.
An edge (A,B) in a directed graph is reciprocated if the graph also has an edge (B,A). Reciprocation has no meaning for an undirected graph.
Inheritance: GraphMetricCalculatorBase
Afficher le fichier Open project: 2014-sed-team3/term-project Class Usage Examples

Méthodes publiques

Méthode Description
AssertValid ( ) : void
CalculateGraphMetrics ( IGraph graph ) : Boolean>.Dictionary
EdgeReciprocationCalculator ( ) : System

Initializes a new instance of the class.
TryCalculateGraphMetrics ( IGraph graph, BackgroundWorker backgroundWorker, Boolean>.Dictionary &graphMetrics ) : System.Boolean

Méthodes protégées

Méthode Description
GetDictionaryKey ( IVertex oVertex1, IVertex oVertex2 ) : System.Int64

Method Details

AssertValid() public méthode

public AssertValid ( ) : void
Résultat void

CalculateGraphMetrics() public méthode

public CalculateGraphMetrics ( IGraph graph ) : Boolean>.Dictionary
graph IGraph
Résultat Boolean>.Dictionary

EdgeReciprocationCalculator() public méthode

Initializes a new instance of the class.
public EdgeReciprocationCalculator ( ) : System
Résultat System

GetDictionaryKey() protected méthode

protected GetDictionaryKey ( IVertex oVertex1, IVertex oVertex2 ) : System.Int64
oVertex1 IVertex
oVertex2 IVertex
Résultat System.Int64

TryCalculateGraphMetrics() public méthode

public TryCalculateGraphMetrics ( IGraph graph, BackgroundWorker backgroundWorker, Boolean>.Dictionary &graphMetrics ) : System.Boolean
graph IGraph
backgroundWorker System.ComponentModel.BackgroundWorker
graphMetrics Boolean>.Dictionary
Résultat System.Boolean