0

我正在尝试雇用

compile group: 'org.jgrapht', name: 'jgrapht-core', version: '1.1.0'

可视化团队和团队成员之间的关系。

例如：-

“Team One”有成员“Team Member A”、“Team Member B”、“Team Member C”

“团队二”有成员“团队成员 C”、“团队成员 D”

所以我添加了以下顶点

final Graph<Displayable, DefaultEdge> directedGraph = new DefaultDirectedGraph<>(DefaultEdge.class);

directedGraph.addVertex(team_0001);
directedGraph.addVertex(team_0002);
directedGraph.addVertex(teamMember_A);
directedGraph.addVertex(teamMember_B);
directedGraph.addVertex(teamMember_C);
directedGraph.addVertex(teamMember_D);

directedGraph.addEdge(team_0001, teamMember_A);
directedGraph.addEdge(team_0001, teamMember_B);
directedGraph.addEdge(team_0001, teamMember_C);
directedGraph.addEdge(team_0002, teamMember_C);
directedGraph.addEdge(team_0002, teamMember_D);

当我遍历此图时，我想要以下输出：-

Team_0001
  teamMember_A
  teamMember_B
  teamMember_C

Team_0002
  teamMember_C
  teamMember_D

我怎样才能做到这一点？

我必须开发客户图迭代器吗？

4

1 回答 1

3

根据定义，您的图是二分图：{Partition 1=Team vertices, Partition 2= player vertices}。

所以只需维护一个团队顶点列表，并为每个顶点调用Graphs.neighborListOf(.)：

List<Displayable> teams=...; for(Displayable v : teams) System.out.println("Team"+v+" has the following members: "+Graphs.neighborListOf(teamGraph,v);

或者，由于您的图是有向的，您可以迭代边缘：

for(DefaultEdge e : teamGraph.edgeSet()) System.out.println(String.format("Player %s belongs to team %s",teamGraph.getEdgeTarget(e), teamGraph.getEdgeSource(e)));

于 2018-04-20T06:07:22.550 回答