sst/elements/genericProc/programs/MTGL/test/test_isomorphism_ullman.cpp File Reference

#include <unistd.h>
#include <cassert>
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <ostream>
#include <iterator>
#include <sstream>
#include <string>
#include <strstream>
#include <vector>
#include <mtgl/bfs.hpp>
#include <mtgl/connected_components.hpp>
#include <mtgl/generate_rmat_graph.hpp>
#include <mtgl/generate_subgraph.hpp>
#include <mtgl/metrics.hpp>
#include <mtgl/random_walk.hpp>
#include <mtgl/static_graph_adapter.hpp>
#include <mtgl/subgraph_adapter.hpp>
#include <mtgl/util.hpp>
#include <mtgl/isomorphism_ullman.hpp>

Data Structures
class	match_visitor_t
Defines
#define	PRINT_MATCHES   01
#define	GENERATE_AND_SAVE   0
#define	LOAD_EDGE_INDUCED_GRAPH_FROM_FILE   1
Functions
template<typename T >
void	my_print_array (T *Array, int size, const char *TAG=NULL)
template<typename T >
bool	match_arrays (T *A1, T *A2, int size)
string	generate_string (bool include_pid=false, time_t *time_param=NULL)
bool	xmt_load_textfile (char *filename, char **buffer)
template<typename T , typename U >
bool	xmt_load_columns_from_textfile (char *filename, int num_cols, T &max_value, T &num_rows, U **column1, U **column2)
template<typename T , typename U >
bool	load_edges_from_file (const char *filename, T &num_verts, T &num_edges, U **sources, U **targets)
template<typename Graph >
bool	load_graph_from_file (char *filename, Graph &ga)
template<typename T >
bool	load_map_from_file (char *filename, T **map, T *size)
template<typename Graph >
void	output_graph_edgelist (Graph &g, ostream &out)
template<typename Graph >
void	my_print_graph (Graph &g)
template<typename Graph >
void	output_vflib_graph (Graph &g, ostream &out)
template<typename T >
void	generate_and_save_graph (T rmat_scale, T rmat_edgefactor, T num_subg_verts, T num_subg_edges, char *filename)
int	main (int argc, char *argv[])

---

Detailed Description

Author:

William McLendon ([email protected])

Date:

10/6/2009