Uses of Class
org.drip.graph.core.Network

Packages that use Network

Package	Description
org.drip.graph.adjacencymatrix	Adjacency Matrix Representation of Graph
org.drip.graph.astar	A* Heuristic Shortest Path Family
org.drip.graph.connectivity	Graph Connectivity and Connected Components
org.drip.graph.core	Vertexes, Edges, Trees, and Graphs
org.drip.graph.mst	Agnostic Minimum Spanning Tree Properties
org.drip.graph.search	BFS, DFS, and Ordered Vertexes

Uses of Network in org.drip.graph.adjacencymatrix

Methods in org.drip.graph.adjacencymatrix with parameters of type Network

Modifier and Type	Method	Description
boolean	GkToR1.bounded(Network<java.lang.Double> graphNetwork)	Indicate if the G2 Map is bounded based on the L2 Metric
double	GkLinearOperator.evaluate(Network<java.lang.Double> graphNetwork, java.lang.String vertexName)	Evaluate the Value across the Specified Graph Vertex
double	GkToR1.evaluate(Network<java.lang.Double> graphNetwork)	Evaluate the Value across all the Graph Vertexes
GuoWangLi2019Bound	GkLinearOperator.guoWangLi2019SpectralRadiusUpperBound(Network<java.lang.Double> graphNetwork, int k)	Compute the GuoWangLi2019Bound Instance
double	GkToR1.norm(Network<java.lang.Double> graphNetwork)	Evaluate the Norm across all the Graph Vertexes

Uses of Network in org.drip.graph.astar

Methods in org.drip.graph.astar with parameters of type Network

Modifier and Type	Method	Description
boolean	FHeuristic.isConsistent(Network<?> graph, Edge edge)	Indicate if the Heuristic is Consistent
boolean	FHeuristic.isMonotone(Network<?> graph, Edge edge)	Indicate if the Heuristic is Monotone
double	FHeuristic.reducedWeight(Network<?> graph, Edge edge)	Compute the Reduced Weight of the Edge

Uses of Network in org.drip.graph.connectivity

Methods in org.drip.graph.connectivity that return Network

Modifier and Type	Method	Description
Network<?>	Kosaraju.graph()	Retrieve the Network Graph

Constructors in org.drip.graph.connectivity with parameters of type Network

Constructor	Description
Kosaraju(Network<?> graph)	Kosaraju Constructor

Uses of Network in org.drip.graph.core

Subclasses of Network in org.drip.graph.core

Modifier and Type	Class	Description
class	CompleteBipartite<V>	CompleteBipartite implements a Complete, Bipartite Graph.
class	Directed<V>	Directed implements the Vertex/Edge Topology corresponding to a Directed Graph.
class	NDimensionalHypercube<V>	NDimensionalHypercube implements an n-dimensional Hyper-cube Graph.
class	Tree<V>	Tree holds the Vertexes and the Edges associated with a Tree.

Methods in org.drip.graph.core with parameters of type Network

Modifier and Type	Method	Description
PriorityQueue<java.lang.Double,Edge>	Tree.edgePriorityQueue(Network<?> network, boolean minHeap)	Construct and Retrieve the Edge Priority Queue from the Graph

Uses of Network in org.drip.graph.mst

Subclasses of Network in org.drip.graph.mst

Modifier and Type	Class	Description
class	CompleteRandomGraph<V>	CompleteRandomGraph implements the Expected Size Metrics for a Complete Graph with Randomly Distributed Weights and non-zero Count of Vertexes.

Uses of Network in org.drip.graph.search

Methods in org.drip.graph.search that return Network

Modifier and Type	Method	Description
Network<?>	BreadthFirst.network()	Retrieve the Graph Network
Network<?>	DepthFirst.network()	Retrieve the Graph Network

Constructors in org.drip.graph.search with parameters of type Network

Constructor	Description
BreadthFirst(Network<?> network)	BreadthFirst Constructor
DepthFirst(Network<?> network)	DepthFirst Constructor