Giters

Gattalraouf / DFS_SCUCG

The Obvious solution to get the shortest cycle in undirected complete graph using DFS

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

DFS_SCUCG

The Obvious solution to get the shortest cycle in undirected complete graph using DFS

Demandes

  • Find a shortest cycle in a given undirected complete graph.

Built With

Authors

  • Abderraouf GATTAL

License

This project is licensed under the MIT License

About

The Obvious solution to get the shortest cycle in undirected complete graph using DFS

Languages

Language:C 97.3%Language:CMake 2.7%