Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.graph Classes and Interfaces - 38 results found.
NameDescriptionTypePackageFramework
ArcAn arc is an ordered pair of vertices.Interfacecom.numericalmethod.suanshu.graphSuanShu
BFSThis class implements the breadth-first-search using iteration.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
BFS .NodeThis is a node in a BFS-spanning tree.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
BottomUpThis implementation traverses a directed acyclic graph starting from the leaves at the bottom, and reaches the roots.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
DAGraphA directed acyclic graph (DAG), is a directed graph with no directed cycles.Interfacecom.numericalmethod.suanshu.graphSuanShu
DFSThis class implements the depth-first-search using iteration.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
DFS .NodeThis is a node in a DFS-spanning tree.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
DFS .Node .ColorThis is the coloring scheme of visits.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
DiGraphA directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them.Interfacecom.numericalmethod.suanshu.graphSuanShu
EdgeAn edge connects a pair of vertices.Interfacecom.numericalmethod.suanshu.graphSuanShu
EdgeBetweenessThe edge betweenness centrality is defined as the number of the shortest paths that go through an edge in a graph or network.Classcom.numericalmethod.suanshu.graph.communitySuanShu
ForestA forest is a disjoint union of trees.Interfacecom.numericalmethod.suanshu.graphSuanShu
GirvanNewmanClasscom.numericalmethod.suanshu.graph.communitySuanShu
GirvanNewman .EdgeBetweenessCtorThis allows customization of the computation of edge-betweeness.Interfacecom.numericalmethod.suanshu.graph.communitySuanShu
GirvanNewmanUnDiGraphClasscom.numericalmethod.suanshu.graph.communitySuanShu
GraphA graph is a representation of a set of objects where some pairs of the objects are connected by links.Interfacecom.numericalmethod.suanshu.graphSuanShu
GraphTraversalA spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G.Interfacecom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
GraphTraversal .NodeThis is a node in a spanning tree.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
GraphUtilsThese are the utility functions to manipulate Graph.Classcom.numericalmethod.suanshu.graphSuanShu
GraphUtils .EdgeFactoryThis interface specifies how an edge is created for two nodes.Interfacecom.numericalmethod.suanshu.graphSuanShu
GraphUtils .GraphFactoryThe factory to construct instances of the graph type.Interfacecom.numericalmethod.suanshu.graphSuanShu
HyperEdgeA hyper-edge connects a set of vertices of any size.Interfacecom.numericalmethod.suanshu.graphSuanShu
RootedTreeA rooted tree is a directed graph, and has a root to measure distance from theSee Also:Wikipedia: Simple graphInterfacecom.numericalmethod.suanshu.graphSuanShu
ShortestPathIn graph theory, a shortest path algorithm finds a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.Interfacecom.numericalmethod.suanshu.graph.algorithm.shortestpathSuanShu
SimpleArcA simple arc has two vertices: head and tail.Classcom.numericalmethod.suanshu.graph.typeSuanShu
SimpleEdgeA simple edge has two vertices.Classcom.numericalmethod.suanshu.graph.typeSuanShu
SparseDAGraphThis class implements the sparse directed acyclic graph representation.Classcom.numericalmethod.suanshu.graph.typeSuanShu
SparseDiGraphThis class implements the sparse directed graph representation.Classcom.numericalmethod.suanshu.graph.typeSuanShu
SparseGraphThis class implements the sparse graph representation.Classcom.numericalmethod.suanshu.graph.typeSuanShu
SparseTreeThis class implements the sparse tree representation.Classcom.numericalmethod.suanshu.graph.typeSuanShu
SparseUnDiGraphThis class implements the sparse undirected graph representation.Classcom.numericalmethod.suanshu.graph.typeSuanShu
TraversalFromRootsA graph traversal is the problem of visiting all the nodes in a graph in a particular manner.Classcom.numericalmethod.suanshu.graph.algorithm.traversalSuanShu
TreeA tree is an undirected graph in which any two vertices are connected by exactly one simple path.Classcom.numericalmethod.suanshu.graphSuanShu
UnDiGraphAn undirected graph is a graph, or set of nodes connected by edges, where an edge does not differentiate between (a, b) or (b, a).Interfacecom.numericalmethod.suanshu.graphSuanShu
UndirectedEdgeA tagging interface for implementations of an undirected graph that accept only undirected edges.Interfacecom.numericalmethod.suanshu.graphSuanShu
VertexTreeA VertexTree is both a tree and a vertex/node.Classcom.numericalmethod.suanshu.graph.typeSuanShu
WeightedArcA weighted arc is an arc that has a weight or a cost associated with it.Interfacecom.numericalmethod.suanshu.graphSuanShu
WeightedEdgeA weighted edge has a weight or a cost associated with it.Interfacecom.numericalmethod.suanshu.graphSuanShu