Search Java Classes and Packages
#Com.numericalmethod.suanshu.graph Classes and Interfaces - 38 results found.
| Name | Description | Type | Package | Framework |
| Arc | An arc is an ordered pair of vertices. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| BFS | This class implements the breadth-first-search using iteration. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| BFS .Node | This is a node in a BFS-spanning tree. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| BottomUp | This implementation traverses a directed acyclic graph starting from the leaves at the bottom, and reaches the roots. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DAGraph | A directed acyclic graph (DAG), is a directed graph with no directed cycles. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| DFS | This class implements the depth-first-search using iteration. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DFS .Node | This is a node in a DFS-spanning tree. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DFS .Node .Color | This is the coloring scheme of visits. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DiGraph | A directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| Edge | An edge connects a pair of vertices. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| EdgeBetweeness | The edge betweenness centrality is defined as the number of the shortest paths that go through an edge in a graph or network. | Class | com.numericalmethod.suanshu.graph.community | SuanShu |
| Forest | A forest is a disjoint union of trees. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| GirvanNewman | Class | com.numericalmethod.suanshu.graph.community | SuanShu | |
| GirvanNewman .EdgeBetweenessCtor | This allows customization of the computation of edge-betweeness. | Interface | com.numericalmethod.suanshu.graph.community | SuanShu |
| GirvanNewmanUnDiGraph | Class | com.numericalmethod.suanshu.graph.community | SuanShu | |
| Graph | A graph is a representation of a set of objects where some pairs of the objects are connected by links. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| GraphTraversal | A 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. | Interface | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| GraphTraversal .Node | This is a node in a spanning tree. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| GraphUtils | These are the utility functions to manipulate Graph. | Class | com.numericalmethod.suanshu.graph | SuanShu |
| GraphUtils .EdgeFactory | This interface specifies how an edge is created for two nodes. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| GraphUtils .GraphFactory | The factory to construct instances of the graph type. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| HyperEdge | A hyper-edge connects a set of vertices of any size. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| RootedTree | A rooted tree is a directed graph, and has a root to measure distance from theSee Also:Wikipedia: Simple graph | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| ShortestPath | In 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. | Interface | com.numericalmethod.suanshu.graph.algorithm.shortestpath | SuanShu |
| SimpleArc | A simple arc has two vertices: head and tail. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| SimpleEdge | A simple edge has two vertices. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| SparseDAGraph | This class implements the sparse directed acyclic graph representation. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| SparseDiGraph | This class implements the sparse directed graph representation. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| SparseGraph | This class implements the sparse graph representation. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| SparseTree | This class implements the sparse tree representation. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| SparseUnDiGraph | This class implements the sparse undirected graph representation. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| TraversalFromRoots | A graph traversal is the problem of visiting all the nodes in a graph in a particular manner. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| Tree | A tree is an undirected graph in which any two vertices are connected by exactly one simple path. | Class | com.numericalmethod.suanshu.graph | SuanShu |
| UnDiGraph | An undirected graph is a graph, or set of nodes connected by edges, where an edge does not differentiate between (a, b) or (b, a). | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| UndirectedEdge | A tagging interface for implementations of an undirected graph that accept only undirected edges. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| VertexTree | A VertexTree is both a tree and a vertex/node. | Class | com.numericalmethod.suanshu.graph.type | SuanShu |
| WeightedArc | A weighted arc is an arc that has a weight or a cost associated with it. | Interface | com.numericalmethod.suanshu.graph | SuanShu |
| WeightedEdge | A weighted edge has a weight or a cost associated with it. | Interface | com.numericalmethod.suanshu.graph | SuanShu |