MC logo

Graph With Positive Weights

^  Dr. Bennet

Tswitch

Main Page
F06 Assignment
Download Library
CCSC '07 Paper

Clients for Tswitch

Save And Restore
Restack
Multiple Stacks

Clients for the F06 Assignment

Simple
Thread Demolition Derby
Graph Search
Trivial Graph
Positive Weights
General Weights
This is a non-trivial example using positive weights. In this case, the program performs the standard optimization of abandoning a path once it becomes as expensive as the current max.
<<Trivial Graph Input grin3.txt Graph With General Weights>> 
twig    -> shark        10
        -> warple       3
shark   -> gooble       8
        -> thnawk       15
        -> twig         15
warple  -> gooble       17
        -> tongle       3
tongle  -> shark        19
        -> fwap         20
gooble  -> warple       16
        -> shark        17
        -> thnawk       12
        -> tongle       15
thnawk  -> fwap         4
        -> shark        10
fwap    -> gooble       14
        -> thnawk       11
        -> shark        21
@
tongle => shark
twig => fwap
fwap => tongle
<<Trivial Graph Input Graph With General Weights>>