class graphs

public : graphs::~graphs()

public : void graphs::copy_graph(ll * l, int no)

public : int graphs::get_num()

public : graphs::graphs()

public : int graphs::read_vertices()

public : int * graphs::cost

public : pair * graphs::e

public : ll * graphs::llp

public : int * graphs::memo

private : int graphs::num

private : int graphs::num_v

public : int * graphs::path

public : int * graphs::pred

public : typedef struct ll graphs::ll

public : int graphs::ll::cost

public : ll * graphs::ll::next

public : int graphs::ll::to

public : char graphs::ll::visited

public : int graphs::pair::a

public : int graphs::pair::b

class dijkstra :/*extends*/ public graphs

public : dijkstra::~dijkstra()

public : dijkstra::dijkstra()

public : int dijkstra::salesman()

public : int dijkstra::solve(int start, int final)

public : int dijkstra::solve_khrushcal()

public : int dijkstra::solve_prim()

public : void dijkstra::visitmore(int cc)

public : int dijkstra::cities

public : int dijkstra::costs

public : int dijkstra::maxcities

public : int dijkstra::mincost

class depthfirst :/*extends*/ public graphs

public : matrixs::matrixs()

public : void matrixs::put_costs()

public : void matrixs::solve_adiacenta()

public : void matrixs::solve_distante_Floyd_Warshall()

public : void matrixs::solve_drumuri_Roy_Warshall()

public : int * matrixs::mat

public : int * matrixs::matcosts