学步园

  反转一个邻接表,没有考虑权值.是为另一个例程服务的一个函数.贴出来吧.

int Reverse_A (Adjacenty_List * const padj, const Hash_Table * const pht)<br /> {<br /> Name name ;<br /> Adjoin_To_Vertex * scan, * new_vertex, * temp_1, * * temp_2 ;<br /> int w, i, capacity = (*padj) -> capacity ;</p> <p> for (i = 0; i < capacity; i++)<br /> {<br /> scan = (*padj) -> list[i].adjoin_to ;<br /> name = (*pht) -> lists[(*padj) -> list[i].hash_value].name ;<br /> while (scan)<br /> {<br /> w = (*pht) -> lists[scan -> hash_value].index_in_adjacenty_list ;<br /> /* The incipient value of cvw is FALSE */<br /> if (FALSE == scan -> cvw)<br /> {<br /> /* Create a new vertex */<br /> new_vertex = Make_Adjoin_To_Vertex (pht, name, 0) ;<br /> /* Borrow the territory of cvw to target */<br /> new_vertex -> cvw = TRUE ;<br /> if (NULL == new_vertex)<br /> return 0 ;<br /> if (NULL == (*padj) -> list[w].adjoin_to)<br /> (*padj) -> list[w].adjoin_to = new_vertex ;<br /> else<br /> {<br /> temp_2 = Find_End (&(*padj) -> list[w].adjoin_to) ;<br /> (*temp_2) -> next = new_vertex ;<br /> }<br /> temp_1 = scan ;<br /> (*padj) -> list[i].adjoin_to = scan -> next ;<br /> scan = scan -> next ;<br /> free (temp_1) ;<br /> }<br /> else<br /> scan = scan -> next ;<br /> }<br /> }</p> <p> return 1 ;<br /> }