VerticesHaveEdgesAnalyzer (GTF 2.0.1 API)

java.lang.Object
- science.aist.gtf.graph.analyzer.VerticesHaveEdgesAnalyzer<V,E>

Type Parameters:

V - the type of the decorated vertex value

E - the type of the decorated edge value

All Implemented Interfaces:

GraphAnalyzer<V,E,Boolean>
```
public class VerticesHaveEdgesAnalyzer<V,E>
extends Object
implements GraphAnalyzer<V,E,Boolean>
```
Analyzes if every vertex in the graph has at least a single edge

Since:

1.0

Author:

Andreas Pointner

- Constructor Summary
  
  Constructors
  Constructor Description
  
  VerticesHaveEdgesAnalyzer()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  Boolean analyzeGraphState(GraphStateAccessor<V,E> graphStateAccessor)
  Analyzes a graph state
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - VerticesHaveEdgesAnalyzer
```
public VerticesHaveEdgesAnalyzer()
```
- Method Detail
  - analyzeGraphState
```
public Boolean analyzeGraphState(GraphStateAccessor<V,E> graphStateAccessor)
```
    Description copied from interface: GraphAnalyzer
    
    Analyzes a graph state
    
    Specified by:
    
    analyzeGraphState in interface GraphAnalyzer<V,E,Boolean>
    
    Parameters:
    
    graphStateAccessor - the graph state to be analyzed
    
    Returns:
    
    the analyze result