PRÜFER CODES AND LABELED TREES IN C

search

BREADTH-FIRST SEARCH OF A GRAPH IN C

深度优先搜索

TRAVELING SALESMAN PROBLEM USING BACKTRACKING IN C

REALISING A GRAPH DEGREE SEQUENCE IN C

TOPOLOGICAL SORT IN C

GREEDY VERTEX COVER IN C

COMPLEMENT OF A GRAPH IN C

MAXIMUM CLIQUE USING BACKTRACKING IN C

BELLMAN-FORD ALGORITHM IN C

FLOYD-WARSHALL ALGORITHM IN C

REPETITIVE NEAREST NEIGHBOUR ALGORITHM FOR TSP IN C

NEAREST NEIGHBOUR ALGORITHM FOR TSP IN C

CHEAPEST-LINK ALGORITHM FOR TSP IN C

GREEDY MAXIMUM INDEPENDENT SET IN C

SPANNING TREES

SPANNING TREES OF A GRAPH IN C

SPANNING FOREST OF A GRAPH IN C

生成森林

SPANNING TREE OF A GRAPH IN C

生成树

BORŮVKA’S MINIMAL SPANNING TREE (MST) ALGORITHM IN C

KRUSKAL’S MINIMUM SPANNING TREE (MST) ALGORITHM IN C

PRIM’S MINIMUM SPANNING TREE (MST) ALGORITHM IN C

component

CONNECTED COMPONENTS OF A GRAPH IN C

path

EULER CIRCUITS USING BACKTRACKING IN C

DIJKSTRA’S SHORTEST PATHS ALGORITHM IN C

HAMILTONIAN CIRCUITS USING BACKTRACKING IN C

circle

GRAPH CYCLE DETECTION IN C

coloring

VERTEX COLOURING WITH BACKTRACKING IN C

representation

GRAPH DATA STRUCTURES

GRAPH ALGORITHMS