Package com.azure.resourcemanager.resources.fluentcore.dag

Class Graph<DataT,NodeT extends Node<DataT,NodeT>>

java.lang.Object

com.azure.resourcemanager.resources.fluentcore.dag.Graph<DataT,NodeT>

Type Parameters:

DataT - the type of the data stored in the graph's nodes

NodeT - the type of the nodes in the graph

Direct Known Subclasses:

DAGraph

public class Graph<DataT,NodeT extends Node<DataT,NodeT>>
extends Object

Type representing a directed graph data structure.

Each node in a graph is represented by Node

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
protected static enum	Graph.EdgeType	The edge types in a graph.
protected static interface	Graph.Visitor<U>	Represents a visitor to be implemented by the consumer who want to visit the graph's nodes in DFS order by calling visit method.

Field Summary

Fields

Modifier and Type	Field	Description
protected Map<String,NodeT>	nodeTable	the nodes in the graph.

Constructor Summary

Constructors

Constructor	Description
Graph()	Creates a directed graph.

Method Summary

Modifier and Type	Method	Description
void	addNode(NodeT node)	Adds a node to this graph.
protected String	findPath(String start, String end)	Find the path.
Collection<NodeT>	getNodes()	Gets all nodes in the graph.
void	visit(Graph.Visitor<Node<DataT,NodeT>> visitor)	Perform DFS visit in this graph.

Methods inherited from class java.lang.Object

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

Field Details

nodeTable

protected Map<String,NodeT extends Node<DataT,NodeT>> nodeTable

the nodes in the graph.

Constructor Details

Graph

public Graph()

Creates a directed graph.

Method Details

getNodes

public Collection<NodeT> getNodes()

Gets all nodes in the graph.

Returns:

all nodes in the graph.

addNode

public void addNode(NodeT node)

Adds a node to this graph.

Parameters:

node - the node

visit

public void visit(Graph.Visitor<Node<DataT,NodeT>> visitor)

Perform DFS visit in this graph.

The directed graph will be traversed in DFS order and the visitor will be notified as search explores each node and edge.

Parameters:

visitor - the graph visitor

findPath

protected String findPath(String start,
 String end)

Find the path.

Parameters:

start - key of first node in the path

end - key of last node in the path

Returns:

string containing the nodes keys in the path separated by arrow symbol