Jump to content

Check out our Community Blogs

Register and join over 40,000 other developers!

Recent Status Updates

View All Updates

- - - - -

[Homework] C: Shortest cyclic path of a graph


This topic has been archived. This means that you cannot reply to this topic.
No replies to this topic

#1 negru


    CC Newcomer

  • Member
  • PipPip
  • 17 posts

Posted 12 December 2015 - 11:45 AM

Write a function for finding the shortest cyclic path for every node of a directed and weighted graph. Prototype of a function is 

void path(double adj_matrix[][n]);

Print nodes with length of every path.

For nodes which don't have cyclic path, lenght is -1.


How to modify Floyd Warshall's algorithms in order to find the shortest cyclic path?


Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download