com.jn.langx.util.collection.graph

类 Graphs

java.lang.Object

com.jn.langx.util.collection.graph.Graphs

public class Graphs
extends Object

字段概要

字段

限定符和类型	字段和说明
static BreadthFirstGraphTraverser	BFS
static DeepFirstGraphTraverser	DFS
static TreeGraphTraverser	TDFS

构造器概要

构造器

构造器和说明
Graphs()

方法概要

限定符和类型	方法和说明
static void	beginVisit(Map<String,VisitStatus> statusMap, String name)
static <T> List<Vertex<T>>	bfsSort(Graph<T> graph)
static <T> List<Vertex<T>>	bfsSort(Graph<T> graph, String vertexName)
static List<String>	detectCycle(Vertex vertex)
static List<String>	detectCycle(Vertex vertex, Map<String,VisitStatus> vertexStateMap) This method will be called when an edge leading to given vertex was added and we want to check if introduction of this edge has not resulted in apparition of cycle in the graph
static <T> List<Vertex<T>>	dfsSort(Graph<T> graph)
static <T> List<Vertex<T>>	dfsSort(Graph<T> graph, String vertexName)
static void	finishVisit(Map<String,VisitStatus> statusMap, String name)
static VisitStatus	getVisitStatus(Map<String,VisitStatus> statusMap, String name)
static List<String>	hasCycle(Graph graph)
static boolean	isNotVisited(Map<String,VisitStatus> statusMap, String name)
static boolean	isVisiting(Map<String,VisitStatus> statusMap, String name)
static Map<String,VisitStatus>	newVisitStatusMap()
static <T> List<Vertex<T>>	sort(GraphTraverser traverser, Graph<T> graph)
static <T> List<Vertex<T>>	sort(GraphTraverser traverser, Graph<T> graph, String vertexName)
static <T> List<Vertex<T>>	tdfsSort(Graph<T> graph)
static <T> List<Vertex<T>>	tdfsSort(Graph<T> graph, String vertexName)
static <T> void	traverse(GraphTraverser traverser, Graph<T> graph, String vertexName, VertexConsumer<T> consumer)
static <T> void	traverse(GraphTraverser traverser, Graph<T> graph, VertexConsumer<T> consumer)

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

字段详细资料

DFS

public static final DeepFirstGraphTraverser DFS

TDFS

public static final TreeGraphTraverser TDFS

BFS

public static final BreadthFirstGraphTraverser BFS

构造器详细资料

Graphs

public Graphs()

方法详细资料

newVisitStatusMap

public static Map<String,VisitStatus> newVisitStatusMap()

getVisitStatus

public static VisitStatus getVisitStatus(Map<String,VisitStatus> statusMap,
                                         String name)

isNotVisited

public static boolean isNotVisited(Map<String,VisitStatus> statusMap,
                                   String name)

isVisiting

public static boolean isVisiting(Map<String,VisitStatus> statusMap,
                                 String name)

beginVisit

public static void beginVisit(Map<String,VisitStatus> statusMap,
                              String name)

finishVisit

public static void finishVisit(Map<String,VisitStatus> statusMap,
                               String name)

hasCycle

public static List<String> hasCycle(Graph graph)

detectCycle

public static List<String> detectCycle(Vertex vertex,
                                       Map<String,VisitStatus> vertexStateMap)

This method will be called when an edge leading to given vertex was added and we want to check if introduction of this edge has not resulted in apparition of cycle in the graph

参数:

vertex -

vertexStateMap -

detectCycle

public static List<String> detectCycle(Vertex vertex)

traverse

public static <T> void traverse(GraphTraverser traverser,
                                Graph<T> graph,
                                VertexConsumer<T> consumer)

traverse

public static <T> void traverse(@NonNull
                                GraphTraverser traverser,
                                Graph<T> graph,
                                String vertexName,
                                VertexConsumer<T> consumer)

sort

public static <T> List<Vertex<T>> sort(@NonNull
                                       GraphTraverser traverser,
                                       Graph<T> graph)

sort

public static <T> List<Vertex<T>> sort(@NonNull
                                       GraphTraverser traverser,
                                       Graph<T> graph,
                                       String vertexName)

dfsSort

public static <T> List<Vertex<T>> dfsSort(Graph<T> graph)

dfsSort

public static <T> List<Vertex<T>> dfsSort(Graph<T> graph,
                                          String vertexName)

tdfsSort

public static <T> List<Vertex<T>> tdfsSort(Graph<T> graph)

tdfsSort

public static <T> List<Vertex<T>> tdfsSort(Graph<T> graph,
                                           String vertexName)

bfsSort

public static <T> List<Vertex<T>> bfsSort(Graph<T> graph,
                                          String vertexName)

bfsSort

public static <T> List<Vertex<T>> bfsSort(Graph<T> graph)