C# 클래스 Smrf.NodeXL.Algorithms.IntergroupEdgeCalculator

Given a collection of vertex groups, this class counts the number of edges and the sum of edge weights for the edges between pairs of groups, and for the edges within each group.
상속: GraphMetricCalculatorBase
파일 보기 프로젝트 열기: 2014-sed-team3/term-project 1 사용 예제들

공개 메소드들

메소드 설명
AssertValid ( ) : void
CalculateGraphMetrics ( IGraph graph, IList groups, System.Boolean useDirectedness ) : IList
IntergroupEdgeCalculator ( ) : System

Initializes a new instance of the class.

TryCalculateGraphMetrics ( IGraph graph, BackgroundWorker backgroundWorker, IList groups, System.Boolean useDirectedness, IList &graphMetrics ) : System.Boolean

보호된 메소드들

메소드 설명
CompareIntergroupEdges ( IntergroupEdgeInfo oIntergroupEdge1, IntergroupEdgeInfo oIntergroupEdge2 ) : Int32
CountIncidentEdge ( IEdge oIntergroupEdge, Int32 iGroup1Index, Int32 iGroup2Index, IList oIntergroupEdges, IntergroupEdgeInfo>.Dictionary oIntergroupEdgeIndexes ) : void
IncidentEdgeShouldBeCounted ( IEdge oIncidentEdge, IVertex oVertexInGroup1, Int32 iGroup1Index, Int32>.Dictionary oGroupIndexDictionary, System.Boolean bUseDirectedness, System.Boolean bGraphIsDirected, Int32 &iGroup2Index ) : System.Boolean

메소드 상세

AssertValid() 공개 메소드

public AssertValid ( ) : void
리턴 void

CalculateGraphMetrics() 공개 메소드

public CalculateGraphMetrics ( IGraph graph, IList groups, System.Boolean useDirectedness ) : IList
graph IGraph
groups IList
useDirectedness System.Boolean
리턴 IList

CompareIntergroupEdges() 보호된 정적인 메소드

protected static CompareIntergroupEdges ( IntergroupEdgeInfo oIntergroupEdge1, IntergroupEdgeInfo oIntergroupEdge2 ) : Int32
oIntergroupEdge1 Smrf.NodeXL.Core.IntergroupEdgeInfo
oIntergroupEdge2 Smrf.NodeXL.Core.IntergroupEdgeInfo
리턴 System.Int32

CountIncidentEdge() 보호된 메소드

protected CountIncidentEdge ( IEdge oIntergroupEdge, Int32 iGroup1Index, Int32 iGroup2Index, IList oIntergroupEdges, IntergroupEdgeInfo>.Dictionary oIntergroupEdgeIndexes ) : void
oIntergroupEdge IEdge
iGroup1Index System.Int32
iGroup2Index System.Int32
oIntergroupEdges IList
oIntergroupEdgeIndexes IntergroupEdgeInfo>.Dictionary
리턴 void

IncidentEdgeShouldBeCounted() 보호된 메소드

protected IncidentEdgeShouldBeCounted ( IEdge oIncidentEdge, IVertex oVertexInGroup1, Int32 iGroup1Index, Int32>.Dictionary oGroupIndexDictionary, System.Boolean bUseDirectedness, System.Boolean bGraphIsDirected, Int32 &iGroup2Index ) : System.Boolean
oIncidentEdge IEdge
oVertexInGroup1 IVertex
iGroup1Index System.Int32
oGroupIndexDictionary Int32>.Dictionary
bUseDirectedness System.Boolean
bGraphIsDirected System.Boolean
iGroup2Index System.Int32
리턴 System.Boolean

IntergroupEdgeCalculator() 공개 메소드

Initializes a new instance of the class.
public IntergroupEdgeCalculator ( ) : System
리턴 System

TryCalculateGraphMetrics() 공개 메소드

public TryCalculateGraphMetrics ( IGraph graph, BackgroundWorker backgroundWorker, IList groups, System.Boolean useDirectedness, IList &graphMetrics ) : System.Boolean
graph IGraph
backgroundWorker System.ComponentModel.BackgroundWorker
groups IList
useDirectedness System.Boolean
graphMetrics IList
리턴 System.Boolean