|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use EdgeSPT | |
|---|---|
| org.javanetworkanalyzer.alg | |
| org.javanetworkanalyzer.analyzers | |
| org.javanetworkanalyzer.model | |
| Uses of EdgeSPT in org.javanetworkanalyzer.alg |
|---|
| Classes in org.javanetworkanalyzer.alg with type parameters of type EdgeSPT | |
|---|---|
class |
BFS<V extends VBFS,E extends EdgeSPT>
Root Breadth First Search (BFS) class. |
class |
BFSForCentrality<E extends EdgeSPT>
Uses BFS to do graph analysis (calculating betweenness centrality, etc.). |
interface |
CentralityAlg<V extends VCent,E extends EdgeSPT,S extends PathLengthData>
Root interface for GraphSearchAlgorithms that do centrality
calculations. |
class |
DFS<V extends VDFS,E extends EdgeSPT>
Root Depth First Search (DFS) class. |
class |
DFSForStrahler<E extends EdgeSPT>
Calculates the Strahler numbers of the nodes in the given tree. |
class |
Dijkstra<V extends VDijkstra,E extends EdgeSPT>
Home-brewed implementation of Dijkstra's algorithm. |
class |
DijkstraForAccessibility<E extends EdgeSPT>
An implementation of Dijkstra's algorithm which can be used to calculate, for each vertex, the (distance to the) closest destination among several possible destinations in an AccessibilityAnalyzer. |
class |
DijkstraForCentrality<E extends EdgeSPT>
An implementation of Dijkstra's algorithm which can be used to calculate betweenness and closeness in a GraphAnalyzer. |
class |
GraphSearchAlgorithm<V extends VPred,E extends EdgeSPT>
Root class for graph search algorithms, including BFS, DFS, Dijkstra, etc., and their modified versions for centrality and connectedness calculations. |
interface |
TraversalAlg<V extends VPred,E extends EdgeSPT>
Interface for algorithms that traverse a graph. |
| Uses of EdgeSPT in org.javanetworkanalyzer.analyzers |
|---|
| Classes in org.javanetworkanalyzer.analyzers with type parameters of type EdgeSPT | |
|---|---|
class |
AccessibilityAnalyzer<E extends EdgeSPT>
Calculates, for each vertex, the (distance to the) closest destination among several possible destinations. |
| Uses of EdgeSPT in org.javanetworkanalyzer.model |
|---|
| Classes in org.javanetworkanalyzer.model with type parameters of type EdgeSPT | |
|---|---|
interface |
EdgeSPT<E extends EdgeSPT>
Interface for edges to be used in a TraversalAlg. |
| Classes in org.javanetworkanalyzer.model that implement EdgeSPT | |
|---|---|
class |
Edge<E extends Edge>
Weighted edge for use in TraversalGraph. |
class |
EdgeCent
An Edge for calculating edge betweenness centrality. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||