edu.mit.csail.sdg.squander.examples.graph.Graph__2 Class Reference
[Examples]
Inherits java::io::Serializable.
Classes | |
| class | Edge |
| class | Node |
Public Member Functions | |
| Graph__2 () | |
| Node | newNode (int key) |
| void | addNode (Node n) |
| void | addEdge (Edge e) |
| Edge | newEdge (Node a, Node b) |
| boolean | containsEdge (Node n1, Node n2) |
| Node[] | nodes () |
| Edge[] | edges () |
| int | numEdges () |
| int | numNodes () |
| int | size () |
| void | removeAllIncomingEdges (Node n) |
| void | removeAllOutgoingEdges (Node n) |
| Node[] | hamiltonian () |
| Node[] | topsort () |
| Node[] | maxClique (int k) |
| String | toString () |
Private Attributes | |
| Set< Node > | nodes = new LinkedHashSet<Node>() |
| Set< Edge > | edges = new LinkedHashSet<Edge>() |
Static Private Attributes | |
| static final long | serialVersionUID = -6332798241722968023L |
Detailed Description
The same as Graph but with an extra spec field.
Definition at line 28 of file Graph__2.java.
Constructor & Destructor Documentation
| edu.mit.csail.sdg.squander.examples.graph.Graph__2.Graph__2 | ( | ) |
Definition at line 120 of file Graph__2.java.
Member Function Documentation
| void edu.mit.csail.sdg.squander.examples.graph.Graph__2.addEdge | ( | Edge | e | ) |
Definition at line 129 of file Graph__2.java.
| void edu.mit.csail.sdg.squander.examples.graph.Graph__2.addNode | ( | Node | n | ) |
Definition at line 128 of file Graph__2.java.
| boolean edu.mit.csail.sdg.squander.examples.graph.Graph__2.containsEdge | ( | Node | n1, | |
| Node | n2 | |||
| ) |
Definition at line 137 of file Graph__2.java.
Definition at line 140 of file Graph__2.java.
| Node [] edu.mit.csail.sdg.squander.examples.graph.Graph__2.hamiltonian | ( | ) |
Definition at line 168 of file Graph__2.java.
| Node [] edu.mit.csail.sdg.squander.examples.graph.Graph__2.maxClique | ( | int | k | ) |
Definition at line 190 of file Graph__2.java.
| Edge edu.mit.csail.sdg.squander.examples.graph.Graph__2.newEdge | ( | Node | a, | |
| Node | b | |||
| ) |
Definition at line 131 of file Graph__2.java.
| Node edu.mit.csail.sdg.squander.examples.graph.Graph__2.newNode | ( | int | key | ) |
Definition at line 122 of file Graph__2.java.
Definition at line 139 of file Graph__2.java.
| int edu.mit.csail.sdg.squander.examples.graph.Graph__2.numEdges | ( | ) |
Definition at line 142 of file Graph__2.java.
| int edu.mit.csail.sdg.squander.examples.graph.Graph__2.numNodes | ( | ) |
Definition at line 143 of file Graph__2.java.
| void edu.mit.csail.sdg.squander.examples.graph.Graph__2.removeAllIncomingEdges | ( | Node | n | ) |
Definition at line 146 of file Graph__2.java.
| void edu.mit.csail.sdg.squander.examples.graph.Graph__2.removeAllOutgoingEdges | ( | Node | n | ) |
Definition at line 153 of file Graph__2.java.
| int edu.mit.csail.sdg.squander.examples.graph.Graph__2.size | ( | ) |
Definition at line 144 of file Graph__2.java.
| Node [] edu.mit.csail.sdg.squander.examples.graph.Graph__2.topsort | ( | ) |
Definition at line 179 of file Graph__2.java.
| String edu.mit.csail.sdg.squander.examples.graph.Graph__2.toString | ( | ) |
Definition at line 195 of file Graph__2.java.
Member Data Documentation
Set<Edge> edu.mit.csail.sdg.squander.examples.graph.Graph__2.edges = new LinkedHashSet<Edge>() [private] |
Definition at line 118 of file Graph__2.java.
Set<Node> edu.mit.csail.sdg.squander.examples.graph.Graph__2.nodes = new LinkedHashSet<Node>() [private] |
Definition at line 117 of file Graph__2.java.
final long edu.mit.csail.sdg.squander.examples.graph.Graph__2.serialVersionUID = -6332798241722968023L [static, private] |
Definition at line 30 of file Graph__2.java.
The documentation for this class was generated from the following file:
- examples/edu/mit/csail/sdg/squander/examples/graph/Graph__2.java
