codepad
[
create a new paste
]
login
|
about
Language:
C
C++
D
Haskell
Lua
OCaml
PHP
Perl
Plain Text
Python
Ruby
Scheme
Tcl
#include <iostream> int main() { // Adjacency Matrix of your graph const int n = 5; bool d[n][n] = { { 0, 1, 1, 0, 0 }, { 0, 0, 1, 0, 0 }, { 0, 0, 0, 1, 0 }, { 0, 0, 0, 0, 1 }, { 0, 0, 0, 0, 0 }, }; // Modified Warshall Algorithm bool out[n][n] = {}; for (int k = 0; k < n; k++) for (int i = 0; i < n; i++) if (d[i][k]) for (int j = 0; j < n; j++) if (d[k][j] && !d[i][j]) std::cout << i + 1 << " " << j + 1 << std::endl; }
Private
[
?
]
Run code
Submit