i think the edges in the graph can change but the total edge cost cannot change. Any don't agree?
Type: Posts; User: iamnew
i think the edges in the graph can change but the total edge cost cannot change. Any don't agree?
I don't get your point?
I think it will not give different MST's when the starting vertex is changed
Please help.
can Prim’s yieeld different MST’s dependiing on which verteex was set as the startting point?
Okay if all the edges are unique then will the minimum spanning tree obtained be be the same as the shortest path tree?
I think it's the same
Am i correct?
Can someone please give me an example where the minimum spanning tree obtained is not the shortest path distance between two vertices.
Please help.
are you sure that the algorithm runs for graph's containing negative edge's?
What property of the graph will result in prim's and kruskal's algorithm giving different minimum spanning tree's?
Please help.
I have seen the server code bind to a socket. Why doesn't the client have to bind to a socket?
Is the proof of runtime similar to Dijkstra's proof?
Please help.
anyone else knows the answer? Please help. I am a noob in this field.
Why is the breath first search algorithm is considered to be the most efficient shortest path algorithm for unweighted graphs?
Please help.
Prim(G, w, s)
//Input: undirected connected weighted graph G = (V,E) in adj list representation,
source vertex s in V
//Output: p[1..|V|], representing the set of edges composing an MST of G
01...
Which algorithm is best suited to find the minimum spanning tree
Kruskal algorithm or prim's algorithm?
Which has the lowest time complexity?
Please help.
T(n) = T(n/4) + T(n/2) + n2
The root of the tree that we get from the above recurrence relation is n2
Why is that?
Please help.
is there a good tutorial (Or a book that explains all of the above ) that shows me what happens to the memory layout when you make a pipe between processes and when you redirect input using dup...
after the fork code if process B has code which is different from that of A
then will process B have it's own code and data segment
and files_struct for process B
now imagine i have a program running
let the name of this process be process A
the following will be found in this process memory region
Process A's data and code
files_struct for process...
what's the use of passing an environment array?
int execve(const char *pathname, char *const argv[], char *const envp []);
i know what to pass for the first two parameters, but for envp i don't know what to pass.
Please help me.
say if you have a code like this
int a=4;
if(a){
}
else{
}
Can't you use a parse tree to validate syntax?
now the above rules can be defined using backus naur form. So how do i store these rules in a program so that these rules can be used later to check for syntax validity?
i cannot understand can someone please explain a bit more. How do you create parse tree's for while statements?
int a=33;
int b=111;
double c=123.23;
while(a>0){
a--;
}
in a programing language how do you represent grammer rules?
For example
say we have a hypothetical programming language called ABED
ABED can have only one type of loop. And it's a while...