{"action":"created","issue":{"url":"https://api.github.com/repos/javierri/Grafos/issues/1","repository_url":"https://api.github.com/repos/javierri/Grafos","labels_url":"https://api.github.com/repos/javierri/Grafos/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/javierri/Grafos/issues/1/comments","events_url":"https://api.github.com/repos/javierri/Grafos/issues/1/events","html_url":"https://github.com/javierri/Grafos/issues/1","id":188999024,"number":1,"title":"Realizar un método en Grafo con Matriz de Adyacencia que retorne si existe un camino entre dos nodos.  ","user":{"login":"javierri","id":12854181,"avatar_url":"https://avatars.githubusercontent.com/u/12854181?v=3","gravatar_id":"","url":"https://api.github.com/users/javierri","html_url":"https://github.com/javierri","followers_url":"https://api.github.com/users/javierri/followers","following_url":"https://api.github.com/users/javierri/following{/other_user}","gists_url":"https://api.github.com/users/javierri/gists{/gist_id}","starred_url":"https://api.github.com/users/javierri/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/javierri/subscriptions","organizations_url":"https://api.github.com/users/javierri/orgs","repos_url":"https://api.github.com/users/javierri/repos","events_url":"https://api.github.com/users/javierri/events{/privacy}","received_events_url":"https://api.github.com/users/javierri/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2016-11-13T22:14:22Z","updated_at":"2016-11-17T06:49:20Z","closed_at":null,"body":"Realizar un método que retorne en un grafo con Matriz de Adyacencia si existe un camino entre dos nodos\r\n\r\nProbar buscando si esiste camino entre los nodos \"A\" y \" E\" del siguiente grafo ..\r\n\r\n```\r\n   g = Grafo()\r\n   g.ins_nodo(\"A\")\r\n   g.ins_nodo(\"B\")\r\n   g.ins_nodo(\"C\")\r\n   g.ins_nodo(\"D\")\r\n   g.ins_nodo(\"E\")\r\n\r\n   g.ins_arco(\"A\",\"B\")\r\n   g.ins_arco(\"A\",\"C\",3)\r\n   g.ins_arco(\"A\",\"A\",1)\r\n   g.ins_arco(\"A\",\"D\",1)\r\n   g.ins_arco(\"C\",\"B\")\r\n   g.ins_arco(\"C\",\"D\")\r\n   g.ins_arco(\"D\",\"E\")\r\n```\r\n\r\nColocar el enlace del código con el método solicitado en un replit o codeskultor. **Valor: 2 puntos** para el 3er parcial solo para estudiantes con **Acumulado Parcial menor a 60%** _(ver Definitivas en Hoja de Calificaciones)_\r\n\r\nEl primero en contestar correctamente obtendra los puntos-\r\n"},"comment":{"url":"https://api.github.com/repos/javierri/Grafos/issues/comments/261169432","html_url":"https://github.com/javierri/Grafos/issues/1#issuecomment-261169432","issue_url":"https://api.github.com/repos/javierri/Grafos/issues/1","id":261169432,"user":{"login":"meleyca","id":22155700,"avatar_url":"https://avatars.githubusercontent.com/u/22155700?v=3","gravatar_id":"","url":"https://api.github.com/users/meleyca","html_url":"https://github.com/meleyca","followers_url":"https://api.github.com/users/meleyca/followers","following_url":"https://api.github.com/users/meleyca/following{/other_user}","gists_url":"https://api.github.com/users/meleyca/gists{/gist_id}","starred_url":"https://api.github.com/users/meleyca/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/meleyca/subscriptions","organizations_url":"https://api.github.com/users/meleyca/orgs","repos_url":"https://api.github.com/users/meleyca/repos","events_url":"https://api.github.com/users/meleyca/events{/privacy}","received_events_url":"https://api.github.com/users/meleyca/received_events","type":"User","site_admin":false},"created_at":"2016-11-17T06:49:20Z","updated_at":"2016-11-17T06:49:20Z","body":"https://repl.it/E0gW/1"}}
{"actor":{"display_login":"meleyca"}}