void dfs(int node, int parent){
preorder[node] = ctr++;
ssize[node] = 1;
for (int i : adjlist[node]) {
if (i == parent) continue;
dfs(i, node);
}
end1[node] = ctr - 1;
}| Code Example |
|---|
| Cpp :: how to make a c++ iostream program restart when finished |
| Cpp :: qt graphics scene map cursor position |
| C :: boilerplate c |
| C :: C output color font |
| C :: malloc is undefined |
| C :: clear screen c |
| C :: random number between 2 in C |
| C :: buble sort c |
| C :: Sorting number excluding elements in highest to lowest |
| C :: haskell print |
| C :: disable lua errors |
| C :: execution time of c program |
| C :: restart nginx in alpine linix |
| C :: binary search in c |
| C :: how to shutdown system c++ |
| C :: input in c |
| C :: 0/1 knapsack problem in c |
| C :: c number to string |
| C :: recursion to convert decimal to binary |
| C :: C read a character |
| C :: c syntax |
| C :: how to print sizes of various data types of C |
| C :: how to delete virtual hard disk virtualbox |
| C :: enable disable audio listener unity |
| C :: bd number regex |
| C :: server client tcp in C |
| C :: declare variables arduino |
| C :: qtableview get selected row |
| C :: #0000ff |
| C :: increment and decrement operator |