algorithm-essentials/java/graph/README.md at master · hsissnn/algorithm-essentials · GitHub
Skip to content

Latest commit

 

History

History
25 lines (22 loc) · 446 Bytes

File metadata and controls

25 lines (22 loc) · 446 Bytes

无向图的节点定义如下:

{% if book.cpp %}

// 无向图的节点
struct UndirectedGraphNode {
    int label;
    vector<UndirectedGraphNode *> neighbors;
    UndirectedGraphNode(int x) : label(x) {};
};

{% endif %}

{% if book.java %}

// 无向图的节点
class UndirectedGraphNode {
    int label;
    ArrayList<UndirectedGraphNode> neighbors;
    UndirectedGraphNode(int x) { label = x;}
};

{% endif %}