How to write a Graph Algorithm -
trying come-up pseudocode (in latex) algorithm takes 2 graphs input - compares each node in graph - (i fill in comparing function), returns 0 if node 1 graph equal node in other graph, else returns 1. node in graph graph. checking recursive.
what's mean , comparing graphs ? graphs of g1 , g2 same if of vertices
have same weight[value] , |g1| = |g2| . (in simple graphs)
Comments
Post a Comment