<<Vilcretas`

GrafoString["Bienvenidos"]

nodos={e,g,a,h,b,f,d,c};
grafo=Grafo[{{a,b},{a,c},{a,d},{a,e},{b,g},{b,h},{c,e},{c,f},{c,g},{d,e},{d,f},{d,g},{d,h},{e,f},{e,g},{e,h},{f,h}},pesos->-{8,4,1,3,10,10,1,4,4,7,6,10,7,1,7,8,3},mostrarpesos->True];
Kruskal[grafo];

Prim[grafo,orden->nodos]

graf=GrafoBipartitoCompleto[10,5]

ArbolQ[graf]

?ArbolQ

gr1=Grafo[{{a,f},{a,g},{a,h},{a,j},{b,c},{b,d},{b,e},{b,h},{b,i},{c,e},{d,f},{e,f},{f,g},{f,j},{i,j}},pesos->-{15,3,16,49,32,41,43,3,1,49,25,28,9,11,48},mostrarpesos->True];

AlDijkstra[gr1, a,g, all->True]

gr1

?AlDijkstra

?LongitudCaminoMC

KnCircuitoEulerQ[21534]

ArbolHuffman["firmamento",optimizado->False,{HileraArbolHuffman["firma", "firmamento", tree->True, optimizado->False]}]

HileraArbolHuffman["firma", "firmamento", tree->True, optimizado->False]

nodos={d,a,f,g,e,b,c,h};

grafo=Grafo[{{a,b},{a,d},{a,e},{a,f},{b,d},{b,e},{b,g},{b,h},{c,d},{c,f},{c,g},{c,h},{d,e},{e,f},{f,g},{f,h},{g,h}},pesos->{6,9,2,4,2,4,1,9,1,8,2,4,4,3,9,3,2},mostrarpesos->True];

BuscarPrimeroAncho[grafo,orden->nodos]

BuscarPrimeroLargo[grafo,orden->nodos]

Sort/@BuscarPrimeroAncho[grafo,orden->nodos]

Sort/@BuscarPrimeroLargo[grafo,orden->nodos]

grafo