biconnectedComponents
The biconnectedComponents action calculates the biconnected components and articulation points ...
Explorez notre base de connaissances et découvrez la syntaxe des actions SAS Viya.
The biconnectedComponents action calculates the biconnected components and articulation points ...
The 'clique' action finds maximal cliques in a graph. A clique is a subgraph where every two di...
The `connectedComponents` action finds the connected components of a graph. In graph theory, a ...
The cycle action calculates the elementary cycles (simple circuits) of a graph. A cycle is a pa...
The maxFlow action calculates the maximum flow of a graph. The maximum flow problem is a classi...
The minCostFlow action calculates the minimum-cost network flow of a graph. The minimum-cost ne...
The minCut action calculates the minimum cut of a graph. A cut is a partition of the nodes of a...
The minSpanTree action calculates the minimum spanning tree (MST) of a graph. An MST is a subgr...