Problems and solutions
All these videos used a undirected graph. Would the process and psuedo code be different if it was a directed graph?
7 Matching Annotations
- Jul 2023
-
dsc-courses.github.io dsc-courses.github.ioGraphs1
-
-
dsc-courses.github.io dsc-courses.github.io
-
priority values
how do we distinguish the priority values?
-
rotateLeft(G)
can we think of this as similar to transpose for matrixes or like rotating all the values like in an axis? Its a trend I see at least up until now
-
-
dsc-courses.github.io dsc-courses.github.io
-
All strings not using the current character, and before the current string in the alphabet.
if we started with a, do we still have to write that we have a left child? technically we dont?
-
existing nodes rather than creating new leaves
how would you write the separation of these new nodes on paper? in the diagram they are just spaces but is there a way to do it through punctuation?
-
-
dsc-courses.github.io dsc-courses.github.io
-
Node<Integer> n2 = new Node<>(2, n3); n1.next = n2;
could we repeat node values? so adding a new line where we have n3.next = n1; ie what if we wanted the same value for the node next to n3 as the value for n1
-
We need to shift all the following elements down by 1
What would happen to the first element? are we getting rid of it?
-