# Graph.path() method · @imqueue/pg-sequelize

Source: https://imqueue.org/api/pg-sequelize/latest/pg-sequelize.graph.path/
Published: 2026-08-01
Author: @imqueue maintainers (https://github.com/imqueue)
Package: @imqueue/pg-sequelize 4.2.0 — generated reference, not hand-written

Every vertex reachable from one vertex, in the order a depth-first walk finds them.

**Signature:**

```typescript
path(vertex: T): IterableIterator<T>;
```

## Parameters


| Parameter | Type | Description |
| --- | --- | --- |
| vertex | T | Vertex to start from. |


**Returns:**

IterableIterator<T>

An iterator over the reachable vertices.

## Remarks

The reachable SET, not the longest path — each vertex appears once however many routes lead to it, and the starting vertex is the first entry. Reading it as a path is what makes a cyclic graph look as though it terminates.