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
파일 보기 프로젝트 열기: 2014-sed-team3/term-project 1 사용 예제들

공개 메소드들

메소드 설명
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