public class GraphProcessor
extends java.lang.Object
Constructor and Description |
---|
GraphProcessor() |
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<java.lang.Integer> |
bfsSorting(java.util.ArrayList<java.lang.Integer>[] adjStructure,
int v0)
This method sorts the vertices of the given graph according the BFS order.
|
java.util.ArrayList<java.lang.Integer> |
buildTreeDiameterPath(java.util.ArrayList<java.lang.Integer>[] adjStructure)
This method builds the diameter path of a tree.
|
java.util.ArrayList<FlowLayoutEdge> |
calculateBFSTreeEdges(java.util.ArrayList<java.lang.Integer>[] adjStructure,
int startVertex)
This method calculates the BFS-tree edges of a given graph.
|
int |
calculateConnectedComponents(java.util.ArrayList<java.util.ArrayList<java.lang.Integer>> adjStructure,
int[] compVector)
This method calculates connected components of the given graph.
|
public int calculateConnectedComponents(java.util.ArrayList<java.util.ArrayList<java.lang.Integer>> adjStructure, int[] compVector)
adjStructure
- The adjacency structure of the given graph.compVector
- The component characteristic vector.public java.util.ArrayList<FlowLayoutEdge> calculateBFSTreeEdges(java.util.ArrayList<java.lang.Integer>[] adjStructure, int startVertex)
adjStructure
- The adjacency structure representing the given graph.startVertex
- The start vertex.public java.util.ArrayList<java.lang.Integer> buildTreeDiameterPath(java.util.ArrayList<java.lang.Integer>[] adjStructure)
adjStructure
- The adjacency structure representing the given tree.public java.util.ArrayList<java.lang.Integer> bfsSorting(java.util.ArrayList<java.lang.Integer>[] adjStructure, int v0)
adjStructure
- The adjacency structure representing the given graph.v0
- The start vertex.