program algoritma djikstra
#include <cstdlib> #include <iostream> #define max 20 #define infinity 9999 using namespace std; class dijkstra{ private: int n; int graph[max][max]; int colour[max]; int start; int distance[max]; int predecessor[max]; enum {green,yellow,red}; public: void read_graph(); void initialize(); int select_min_distance_lable(); void update(int); void output(); void function(); }; void dijkstra::read_graph(){ cout<<"masukkan jumlah node = "; cin>>n; cout<<"masukkan nilai matrik untuk graf ::\n"; int i,j; for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ cout<<"["<<i<<"],["<<j<<"]=";