{"push_id":797785584,"size":5,"distinct_size":5,"ref":"refs/heads/master","head":"b18ae64d7165e4f1cacf2eb720885607828b821d","before":"fd35ff6c51f48cc70657031a5058c72d36c4c5f1","commits":[{"sha":"8b3af511c1e98a46927838e716082e0c6ab568a3","author":{"email":"2bc6038c3dfca09b2da23c8b6da8ba884dc2dcc2@libal.eu","name":"Tomas Libal"},"message":"ignore the TEX output files incl. the *.bib resources as they are inlined in .tex files","distinct":true,"url":"https://api.github.com/repos/tomaslibal/intrographs/commits/8b3af511c1e98a46927838e716082e0c6ab568a3"},{"sha":"2ef1a40f3dfab25a68d19f842332d10f7d05c5d9","author":{"email":"2bc6038c3dfca09b2da23c8b6da8ba884dc2dcc2@libal.eu","name":"Tomas Libal"},"message":"tests connectednes of a graph using DFS traversal","distinct":true,"url":"https://api.github.com/repos/tomaslibal/intrographs/commits/2ef1a40f3dfab25a68d19f842332d10f7d05c5d9"},{"sha":"682e2108b8f8e4711daeea9aac6c9ac07b1c6d11","author":{"email":"2bc6038c3dfca09b2da23c8b6da8ba884dc2dcc2@libal.eu","name":"Tomas Libal"},"message":"add a modified version of DFS to produce a spanning tree from a given vertex","distinct":true,"url":"https://api.github.com/repos/tomaslibal/intrographs/commits/682e2108b8f8e4711daeea9aac6c9ac07b1c6d11"},{"sha":"e956d55c0f8365fa6c78fbfe545c23d5dc1d16bf","author":{"email":"2bc6038c3dfca09b2da23c8b6da8ba884dc2dcc2@libal.eu","name":"Tomas Libal"},"message":"test connectedness tester with a graph with two components","distinct":true,"url":"https://api.github.com/repos/tomaslibal/intrographs/commits/e956d55c0f8365fa6c78fbfe545c23d5dc1d16bf"},{"sha":"b18ae64d7165e4f1cacf2eb720885607828b821d","author":{"email":"2bc6038c3dfca09b2da23c8b6da8ba884dc2dcc2@libal.eu","name":"Tomas Libal"},"message":"add uniqueValues and addIfNotFound functions for working with arrays","distinct":true,"url":"https://api.github.com/repos/tomaslibal/intrographs/commits/b18ae64d7165e4f1cacf2eb720885607828b821d"}]}