aud.example.graph.GraphP88 Class Reference

undirected (weighted or unweighted )example graph (Sedgewick, Algorithms in Java. More...

Inheritance diagram for aud.example.graph.GraphP88:

Collaboration diagram for aud.example.graph.GraphP88:

Public Member Functions
	GraphP88 (boolean weighted)
	GraphP88 ()
Public Member Functions inherited from aud.example.graph.MyGraph
	MyGraph (boolean directed)
	create empty graph More...
	MyGraph (boolean directed, File filename)
	read graph from file using GraphParser More...
AbstractGraph< AbstractNode, AbstractEdge >	getAbstractGraph ()
	view this graph as an AbstractGraph More...
GraphvizDecorator	getDecorator ()
Public Member Functions inherited from aud.graph.GraphAM< MyNode, MyEdge >
	GraphAM (Node nodeGenerator, Edge edgeGenerator, boolean directed)
	Create graph. More...
boolean	isDirected ()
Node	addNode ()
Edge	addEdge (Node source, Node destination)
int	getNumNodes ()
Node	getSomeNode ()
Iterator< Node >	iterator ()
Edge	getEdge (Node source, Node destination)
Vector< Edge >	getInEdges (Node node)
Vector< Edge >	getOutEdges (Node node)
void	removeNode (Node node)
void	removeEdge (Edge edge)
Iterator< Edge >	getEdgeIterator ()

Static Public Member Functions
static void	main (String[] args)

Additional Inherited Members
Protected Member Functions inherited from aud.graph.GraphAM< MyNode, MyEdge >
Node	check (Node node)
Edge	check (Edge edge)

Detailed Description

undirected (weighted or unweighted )example graph (Sedgewick, Algorithms in Java.

Part 5: Graph Algorithms. 3rd ed. p88)

Definition at line 7 of file GraphP88.java.

Constructor & Destructor Documentation

GraphP88() [1/2]

aud.example.graph.GraphP88.GraphP88

(

boolean

weighted

)

Definition at line 8 of file GraphP88.java.

                                    {
    super(false);
    MyNode n0=(MyNode) addNode();
    MyNode n1=(MyNode) addNode();
    MyNode n2=(MyNode) addNode();
    MyNode n3=(MyNode) addNode();
    MyNode n4=(MyNode) addNode();
    MyNode n5=(MyNode) addNode();
    MyNode n6=(MyNode) addNode();
    MyNode n7=(MyNode) addNode();
 
    n0.setLabel("A");
    n1.setLabel("B");
    n2.setLabel("C");
    n3.setLabel("D");
    n4.setLabel("E");
    n5.setLabel("F");
    n6.setLabel("G");
    n7.setLabel("H");
 
    n0.setPosition(0.0, 0.0);
    n1.setPosition(1.0,-2.5);
    n2.setPosition(2.0, 0.0);
    n3.setPosition(1.5,-3.75);
    n4.setPosition(3.0,-5.0);
    n5.setPosition(0.0,-5.0);
    n6.setPosition(4.5,-2.0);
    n7.setPosition(3.0,-2.5);
 
    if (weighted) {
      addEdge(n0,n2).setWeight(20);
      addEdge(n0,n5).setWeight(50);
      addEdge(n0,n7).setWeight(39);
      addEdge(n1,n7).setWeight(20);
      addEdge(n2,n6).setWeight(33);
      addEdge(n3,n4).setWeight(27);
      addEdge(n3,n5).setWeight(27);
      addEdge(n4,n5).setWeight(30);
      addEdge(n4,n7).setWeight(25);
      addEdge(n4,n6).setWeight(31);
    }
    else {
      addEdge(n0,n2);
      addEdge(n0,n5);
      addEdge(n0,n7);
      addEdge(n1,n7);
      addEdge(n2,n6);
      addEdge(n3,n4);
      addEdge(n3,n5);
      addEdge(n4,n5);
      addEdge(n4,n7);
      addEdge(n4,n6);
    }
  }

References aud.graph.GraphAM< MyNode, MyEdge >.addEdge(), aud.graph.GraphAM< MyNode, MyEdge >.addNode(), aud.graph.SimpleNode.setLabel(), and aud.graph.SimpleNode.setPosition().

Here is the call graph for this function:

GraphP88() [2/2]

aud.example.graph.GraphP88.GraphP88

(

)

Definition at line 62 of file GraphP88.java.

                    {
    this(false);
  }

Referenced by aud.example.graph.GraphP88.main().

Here is the caller graph for this function:

Member Function Documentation

main()

static void aud.example.graph.GraphP88.main ( String[]  args )

static

Definition at line 66 of file GraphP88.java.

                                         {
    System.out.println(new GraphP88());
  }

References aud.example.graph.GraphP88.GraphP88().

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• GraphP88.java