Skip to content

Commit

Permalink
Merge pull request #4 from OzPol/OzPol-Fix-Logos-for-new-algos
Browse files Browse the repository at this point in the history 
Fix: Updated logos for missing algorithm implementations in Readme
  • Loading branch information
@OzPol
OzPol authored Sep 25, 2024
2 parents 54759c5 + cf4f220 commit b2a77b5
Showing 1 changed file with 18 additions and 18 deletions.
36 changes: 18 additions & 18 deletions README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -68,7 +68,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/a-search-algorithm/">A* Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -83,7 +83,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -126,7 +126,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/bellman-ford-algorithm-dp-23/">Bellman-Ford Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand Down Expand Up @@ -822,7 +822,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/">Ford-Fulkerson Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -837,7 +837,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -880,7 +880,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/stable-marriage-problem/">Gale-Shapley Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -895,7 +895,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -1170,7 +1170,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/hungarian-algorithm-assignment-problem-set-1-introduction/">Hungarian Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -1185,7 +1185,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -1344,7 +1344,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/">Kruskal's Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -1359,7 +1359,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -1866,7 +1866,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/">Prim's Algorithm</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -1881,7 +1881,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -2100,7 +2100,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/introduction-to-avl-tree/">AVL Tree</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -2115,7 +2115,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down Expand Up @@ -2738,7 +2738,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/introduction-to-red-black-tree/">Red-Black Tree</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand Down Expand Up @@ -4074,7 +4074,7 @@ In order to achieve greater coverage and encourage more people to contribute to
<td><a href="https://www.geeksforgeeks.org/topological-sorting/">Topological Sort</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/c.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- C++ -->
Expand All @@ -4089,7 +4089,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/python.svg" />
<img align="center" height="25" src="./logos/github.svg" />
</a>
</td>
<td> <!-- Go -->
Expand Down

0 comments on commit b2a77b5

Please sign in to comment.