Descripción
Devuelve el grado de un nodo de un grafo no dirigido o los
grados de entrada, salida, total y neto de un nodo en un digrafo en la forma [g-(n),g+(n),g_t(n),g_n(n)]
Cadena de entrada
gr_grado
Cadena de salida
GRAFO.grado
Uso
gr_nodo(<grafo>,<idx|etiqueta>)
Ejemplos
gr_nuevo([[0,0,1,0,0,0,0,0,0],[0,0,0,1,0,0,0,0,0],[1,0,0,1,1,0,0,0,0],[0,1,1,0,0,1,0,0,0],[0,0,1,0,0,1,1,0,0],[0,0,0,1,1,0,0,1,0],[0,0,0,0,1,0,0,0,1],[0,0,0,0,0,1,0,0,0],[0,0,0,0,0,0,1,0,0]],falso)
Salida en JMEScriptGUI con visor de grafos v0.1:
eval(enumerar(sucesion(gr_grado(g,n),n,0,gr_orden(g)--),g><'etiquetas'),g,gr_nuevo([[0,0,1,0,0,0,0,0,0],[0,0,0,1,0,0,0,0,0],[1,0,0,1,1,0,0,0,0],[0,1,1,0,0,1,0,0,0],[0,0,1,0,0,1,1,0,0],[0,0,0,1,1,0,0,1,0],[0,0,0,0,1,0,0,0,1],[0,0,0,0,0,1,0,0,0],[0,0,0,0,0,0,1,0,0]],falso))
VectorEvaluado: | 'v0' 1 | | 'v1' 1 | | 'v2' 3 | | 'v3' 3 | | 'v4' 3 | | 'v5' 3 | | 'v6' 2 | | 'v7' 1 | | 'v8' 1 |
gr_nuevo([[0,1,0,0,0,0,0,0],[0,0,1,0,1,1,0,0],[0,0,0,1,0,0,1,0],[0,0,1,0,0,0,0,1],[1,0,0,0,0,1,0,0],[0,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0],[0,0,0,1,0,0,1,0]],['a','b','c','d','e','f','g','h'],verdadero)
Salida en JMEScriptGUI con visor de grafos v0.1:
enumerar(gr_grado(gr_nuevo([[0,1,0,0,0,0,0,0],[0,0,1,0,1,1,0,0],[0,0,0,1,0,0,1,0],[0,0,1,0,0,0,0,1],[1,0,0,0,0,1,0,0],[0,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0],[0,0,0,1,0,0,1,0]],['a','b','c','d','e','f','g','h'],verdadero),'f'),['g-','g+','g_t','g_n'])
VectorEvaluado: | 'g-' 3 | | 'g+' 1 | | 'g_t' 4 | | 'g_n' 2 |
Grados del nodo 'd':enumerar(gr_grado(gr_nuevo([[0,1,0,0,0,0,0,0],[0,0,1,0,1,1,0,0],[0,0,0,1,0,0,1,0],[0,0,1,0,0,0,0,1],[1,0,0,0,0,1,0,0],[0,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0],[0,0,0,1,0,0,1,0]],['a','b','c','d','e','f','g','h'],verdadero),'d'),['g-','g+','g_t','g_n'])
VectorEvaluado: | 'g-' 2 | | 'g+' 2 | | 'g_t' 4 | | 'g_n' 0 |
Véase también…
Desde / Última modificación
v0.6.2.0