edu.mit.csail.sdg.squander.examples.graph2.Graph Class Reference
[Examples]

List of all members.

Classes

class  Node

Public Member Functions

 Graph ()
Node newNode (int key)
void addNode (Node n)
void newEdge (Node a, Node b)
Node[] nodes ()
int numEdges ()
int numNodes ()
int size ()
Node[] hamiltonian ()
Node[] topsort ()
Node[] maxClique (int k)

Detailed Description

Abstract (mock) graph.

Author:
kuat

Definition at line 23 of file Graph.java.


Constructor & Destructor Documentation

edu.mit.csail.sdg.squander.examples.graph2.Graph.Graph (  ) 

Definition at line 38 of file Graph.java.


Member Function Documentation

void edu.mit.csail.sdg.squander.examples.graph2.Graph.addNode ( Node  n  ) 
Node [] edu.mit.csail.sdg.squander.examples.graph2.Graph.hamiltonian (  ) 
Node [] edu.mit.csail.sdg.squander.examples.graph2.Graph.maxClique ( int  k  ) 
void edu.mit.csail.sdg.squander.examples.graph2.Graph.newEdge ( Node  a,
Node  b 
)
Node edu.mit.csail.sdg.squander.examples.graph2.Graph.newNode ( int  key  ) 

Definition at line 45 of file Graph.java.

Node [] edu.mit.csail.sdg.squander.examples.graph2.Graph.nodes (  ) 

Definition at line 65 of file Graph.java.

int edu.mit.csail.sdg.squander.examples.graph2.Graph.numEdges (  ) 
int edu.mit.csail.sdg.squander.examples.graph2.Graph.numNodes (  ) 
int edu.mit.csail.sdg.squander.examples.graph2.Graph.size (  ) 

Definition at line 71 of file Graph.java.

Node [] edu.mit.csail.sdg.squander.examples.graph2.Graph.topsort (  ) 

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