try to implement graph

[surfersss]

i try to implement graph bfs but get compiler error
error: invalid types '<unresolved overloaded function type>[int]' for array subscript|
1.is my approach making array of vector of struct is right approach? and how can i solve the compiler error?

2. how to initialize array value to infinity
3. when making undirected graph, should i push back 2 times

 #include <iostream>
#include <deque>
#include <vector>
#define INT_MAX 21422
using namespace std;

int distancee[10]={4,4,4,4,4,4,4,4,4,4}; //want to intialize all to infinity
struct bfss{
int firstt;
int secondd;
};
vector<bfss>bfs[10];
void bfsfunc(int start);
int main()
{
    int edges,nodes,x,y,z;
    cin>>edges>>nodes;
     for(int i=0;i<edges;i++){
        cin>>x>>y>>z; //x is array subscript , y is node(x-y is edge) , z is weight
   
         bfss newbfs;
        newbfs.firstt=y;
        newbfs.secondd=z;
        bfs[x].push_back(newbfs); 

        bfss newbfs;
        newbfs.firstt=x;
        newbfs.secondd=z;
        bfs[y].push_back(newbfs);  // when making undirected graph, should i push back 2 times?
     }

    bfsfunc(0);
    return 0;
}

void bfsfunc(int start){
deque<int> q;
q.push_back(start);
distancee[start]=0;
while(!q.empty()){
    int v=q.front();
    q.pop_front();
    for(int i=0;i<bfs[v].size();i++){
            
        if(distance[bfs[v][i].firstt]>(distance[v]+bfs[v][i].secondd)){ // got error in this line
            distance[bfs[v][i].firstt]=distance[v]+bfs[v][i].secondd;

        if(bfs[v][i].second==0)
        {
            q.push_front(bfs[v][i].first);
        }else{
        q.push_back(bfs[v][i].second);
        }
    }
}
}
}