Require an expert for Algo

MUST be an expert of algorithm.
– BFS(G,s)
– Dijkstra(G,s)
– DAG-SP(G,s) – computes shortest distances from source s if the
input graph G is a DAG.
– BellmanFord(G,s)
∗ Bellman Ford returns ”Negative Cycle Detected” if a negative
cycle is detected
Johnson(G) algorithm
TopSort(G) algorithm

Freelancer MUST have knowledge of the following algorithms listed above and NP-Hard problems listed below.

List of NP-hard problems. For example you must have knowledge ALL if not AT LEAST one of following:
• HamCycle(G)
• Clique(G,k)
• VertexCover(G,k)
• 2-partition(S)
• SubsetSum(S,B)

STRICT DEADLINE (5/3)

BUDGET: $300