DirectedGraph 形象化为拥有有限数量的 Node 的一个 2-D 图形，在该图形中，每个 Node 都位于一些 Point 上，相邻的 Node 是通过 Edges 连接在一起的。 -DirectedGraph visualized to have a limited number of Node 2-D graphics, in the graph, each Node are located on a number of Point, adjacent to the Nod

求有向图的所有强连通分支。给定一个有向图D求出其所有的强连通分支。用java实现。涉及到离散数学的知识-Finding All connected components of a directed graph