graph-visit

// ConsoleApplication5.cpp : 定義主控台應用程式的進入點。
//

#include "stdafx.h"
#include <iostream>
using namespace std;
#define map_size 10

class node
{
public:
    node(int n){ next = NULL; data = n; }
    int data;
    node *next;
};

class list
{
public:
    void push(int);
    list(){ head = NULL; }
    void print();
    node *head;
private:
};

void list::push(int push_in)
{
    //cout << "\ncall push\n";
    if (head == NULL)
    {
        head = new node(push_in);
        return;
    }
    node* pos = list::head;
    while (pos->next != NULL)
    {
        pos = pos->next;
    }
    pos->next = new node(push_in);
    //cout << "push end\n";
}

void list::print()
{
    node *pos = head;
    while (pos != NULL)
    {
        cout << "[" << pos->data + 1 << "]";
        pos = pos->next;
    }
}

class graph
{
public:
    graph(int** in){ map = in; for (int i = 0; i < map_size; i++){ isvisit[i] = 0; } }
    int** map;
    list maplist[map_size];
    void visit(int,bool *,list*);
    bool isvisit[map_size];
    void convert_list();
    void print_list();
};

void graph::convert_list()
{
    for (int i = 0; i < map_size; i++)
    {
        for (int j = 0; j < map_size; j++)
        {
            if (map[i][j] == 1)
            {
                maplist[i].push(j);
            }
        }
    }
}

void graph::print_list()
{
    for (int i = 0; i < map_size; i++)
    {
        cout << "V" << i + 1 << " :";
        maplist[i].print();
        cout << endl;
    }
}

void graph::visit(int i, bool *isvisit, list* head)
{
    node *ptr;
    isvisit[i] = 1;
    cout << "visit= " << i+1 << endl;
    ptr = head[i].head;
    while(ptr != NULL)
    {
        if (isvisit[ptr->data] == 0)
        {
            visit(ptr->data, isvisit, head);
        }
        ptr = ptr->next;
    }
}

int main()
{
    int row_list[map_size][map_size] = {
        { 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 },
        { 1, 0, 0, 1, 1, 0, 0, 0, 0, 0 },
        { 1, 0, 0, 0, 0, 1, 1, 0, 0, 0 },
        { 0, 1, 0, 0, 0, 0, 0, 1, 0, 0 },
        { 0, 1, 0, 0, 0, 0, 0, 1, 0, 0 },
        { 0, 0, 1, 0, 0, 0, 0, 0, 1, 0 },
        { 0, 0, 1, 0, 0, 0, 0, 0, 1, 0 },
        { 0, 0, 0, 1, 1, 0, 0, 0, 0, 1 },
        { 0, 0, 0, 0, 0, 1, 1, 0, 0, 1 },
        { 0, 0, 0, 0, 0, 0, 0, 1, 1, 0 }, };
    int* mapin[map_size];
    for (int i = 0; i < map_size; i++)
    {
        mapin[i] = row_list[i];
    }
    graph gr1(mapin);

    for (int i = 0; i < map_size; i++)
    {
        for (int j = 0; j < map_size; j++)
            cout << gr1.map[i][j] << " ";
        cout << endl;
    }

    gr1.convert_list();
    gr1.print_list();

    gr1.visit(0, gr1.isvisit, gr1.maplist);
    return 0;
}