Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
PRESENTADO POR:
Adrian Rosas
Jaime Díaz
David Vega
transporte público masivo
en autobuses tipo BTR (Bus
de Tránsito Rápido)
1 Reten sur
2 Hongos
3 San Francisco
4 Cuidad Jardín
1 5 Libertadores
6 Cooservicios
7 Centro
4 5 9 8 Fuente
2 9 Altamira
3
10 El Roble
8 11 Glorieta
12
7
6 13 11
10
14
15
12 Terminal 18
13 San Antonio 16
14 Patriotas 19
15 UPTC
16 Unicentro
17 Santo Tomas
17
18 J. J Camacho 20
19 Asís
20 Muiscas 21
21 UniBoyaca
Ruta 1
Ruta 2
Ruta 3
A Sur
B Suroccidente
C Central
D Suroriente
B E Occidental
F Noroccidente
G Nororiente
H Norte
E
C
A F
G
H
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
1 0 5 0 0 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 5 0 4 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0 0 0 0
3 0 4 0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
4 0 0 6 0 0 12 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
5 8 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 12 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0
7 0 10 0 0 6 0 0 0 15 0 5 6 0 0 0 7 0 0 0 0 0
8 0 0 0 0 0 0 0 0 7 0 14 0 0 0 0 0 0 0 0 0 0
9 0 0 0 0 0 0 15 7 0 0 0 0 0 0 0 0 0 0 0 0 0
10 0 0 0 0 0 0 0 0 0 0 20 0 0 0 0 0 0 5 0 0 0
11 0 0 0 0 0 0 5 14 0 20 0 0 0 0 4 0 0 0 0 0 0
12 0 0 0 0 0 0 6 0 0 0 0 0 0 5 0 0 0 0 0 0 0
13 0 0 0 0 0 4 0 0 0 0 0 0 0 8 0 0 0 0 0 0 0
14 0 0 0 0 0 0 0 0 0 0 0 5 8 0 0 0 0 0 0 0 0
15 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 18 0 0
16 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0 3 0 0 0 0
17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 9
18 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 17 0
19 0 0 0 0 0 0 0 0 0 0 0 0 0 0 18 0 0 0 0 6 0
20 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 17 6 0 8
21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 0 0 8 0
LINK
PESO(Minutos)
Nodo 1 Nodo 2
1 2 5
1 5 8
2 3 4
2 7 10
3 4 6
4 6 12
5 7 6
6 13 4
7 12 6
7 11 5
7 9 15
7 16 7
8 9 7
8 11 14
10 11 20
10 18 5
11 15 4
12 14 5
13 14 8
15 19 18
16 17 3
17 21 9
18 20 17
19 20 6
20 21 8
A B C D E F G H
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
A B C D E F G H
A 0 1 1 0 0 0 0 0
B 1 0 0 0 0 0 0 0
C 1 0 0 1 1 1 0 0
D 0 0 1 0 0 0 0 0
E 0 0 1 0 0 0 0 0
F 0 0 1 0 0 0 0 0
G 0 0 0 0 0 0 0 1
H 0 0 0 0 0 0 1 0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 1 0 1 1 1 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0
3 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
4 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
5 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
6 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
7 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0
8 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0
9 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0
10 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0
11 0 1 0 0 0 0 1 1 1 1 0 1 0 0 1 0 0 1 0 0 0
12 0 1 0 0 0 0 1 0 0 0 1 0 1 1 0 0 0 0 0 0 0
13 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0
14 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0
15 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0
16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1
18 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0
19 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1
20 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1
21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0
1 =2 8 =2 15 =2
2 =3 =2 =2
9 16
3 =2 =2 17
10 =2
=2
4 =2 11 =4 18
5 12 =2 =2
=2 19
=2
6 =2 13 20 =3
7 =6 14 =2 21 =2
Si todos los nodos
Circuito
son de grado par.
Euler.
2
Teorema Si en un grafo todos los nodos Camino Si dos nodos poseen
de Euler tienen incluso un grado, entonces. Euler. grado impar.
20
Ruta 2
Ruta 3
No existe ninguna circuito de Hamilton, ni camino de Hamilton en la red propuesta
𝑛
1
𝑚 = 𝐾𝑖 = 2 + 3 + 2 + 2 + 2 + 2 + 6 + 2 + 2 + 4 + 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2 + 3 + 2 = 25
2
𝑖=1
𝑛
1 2𝑚 2 × 25
𝑐 = 𝐾𝑖 = = ≈ 2.38
𝑛 𝑛 21
𝑖=1
𝐾 ≡ 𝐺𝑟𝑎𝑑𝑜 𝑑𝑒 𝑛𝑜𝑑𝑜𝑠
50
𝑚 2𝑚 𝑐 21
𝜌= 𝑛 = = = ≈ 0.119
𝑛(𝑛 − 1ሻ 𝑛 − 1 21 − 1
2
𝑁𝑢𝑚𝑒𝑟𝑜 𝑑𝑒 𝑛𝑜𝑑𝑜𝑠 𝑐𝑜𝑛 𝑢𝑛 𝑔𝑟𝑎𝑑𝑜 𝑒𝑠𝑝𝑒𝑐𝑖𝑓𝑖𝑐𝑜
𝑁𝑢𝑚𝑒𝑟𝑜 𝑡𝑜𝑡𝑎𝑙 𝑑𝑒 𝑛𝑜𝑑𝑜𝑠
17 1
• Para k= 2 es • Para k= 4 es
21 21
2 2
• Para k= 3 es • Para k= 6 es
21 21
En su mayoría dan cero debido a lo poco conectada que esta