GraphAnalyzer

java.lang.Object
- org.mapstruct.ap.internal.model.dependency.GraphAnalyzer

```
public class GraphAnalyzer
extends java.lang.Object
```
Analyzes graphs: Discovers all descendants of given nodes and detects cyclic dependencies between nodes if present.

Nested Class Summary

Nested Classes
Modifier and Type Class Description

static class GraphAnalyzer.GraphAnalyzerBuilder

Field Summary

Fields
Modifier and Type	Field	Description
`private java.util.Stack<Node>`	`currentPath`
`private java.util.Set<java.util.List<java.lang.String>>`	`cycles`
`private int`	`nextTraversalSequence`
`private java.util.Map<java.lang.String,Node>`	`nodes`

Constructor Summary

Constructors
Modifier Constructor Description

private GraphAnalyzer(java.util.Map<java.lang.String,Node> nodes)

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`private void`	`analyze()`	Performs a full traversal of the graph, detecting potential cycles and calculates the full list of descendants of the nodes.
`static GraphAnalyzer.GraphAnalyzerBuilder`	`builder()`
`private void`	`depthFirstSearch(Node node)`
`private java.util.List<java.lang.String>`	`getCurrentCycle(Node start)`
`java.util.Set<java.util.List<java.lang.String>>`	`getCycles()`
`int`	`getTraversalSequence(java.lang.String name)`	Returns the traversal sequence number of the given node.
`static GraphAnalyzer.GraphAnalyzerBuilder`	`withNode(java.lang.String name, java.lang.String... descendants)`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

nodes

private final java.util.Map<java.lang.String,Node> nodes

cycles

private final java.util.Set<java.util.List<java.lang.String>> cycles

currentPath

private final java.util.Stack<Node> currentPath

nextTraversalSequence
```
private int nextTraversalSequence
```

Constructor Detail

GraphAnalyzer

private GraphAnalyzer(java.util.Map<java.lang.String,Node> nodes)

Method Detail
- builder
```
public static GraphAnalyzer.GraphAnalyzerBuilder builder()
```
- withNode
```
public static GraphAnalyzer.GraphAnalyzerBuilder withNode(java.lang.String name,
                                                          java.lang.String... descendants)
```
- analyze
```
private void analyze()
```
  Performs a full traversal of the graph, detecting potential cycles and calculates the full list of descendants of the nodes.
- getTraversalSequence
```
public int getTraversalSequence(java.lang.String name)
```
  Returns the traversal sequence number of the given node. The ascending order of the traversal sequence numbers of multiple nodes represents the depth-first traversal order of those nodes.
  Note: The traversal sequence numbers will only be complete if the graph contains no cycles.
  
  Parameters:
  
  name - the node name to get the traversal sequence number for
  
  Returns:
  
  the traversal sequence number, or -1 if the node doesn't exist or the node was not visited (in case of cycles).
- getCycles
```
public java.util.Set<java.util.List<java.lang.String>> getCycles()
```
- depthFirstSearch
```
private void depthFirstSearch(Node node)
```
- getCurrentCycle
```
private java.util.List<java.lang.String> getCurrentCycle(Node start)
```