Update README.md

Author: ctkqiang

README.md

@@ -16,6 +16,7 @@
 [![Build status](https://ci.appveyor.com/api/projects/status/xaws7d1s0f4ho65b?svg=true)](https://ci.appveyor.com/project/johnmelodyme/shortestpathalgorithm)
 [![Build Status](https://travis-ci.org/johnmelodyme/ShortestPathAlgorithm.svg?branch=master)](https://travis-ci.org/johnmelodyme/ShortestPathAlgorithm)
 ![Java CI](https://github.com/johnmelodyme/ShortestPathAlgorithm/workflows/Java%20CI%20with%20Gradle/badge.svg?branch=master)
+![C/C++ CI](https://github.com/johnmelodyme/ShortestPathAlgorithm/workflows/C/C++%20CI/badge.svg?branch=master&event=create)
 
 One algorithm for finding the shortest path from a starting node to a target node in a weighted graph is Dijkstra’s algorithm. The algorithm creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph.