Looking for standard Graph Problems with 2 Vertices No…
0 reactions
Looking for standard Graph Problems with 2 Vertices No variations/twists please!
I am looking for standard graph theory / algorithmic problems where the input is a graph and **two target vertices** (e.g., source and destination / pair of nodes).
Some specific examples are:
* **Shortest Path** (standard unweighted/weighted shortest path between $u$ and $v$)
* **Reachability** (checking if $v$ is reachable from $u$)
* **Lowest Common Ancestor (LCA) in a DAG** (given two vertices $u$ and $v$ in a **DAG**)
* **Maximum Flow / Min-Cut** (max flow specifically between a source $s$ and sink $t$)
**Important constraint:** I am strictly looking for **pure problems** without added variations or twists (no dynamic edge weights, no modified state spaces, no constraints like "at most k skips", etc.).
I would love any kind of response. Additionally, if you have links to the problem definition link or benchmark problem sets that fit this exact criteria, please drop them below!
Thanks in advance!
#technology
I am looking for standard graph theory / algorithmic problems where the input is a graph and **two target vertices** (e.g., source and destination / pair of nodes).
Some specific examples are:
* **Shortest Path** (standard unweighted/weighted shortest path between $u$ and $v$)
* **Reachability** (checking if $v$ is reachable from $u$)
* **Lowest Common Ancestor (LCA) in a DAG** (given two vertices $u$ and $v$ in a **DAG**)
* **Maximum Flow / Min-Cut** (max flow specifically between a source $s$ and sink $t$)
**Important constraint:** I am strictly looking for **pure problems** without added variations or twists (no dynamic edge weights, no modified state spaces, no constraints like "at most k skips", etc.).
I would love any kind of response. Additionally, if you have links to the problem definition link or benchmark problem sets that fit this exact criteria, please drop them below!
Thanks in advance!
#technology
| 1,000 mlx | |
| 4 | |
| 0 |