Search Java Classes and Packages
#Org.jscience.computing.graph Classes and Interfaces - 85 results found.
| Name | Description | Type | Package | Framework |
| AbstractBaseGraph | The most general implementation of the Graph interface. | Class | org.jscience.computing.graph.graphs | JScience |
| AbstractGraph | A skeletal implementation of the Graph interface, to minimize the effort required to implement graph interfaces. | Class | org.jscience.computing.graph.graphs | JScience |
| AbstractGraphIterator | An empty implementation of a graph iterator to minimize the effort required to implement graph iterators. | Class | org.jscience.computing.graph.iterators | JScience |
| AsUndirectedGraph | An undirected view of the backing directed graph specified in the constructor. | Class | org.jscience.computing.graph.graphs | JScience |
| BreadthFirstIterator | A breadth-first iterator for a directed and an undirected graph. | Class | org.jscience.computing.graph.iterators | JScience |
| ClosestFirstIterator | A closest-first iterator for a directed or undirected graph. | Class | org.jscience.computing.graph.iterators | JScience |
| ConnectedComponentTraversalEvent | A traversal event with respect to a connected component. | Class | org.jscience.computing.graph.events | JScience |
| ConnectivityInspector | Allows obtaining various connectivity aspects of a graph. | Class | org.jscience.computing.graph.algorithms | JScience |
| CrossComponentIterator | Provides a cross-connected-component traversal functionality for iterator subclasses. | Class | org.jscience.computing.graph.iterators | JScience |
| CycleDetector | Performs cycle detection on a graph. | Class | org.jscience.computing.graph.algorithms | JScience |
| DefaultDirectedGraph | A directed graph. | Class | org.jscience.computing.graph.graphs | JScience |
| DefaultDirectedWeightedGraph | A directed weighted graph. | Class | org.jscience.computing.graph.graphs | JScience |
| DefaultEdge | A skeletal implementation of the Edge interface, to minimize the effort required to implement the interface. | Class | org.jscience.computing.graph.edges | JScience |
| DefaultListenableGraph | A graph backed by the the graph specified at the constructor, which can be listened by GraphListeners and by | Class | org.jscience.computing.graph.graphs | JScience |
| DepthFirstIterator | A depth-first iterator for a directed and an undirected graph. | Class | org.jscience.computing.graph.iterators | JScience |
| DijkstraShortestPath | An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator. | Class | org.jscience.computing.graph.algorithms | JScience |
| DirectedEdge | A implementation of directed edge. | Class | org.jscience.computing.graph.edges | JScience |
| DirectedGraph | A graph whose all edges are directed. | Interface | org.jscience.computing.graph | JScience |
| DirectedMultigraph | A directed multigraph. | Class | org.jscience.computing.graph.graphs | JScience |
| DirectedSubgraph | A directed graph that is a subgraph on other graph. | Class | org.jscience.computing.graph.graphs | JScience |
| DirectedWeightedEdge | An implementation of directed weighted edge. | Class | org.jscience.computing.graph.edges | JScience |
| DirectedWeightedMultigraph | A directed weighted multigraph. | Class | org.jscience.computing.graph.graphs | JScience |
| DirectedWeightedSubgraph | A directed weighted graph that is a subgraph on other graph. | Class | org.jscience.computing.graph.graphs | JScience |
| Edge | An edge used with graph objects. | Interface | org.jscience.computing.graph | JScience |
| EdgeFactories | This utility class is a container of various EdgeFactory classes. | Class | org.jscience.computing.graph.edges | JScience |
| EdgeFactories .DirectedEdgeFactory | An EdgeFactory for producing directed edges. | Class | org.jscience.computing.graph.edges | JScience |
| EdgeFactories .DirectedWeightedEdgeFactory | An EdgeFactory for producing directed edges with weights. | Class | org.jscience.computing.graph.edges | JScience |
| EdgeFactories .UndirectedEdgeFactory | An EdgeFactory for producing undirected edges. | Class | org.jscience.computing.graph.edges | JScience |
| EdgeFactories .UndirectedWeightedEdgeFactory | An EdgeFactory for producing undirected edges with weights. | Class | org.jscience.computing.graph.edges | JScience |
| EdgeFactory | An edge factory used by graphs for creating new edges. | Interface | org.jscience.computing.graph | JScience |
| EdgeListFactory | A factory for edge lists. | Interface | org.jscience.computing.graph.graphs | JScience |
| EdgeTraversalEvent | A traversal event for a graph edge. | Class | org.jscience.computing.graph.events | JScience |
| EmptyGraphGenerator | Generates an empty graph of any size. | Class | org.jscience.computing.graph.generators | JScience |
| FibonacciHeap | This class implements a Fibonacci heap data structure. | Class | org.jscience.computing.graph.util | JScience |
| FibonacciHeap .Node | necessary for maintaining the structure of the heap. | Class | org.jscience.computing.graph.util | JScience |
| Graph | The root interface in the graph hierarchy. | Interface | org.jscience.computing.graph | JScience |
| GraphChangeEvent | An event which indicates that a graph has changed. | Class | org.jscience.computing.graph.events | JScience |
| GraphDelegator | A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph. | Class | org.jscience.computing.graph.graphs | JScience |
| GraphEdgeChangeEvent | An event which indicates that a graph edge has changed, or is about to change. | Class | org.jscience.computing.graph.events | JScience |
| GraphGenerator | GraphGenerator defines an interface for generating new graph structures. | Interface | org.jscience.computing.graph.generators | JScience |
| GraphHelper | A collection of utilities to assist the working with graphs. | Class | org.jscience.computing.graph | JScience |
| GraphIterator | Interface | org.jscience.computing.graph.iterators | JScience | |
| GraphListener | A listener that is notified when the graph changes. | Interface | org.jscience.computing.graph.events | JScience |
| GraphVertexChangeEvent | An event which indicates that a graph vertex has changed, or is about to change. | Class | org.jscience.computing.graph.events | JScience |
| JGraphModelAdapter | An adapter that reflects a JGraphT graph as a JGraph graph. | Class | org.jscience.computing.graph.external | JScience |
| JGraphModelAdapter .CellFactory | Creates the JGraph cells that reflect the respective JGraphT elements. | Interface | org.jscience.computing.graph.external | JScience |
| JGraphModelAdapter .DefaultCellFactory | A simple default cell factory. | Class | org.jscience.computing.graph.external | JScience |
| LabeledElement | An graph element (vertex or edge) that can have a label. | Interface | org.jscience.computing.graph | JScience |
| LinearGraphGenerator | Generates a linear graph of any size. | Class | org.jscience.computing.graph.generators | JScience |
| ListenableDirectedGraph | A directed graph which is also ListenableGraph. | Class | org.jscience.computing.graph.graphs | JScience |
| ListenableDirectedWeightedGraph | A directed weighted graph which is also ListenableGraph. | Class | org.jscience.computing.graph.graphs | JScience |
| ListenableGraph | A graph that supports listeners on structural change events. | Interface | org.jscience.computing.graph | JScience |
| ListenableUndirectedGraph | An undirected graph which is also ListenableGraph. | Class | org.jscience.computing.graph.graphs | JScience |
| ListenableUndirectedWeightedGraph | An undirected weighted graph which is also ListenableGraph. | Class | org.jscience.computing.graph.graphs | JScience |
| ModifiableInteger | The ModifiableInteger class wraps a value of the primitive type int in an object, similarly to Integer. | Class | org.jscience.computing.graph.util | JScience |
| Multigraph | A multigraph. | Class | org.jscience.computing.graph.graphs | JScience |
| Pseudograph | A pseudograph. | Class | org.jscience.computing.graph.graphs | JScience |
| RingGraphGenerator | Generates a ring graph of any size. | Class | org.jscience.computing.graph.generators | JScience |
| SimpleDirectedGraph | A simple directed graph. | Class | org.jscience.computing.graph.graphs | JScience |
| SimpleDirectedWeightedGraph | A simple directed weighted graph. | Class | org.jscience.computing.graph.graphs | JScience |
| SimpleGraph | A simple graph. | Class | org.jscience.computing.graph.graphs | JScience |
| SimpleWeightedGraph | A simple weighted graph. | Class | org.jscience.computing.graph.graphs | JScience |
| StrongConnectivityInspector | Complements the ConnectivityInspector class with the capability to compute the strongly connected components of a | Class | org.jscience.computing.graph.algorithms | JScience |
| Subgraph | A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph. | Class | org.jscience.computing.graph.graphs | JScience |
| TopologicalOrderIterator | sort is a permutation p of the vertices of a graph such that an edge (i,j) implies that i appears before j in | Class | org.jscience.computing.graph.iterators | JScience |
| TraversalListener | A listener on graph iterator or on a graph traverser. | Interface | org.jscience.computing.graph.events | JScience |
| TraversalListenerAdapter | An empty do-nothing implementation of the TraversalListener interface used for subclasses. | Class | org.jscience.computing.graph.events | JScience |
| UndirectedEdge | A implementation for an undirected edge. | Class | org.jscience.computing.graph.edges | JScience |
| UndirectedGraph | A graph whose all edges are undirected. | Interface | org.jscience.computing.graph | JScience |
| UndirectedSubgraph | An undirected graph that is a subgraph on other graph. | Class | org.jscience.computing.graph.graphs | JScience |
| UndirectedWeightedEdge | An implementation of undirected weighted edge. | Class | org.jscience.computing.graph.edges | JScience |
| UndirectedWeightedSubgraph | An undirected weighted graph that is a subgraph on other graph. | Class | org.jscience.computing.graph.graphs | JScience |
| UnmodifiableDirectedGraph | A directed graph that cannot be modified. | Class | org.jscience.computing.graph.graphs | JScience |
| UnmodifiableGraph | An unmodifiable view of the backing graph specified in the constructor. | Class | org.jscience.computing.graph.graphs | JScience |
| UnmodifiableUndirectedGraph | An undirected graph that cannot be modified. | Class | org.jscience.computing.graph.graphs | JScience |
| VertexDegreeComparator | Compares two vertices based on their degree. | Class | org.jscience.computing.graph.algorithms.util | JScience |
| VertexFactory | A vertex factory used by graph algorithms for creating new vertices. | Interface | org.jscience.computing.graph | JScience |
| VertexSetListener | A listener that is notified when the graph's vertex set changes. | Interface | org.jscience.computing.graph.events | JScience |
| VertexTraversalEvent | A traversal event for a graph vertex. | Class | org.jscience.computing.graph.events | JScience |
| VisioExporter | Exports a graph to a csv format that can be imported into MS Visio. | Class | org.jscience.computing.graph.external | JScience |
| VisioExporter .VertexNameProvider | Assigns a display name for each of the graph vertices. | Interface | org.jscience.computing.graph.external | JScience |
| WeightedGraph | A tagging interface for a graph whose all edges have weights. | Interface | org.jscience.computing.graph | JScience |
| WeightedMultigraph | A weighted multigraph. | Class | org.jscience.computing.graph.graphs | JScience |
| WeightedPseudograph | A weighted pseudograph. | Class | org.jscience.computing.graph.graphs | JScience |
| WheelGraphGenerator | graph of any size. | Class | org.jscience.computing.graph.generators | JScience |