edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan Class Reference
[Examples]

Collaboration diagram for edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan:
Collaboration graph
[legend]

List of all members.

Static Public Member Functions

static Node[] hp (Graph g)
static void hp (int[][] adjacency)
static void hp (List< Integer > pathSoFar, int[][] adjacency)
static void printSolution (List< Integer > pathSoFar)
static void main (String[] args)

Static Private Attributes

static ArrayList< Integer > solution

Detailed Description

An imperative implementation of the Hamiltonian problem taken from:

http://moodle.cornellcollege.edu/0809/mod/resource/index.php?id=947

Definition at line 19 of file HamiltonianMan.java.


Member Function Documentation

static void edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan.hp ( List< Integer >  pathSoFar,
int  adjacency[][] 
) [static]
static void edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan.hp ( int  adjacency[][]  )  [static]
static Node [] edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan.hp ( Graph  g  )  [static]
static void edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan.main ( String[]  args  )  [static]
static void edu.mit.csail.sdg.squander.examples.graph.HamiltonianMan.printSolution ( List< Integer >  pathSoFar  )  [static]

Member Data Documentation


The documentation for this class was generated from the following file:
Generated by  doxygen 1.6.2-20100208