Signal Strength

Introduction

• midatl2008

This problem asks to find the maximum signal strength in a non-cyclic graph. There are "servers" which have gain, and a "connections" from a server to another, witch also have a gain.

Difficulty

Algorithmic

Mild. The theory is pretty straightforward and doesn't necessitate a fast algorithm.

Implementation

Spic

Solutions

Solution Using foo and X with Bob and alice algorithm

Idea

I had an idea! I thought of using bob and foo because of XYZ.

How to

The code was done this way.

Solution - *Language X*

#include <stdio.h>

int main()
{
    printf ("Hello Word!");
    return 0;
}

Super Epic Fails

It would be really easy to make this mistake or that mistake

Tags

• BFS
• Dynamic Programming