How to get the number of computational processes (or named functions, algorithms) in a graph

[chuteany]

How to get the number of computational processes (or named functions, algorithms) in a graph—for example, the graph below contains two, the number is two. And how to get some one of them

[newcat]

Baklava doesn't calculate this, since it is only concerned about the order in which nodes have to be executed. But you can use a simple BFS or DFS algorithm to compute the number of isolated parts in the graph. Have a look at this SO question, for example: https://stackoverflow.com/questions/1348783/finding-all-disconnected-subgraphs-in-a-graph

[chuteany]

thank you!