fork download
copy 
  1. /*
  2. Implementación recusriva DFS
  3. https://g...content-available-to-author-only...b.com/orendon/01cf8cd0794f7869ce16d152c0131c79
  4. 			     A
  5. 			  /     \
  6. 			B         E
  7. 		  /   \      /  \
  8. 		 C     D    F    G
  9. */
  10.  
  11. visited = {}				// para marcar los nodos que ya visitamos
  12. adjacency_list = {			// guardamos los "vecinos/hijos" de cada nodo
  13. 	'A': ['B', 'E'],
  14. 	'B': ['C', 'D'],
  15. 	'C': [],
  16. 	'D': [],
  17. 	'E': ['F', 'G'],
  18. 	'F': [],
  19. 	'G': [],
  20. }
  21.  
  22. function dfs(node){
  23. 	console.log(node);
  24.  
  25. 	visited[node] = true;
  26. 	for (const child of adjacency_list[node]) {
  27. 		if (!visited[child]){
  28. 			dfs(child);
  29. 		}
  30. 	};
  31. }
  32.  
  33.  
  34. dfs('A');
  35.  
Success #stdin #stdout 0.08s 29948KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
A
B
C
D
E
F
G
https://ideone.com/UaPCaH
DFS - Recursivo
language:
Node.js (node 20.14)
created:
4 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!