# \#path-counting

**URL:** https://swi-prolog.discourse.group/tag/path-counting/131.md

[Latest](https://swi-prolog.discourse.group/latest.md) · [Categories](https://swi-prolog.discourse.group/categories.md) · [Tags](https://swi-prolog.discourse.group/tags.md)

---

## [A simple but powerful generalization of path counting in rectangular grid graphs](https://swi-prolog.discourse.group/t/a-simple-but-powerful-generalization-of-path-counting-in-rectangular-grid-graphs/5906)

<div class="topic-metadata">

**Author:** [@kuniaki.mukai](https://swi-prolog.discourse.group/u/kuniaki.mukai)\
**Replies:** 0\
**Last updated:** [October 31, 2022, 3:35pm UTC](https://swi-prolog.discourse.group/t/a-simple-but-powerful-generalization-of-path-counting-in-rectangular-grid-graphs/5906 "2022-10-31T15:35:33Z")

</div>

Edit: 2022/11/04 For just a fun, I selected randomly 100 undirected graphs with source and target in a fixed set of ten nodes, and count paths for each graph. The result is below, in which most of graphs have not a pa…