grafos

Question 1

BFS (Breadth-First Search)

Answer 1

explorar vecinos depues ir mas profundo. first in first out. queue.

Question 2

DFS (Depth-First Search)

Answer 2

explorar lo mas profundo posible y despues ir volviendo. last in first out. stack o recursion

Question 3

DFS advantages and dis

Answer 3

memory efficient and simple
completeness (loops)

Question 4

BFS advantages and dis

Answer 4

shortest path (unweighted) and completeness (solution exists then it will find)
memory usage and complexity

Question 5

Dijkstra

Answer 5

algorithm that is used to find the shortest path between 2 nodes in a weighted graph

Question 6

definicion

Answer 6

nodos = {a,b,c}
aristas = {(a,b),(a,c)}

Question 7

adyacentes

Answer 7

Vi conecta con Vj si E(Vi,Vj)

Question 8

camino

Answer 8

{(Vi,…),…,(…,Vj)}

Question 9

camino minimo

Answer 9

camino de Vi a Vj mas chico

Question 10

loop

Answer 10

arista (Vi,Vi)

Question 11

ciclo

Answer 11

{(Vi,…),…,(…,Vi)}

Question 12

grado saliente

Answer 12

cant de aristan que salen del nodo

Question 13

grado entrante

Answer 13

cant de aristan que entran del nodo

Question 14

tamanio del grafo

Answer 14

|nodos|

Question 15

diametro del grafo

Answer 15

maximo de los caminos minimos

Question 16

conexo

Answer 16

todos los nodos estan conectados (siempre hay camino de un nodo a otros)

Question 17

regulares

Answer 17

todos los nodos tienen el mismo grado

Question 18

completos

Answer 18

E(Vi,Vj) para todo Vi,Vj

Question 19

pesados

Answer 19

las aristas tienen peso