tema 6 teoria

GRAFOS

g1' = mkGraphEdges [1,2,3,4] [(1,2), (1,3), (2,3), (3,4)]
siendo los primeros vertices y los otros las relaciones entre ellos

Graph -- data Graph a = ...
Edge -- type Edge a = (a,a)
Path -- type Path a = [a]
mkGraphSuc -- :: [a] -> (a -> [a]) -> Graph a
mkGraphEdges -- :: (Eq a) => [a] -> [Edge a] ->
successors -- :: Graph a -> a -> [a]
vertices -- :: Graph a -> [a]
edges -- :: (Eq a) => Graph a -> [Edge a]
degree -- :: Graph a -> a -> Int

recorrido en profundidad (DFT)
... ya rellenare, para mas informacion ver matematicas discretas