Directed | algorithms-ts

The Directed class represents a data type for determining the vertices reachable from a given source vertex s (or set of source vertices) in a digraph.

For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Type parameters

V

Hierarchy

Directed

Implemented by

DirectedDFS

Index

Methods

count
marked

Methods

count

count(): number

- Defined in graphs/api.ts:342
Returns the number of vertices reachable from the source vertex (or source vertices).

Returns number

the number of vertices reachable from the source vertex (or source vertices).

marked

marked(v: Vertex<V>): boolean

- Defined in graphs/api.ts:337
Is there a directed path from the source vertex (or any of the source vertices) and vertex v?

Parameters
- v: Vertex<V>
  
  the vertex
Returns boolean

true if there is a directed path, false otherwise.

Generated using TypeDoc