C# Класс 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.
Наследование: GraphMetricCalculatorBase
Показать файл Открыть проект Примеры использования класса

Открытые методы

Метод Описание
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

Защищенные методы

Метод Описание
GetDictionaryKey ( IVertex oVertex1, IVertex oVertex2 ) : System.Int64

Описание методов

AssertValid() публичный Метод

public AssertValid ( ) : void
Результат void

CalculateGraphMetrics() публичный Метод

public CalculateGraphMetrics ( IGraph graph ) : Boolean>.Dictionary
graph IGraph
Результат Boolean>.Dictionary

EdgeReciprocationCalculator() публичный Метод

Initializes a new instance of the class.
public EdgeReciprocationCalculator ( ) : System
Результат System

GetDictionaryKey() защищенный Метод

protected GetDictionaryKey ( IVertex oVertex1, IVertex oVertex2 ) : System.Int64
oVertex1 IVertex
oVertex2 IVertex
Результат System.Int64

TryCalculateGraphMetrics() публичный Метод

public TryCalculateGraphMetrics ( IGraph graph, BackgroundWorker backgroundWorker, Boolean>.Dictionary &graphMetrics ) : System.Boolean
graph IGraph
backgroundWorker System.ComponentModel.BackgroundWorker
graphMetrics Boolean>.Dictionary
Результат System.Boolean