CAD ASSIGNMENT PSEUDOCODE FOR VARIOUS ALGORITHM

SUBMITTED BY,

ARUN BABU AM.EN.P2VLD11004 S3 MTECH VLSI AMRITA VISHWAVIDYAPEETHAM

CAD ASSIGNMENT

ARUN BABU (AM.EN.P2VLD11004)

PSEUDOCODE FOR BFS ALGORITHM

bfs(G) list L = empty tree T = empty choose a starting vertex x search(x) while(L nonempty) remove edge (v,w) from start of L if w not yet visited add (v,w) to T search(w)

PSEUDOCODE FOR DFS ALGORITHM

dfs(G) list L = empty tree T = empty choose a starting vertex x search(x) while(L nonempty) remove edge (v,w) from end of L if w not yet visited add (v,w) to T search(w)

Page |1

CAD ASSIGNMENT

ARUN BABU (AM.EN.P2VLD11004)

PSEUDOCODE FOR DIJKSTRA ALGORITHM

function Dijkstra(Graph, source): for each vertex v in Graph: dist[v] := infinity ; // Unknown distance function from source to v previous[v] := undefined ; // Previous node in optimal path from source dist[source] := 0 ; // Distance from source to source Q := the set of all nodes in Graph ; // All nodes in the graph are unoptimized - thus are in Q while Q is not empty: // The main loop // Start node in first case remove u from Q ; if dist[u] = infinity: break ; // all remaining vertices are inaccessible from source for each neighbor v of u: // where v has not yet been removed from Q. alt := dist[u] + dist_between(u, v) ; if alt < dist[v]: dist[v] := alt ; previous[v] := u ; decrease-key v in Q; return dist; // Reorder v in the Queue // Relax (u,v,a) u := vertex in Q with smallest distance in dist[] ; // Initializations

Page |2

CAD ASSIGNMENT

ARUN BABU (AM.EN.P2VLD11004)

PSEUDOCODE FOR FLOYD WARSHALL ALGORITHM

/* Assume a function edgeCost(i,j) which returns the cost of the edge from i to j (Infinity if there is none). Also assume that n is the number of vertices and edgeCost(i,i) = 0 */ int path[][]; /* A 2-dimensional matrix. At each step in the algorithm, path[i][j] is the shortest path from i to j using intermediate vertices (1..k1). path[i][j] is initialized to edgeCost(i,j). */ procedure FloydWarshall () for k := 1 to n for i := 1 to n for j := 1 to n path[i][j] = min ( path[i][j], path[i][k]+path[k][j] ); end end end Each

Page |3

CAD ASSIGNMENT

ARUN BABU (AM.EN.P2VLD11004)

PSEUDOCODE FOR PRIMS ALGORITHM

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 for each v in V color(v) <- WHITE key(v) <- infinity p(v) <- NIL Q <- empty list // Q keyed by key[v] color(s) <- GRAY Insert(Q, s) key(s) <- 0 while Q != empty u <- Extract-Min(Q) for v in Adj[u] then color(v) <- GRAY Insert(Q,v) key(v) <- w(u,v) p(v) <- u elseif color(v) = GRAY then if key(v) > w(u,v) then key(v) <- w(u,v) p(v) <- u color(v) <- BLACK return(p)

Page |4

CAD ASSIGNMENT

ARUN BABU (AM.EN.P2VLD11004)

PSEUDOCODE FOR BRANCH AND BOUND ALGORITHM

public boolean branchAndBound() { upperBound= infinity; eNode= root; initialize queue empty; // Holds children of eNode bound(root); if (root is leaf) { upperBound= cost(root); answer= {root};}; do {generate left and right child at first xi=0 of eNode;bound(left child); // May also generate/prune nodesbound(right child); // May also generate/prune nodesfor each child w of eNode { if (lowerBound(w) < upperBound) { if (w is a leaf) { upperBound= lowerBound(w); answer= {w} }; else { add w to queue; if (upperBound(w) + TOLERANCE < upperBound) upperBound= upperBound(w) + TOLERANCE; }}do { if (queue empty) return;delete eNode from front of queue;} while (lowerBound(eNode) >= upperBound);} while (number of children < maximum number of children);

Page |5

CAD ASSIGNMENT

ARUN BABU (AM.EN.P2VLD11004)

PSEUDOCODE FOR BACK-TRACK ALGORITHM

In order to apply backtracking to a specific class of problems, one must provide the data P for the particular instance of the problem that is to be solved, and six procedural parameters, root, reject, accept, first, next, and output. These procedures should take the instance data P as a parameter and should do the following: 1. root(P): return the partial candidate at the root of the search tree. 2. reject(P,c): return true only if the partial candidate c is not worth completing. 3. accept(P,c): return true if c is a solution of P, and false otherwise. 4. first(P,c): generate the first extension of candidate c. 5. next(P,s): generate the next alternative extension of a candidate, after the extension s. 6. output(P,c): use the solution c of P, as appropriate to the application. The backtracking algorithm reduces then to the call bt(root(P)), where bt is the following recursive procedure: procedure bt(c) if reject(P,c) then return if accept(P,c) then output(P,c) s first(P,c) while s do bt(s) s next(P,s)

Page |6