Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/codemistic/Data-Structures-and-Algorithms
/ e
Function
e
CSES/Intro/GridPaths.cc:9–9 ·
view source on GitHub ↗
pruning
Source
from the content-addressed store, hash-verified
7
8
// pruning
9
bool e(int i,int j) { return (i >= 0 && i < 7 && j < 7 && j >=0 && !vis[i][j]); }
10
11
void dfs(int i,int j,int idx) {
12
if (i == 6 && j == 0) {
Callers
1
dfs
Function · 0.85
Calls
no outgoing calls
Tested by
no test coverage detected