Rust · WebAssemblyDiscovery
Directly-Follows Graph (Rust)
run.promenade.dfg-rs
Discovers a directly-follows graph from an event log: for every pair of activities that occur back-to-back within a case, the number of times it happens, plus per-case start/end activities and per-activity frequency. Promenade's first Promenade Compute plugin — the package also ships a wasm32-wasip1 build of the same algorithm, run through Wasmtime by a compute engine instead of a browser worker.
Produces
- DFG
Runtimes
- Rust · WebAssemblyCompiled to WebAssembly, runs in the page or on an engine
Versions
| Version | Released | Size | Notes |
|---|---|---|---|
| 0.1.1latest | 18 Sept 2026 | 111 KB | Corrected the homepage/repository URLs: the plugins live in one repository, promenade-pi/plugins, not one repository per plugin under an organisation that was never created. Metadata only — no functional change. |
| 0.1.0 | 25 Aug 2026 | 111 KB | Initial release: discovers a directly-follows graph from an event log — the frequency of every back-to-back activity pair within a case, plus per-case start/end activities and per-activity frequency. |