Ouran high school host club (my favorite anime)
Looking for a quiet place to study, Haruhi stumbles upon the Third Music Room, a place where the Ouran high school host club gathers, a group of six extremely attractive male students; Takashi Morinozuka, called "Mori"; follows Hunny as a best friend Mitsukuni Haninozuka, called "Hunny". Twins Kaoru and Hikaru Hitachiin; stick together and thinks everyone else around them are uneducated outsiders. Tamaki Suoh, the leader of the club and creator and Kyoya Ootori ,who manages all the events for the club. During their first meeting, Haruhi accidentally knocks over and breaks a vase valued at ¥8,000,000 and is told she was in debt to them for her action. She then joins the club, dressed like a boy in order to pay off her debt.

traversing a directed graph (code)
http://h1.ripway.com/vedcruzer111/graph.h
http://h1.ripway.com/vedcruzer111/edge.h
http://h1.ripway.com/vedcruzer111/vertex.h
This is my code for vertex input
#include
#include
#include "edge.h"
#include "vertex.h"
#include "graph.h"
#include
//##################################################################
//############## ###################
//############## vertex ###################
//##################################################################
Vertex::Vertex(char theData, Vertex *nextVert) {
data = theData;
next = nextVert;
edges = NULL;
}
Vertex:: ~Vertex() {
delete next;
delete edges;
}
char Vertex::getData() {
return data;
}
void Vertex::printEdges() {
if (edges == NULL)
cout << "vertex " << getData() << " has no edges\n";
else {
cout << "vertex " << getData() << " has edges to: ";
edges > print();
}
}
void Vertex::printGraph() {
printEdges();
if (next != NULL)
next > printGraph();
}
void Vertex::connectTo(Vertex *Vert) {
Edge *newEdge = new Edge(Vert, edges);
edges = newEdge;
}
Vertex *Vertex::getNext() {
return next;
}
//##################################################################
//############## ###################
//############## vertex ###################
//##################################################################
//##################################################################
//############## ###################
//############## edge ###################
//##################################################################
Edge *Vertex::getFirstEdge() {
return edges;
}
Edge::Edge(Vertex *Vert, Edge *nextEdge) {
end = Vert;
next = nextEdge;
}
Edge::~Edge() {
delete next;
}
Vertex *Edge::getEnd() {
return end;
}
void Edge::print() {
cout <<> getData() << " ";
if (next == NULL)
cout << endl;
else {
next > print();
}
}
Edge *Edge::getNext() {
return next;
}
//##################################################################
//############## ###################
//############## edge ###################
//##################################################################
//#####################################################################
Graph::Graph() {
first = NULL;
}
Graph::~Graph() {
delete first;
}
Vertex *Graph::find(char theData) {
Vertex *vPtr = first;
while (vPtr != NULL) {
if ( vPtr > getData() == theData)
return vPtr;
vPtr = vPtr > getNext();
}
return NULL;
}
bool Graph::AddVertex(char theData) {
if ( find(theData) != NULL )
return false;
Vertex *newVertex = new Vertex(theData, first);
first = newVertex;
return true;
}
bool Graph::AddEdge(char Begin, char End) {
Vertex *vEnd = find(End);
if (vEnd == NULL) return false;
Vertex *vBegin = find(Begin);
if (vBegin == NULL) return false;
vBegin > connectTo(vEnd);
return true;
}
void Graph::print() {
if (first == NULL)
cout << "Graph has no vertexes " << endl;
else
first > printGraph();
}
//###############################################################################
//############################################################################
int main() {
Graph myGraph;
char vertex;
int choice;
char Begin, End;
myloop:
system("cls");
cout<<"[1.] Add vertex\n";
cout<<"[2.] Add edge\n";
cout<<"[3.] show graph\n\n";
cout<<"Enter mo choice mo: ";
cin>>choice;
if(choice==1)
{
cout<<"Enter the vertex: ";
cin>>vertex;
myGraph.AddVertex(vertex);
goto myloop;
}
else if(choice==2){
cout<<"Enter begin: ";
cin>>Begin;
cout<<"Enter End: ";
cin>>End;
myGraph.AddEdge(Begin, End);
goto myloop;
}
else if(choice==3){
myGraph.print();
system("pause");
goto myloop;
}
system("pause");
return 0;
}

Summer is near

latest movie Ive seen(street fighter legend of chun li)
The forces of darkness are led by Bison (Neal McDonough), a crime boss of seemingly limitless power, and whose past holds a shocking secret. Bison's syndicate, Shadaloo, is taking over the slums of the Thai capital, a task overseen by Balrog (Michael Clarke Duncan), a massively built enforcer and killer. Also in Bison's employ is the assassin Vega (Taboo, of the group The Black Eyed Peas), a masked talonwielding warrior, whose weapon is tailormade for slashing and stabbing attacks. Bison's attache is the beautiful but deadly Cantana (Josie Ho).
Reviews:
It's a cheerfully stupid endeavor, enlivened by some gnarly fights and endullened by all the talky stuff in between.
When Chris Klein yells "Bomb! Everybody Out!", he just as well could have been talking about this movie too.

Am I wrong?
