|
1. 臾몄젣
�떎�쓬�쓽 �엯�젰 �삎�떇�쓣 媛뽯뒗 �솕�씪(�쑀�뼢 洹몃옒�봽)�쓣 �씫�뼱�꽌 �쐞�긽 �젙�젹(topological sorting)�쓣 �븳 寃곌낵瑜� 異쒕젰�븯�뒗 �봽濡쒓렇�옩�쓣 �옉�꽦�븯�씪.
(1) �뜲�씠�꽣 �솕�씪�뱾(10媛�)��� �옄猷뚯떎�뿉�꽌 �젣怨듬맆 �삁�젙�엫
媛� �솕�씪�뿉�꽌 �엯�젰�쓽 泥レ쨪��� �젙�젏�쓽 媛쒖닔, �쑀�뼢 �뿉吏��쓽 媛쒖닔媛� �닚�꽌�쟻�쑝濡� �굹����굹怨�, 洹� �떎�쓬 以꾨���꽣 �뿉吏� 媛쒖닔留뚰겮 �쑀�뼢 �뿉吏�瑜� �닚�꽌 �뙇�쑝濡� �븳以꾩뵫 �굹�뿴 �븿.
(2) �봽濡쒓렇�옩�뿉�꽌 �쐞�긽�젙�젹�씠 �븞�릺�뒗 寃쎌슦(利�, �궗�씠�겢�씠 �엳�뒗 寃쎌슦)瑜� 諛섎뱶�떆 泥댄겕�빐�꽌 洹몃젃�떎�뒗 硫붿꽭吏�瑜� 異쒕젰�빐�빞 �븿. �쐞�쓽 �뜲�씠�꽣 以묒뿉�뒗 洹몃윴 寃쎌슦�쓽 �삁媛� �룷�븿�릺�뼱 �엳�쓬
2.�엯異쒕젰�쓽 �삁
�젙�젏�씠 4媛�, �뿉吏�媛� (v1, v2), (v1, v3), (v2, v4)�쓽 3媛쒕씪硫�,
�엯�젰:
4 3 // �젙�젏�쓽 媛쒖닔, �뿉吏��쓽 媛쒖닔
1 2 // �쑀�뼢 �뿉吏� (v1, v2)
1 3 // ...
2 4
異쒕젰:
v1 v2 v4 v3
3.臾몄젣����씠 諛⑸쾿(�븣怨좊━利�)
�끂�뱶��� �뿉吏��쓽 媛쒖닔瑜� �엯�젰諛쏆븘�꽌 node�룷�씤�꽣 node1�뿉 ����옣�븯怨� �뿤�뱶�끂�뱶 graph�뿉 留곹겕�떆�궎怨� 洹몄뿉 �븣留욊쾶 graph[].count�쓽 媛믪쓣 利앷���떆耳쒖꽌 topSort�뿉�꽌 �룎�졇�떎.
4.�냼�뒪�봽濡쒓렇�옩
#include
#define MAX_NO_VERTICES 50
typedef struct node *nodePointer;
struct node{
int vertex;
nodePointer link;
};
typedef struct{
int count;
nodePointer link;
} headNode;
headNode graph[MAX_NO_V���(�깮�왂)
|
인 쇄
바로가기
�쐞�긽�젙�젹.hwp
[Size :
81 Kbyte
]
장바구니
