akproj

The Problem Write a pair of procedures that pickle and unpickle graph data structures. The procedures have the prototypes void pickle_graph(const std::string & fname, const graph_node * root); graph_node * unpickle_graph(const std::string & fname); The fname argument gives the name of the file to which the graph will be pickled or from which the graph will be unpickled. Each file contains one graph. Any errors that occur during file operations should result in an informative error message and program termination. The root argument to pickle_graph() is a node from the graph to pickle (despite the suggestive name, the graph need not be a tree). Only those nodes reachable from the root need to be pickled. Given a file name f, the node returned by unpickle_graph() should be the equivalent to the node passed into the most recent invocation of pickle_graph() with the same file name f. A graph is constructed from nodes with the structure struct graph_node { pickleable * data_ptr; std::vector children; }; all nodes in a graph are graph_nodes. A graph node may have any number of children, including none; the left-to-right order of children in a graph node is significant. Edges are directed; they point to the children but not back to the [login to view URL] file graph.h contains declarations for graph_node, pickle_graph(), and unpickle_graph(). The data stored in each graph node can be pickled and unpickled by calling the the member functions void pickleable::pickle(std::ostream &); void pickleable::unpickle(std::istream &); The data to pickle is written to the given ostream; the data to unpickle is read from the given istream. These member functions are defined in /e pickle.h [login to view URL] contains some simple driver code to test your routines. This code is not the code I'll use to test your assignment; in particular, your routines should work for arbitrary graphs, not just trees. The graph returned by unpickle_graph() should be equivalent to the graph passed into pickle_graph(). Two graphs are equivalent if there exists a one-to-one correspondence between the nodes and edges of one graph and the nodes and edges of the other graph. Two nodes are equivalent if they have the same data and the their children are equivalent in the left-to-right order given in each node. Two edges are equivalent if the nodes at their heads and tails are equivalent. -------------------------------- ## Deliverables Complete and fully-functional working program using C++ in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Platform Unix,Sun solaris,LInux ## Deadline information Must be checked,tested and documneted properly