forked from cerc-io/ipld-eth-server
50 lines
1.5 KiB
Go
Executable File
50 lines
1.5 KiB
Go
Executable File
// CookieJar - A contestant's algorithm toolbox
|
|
// Copyright 2013 Peter Szilagyi. All rights reserved.
|
|
//
|
|
// CookieJar is dual licensed: you can redistribute it and/or modify it under
|
|
// the terms of the GNU General Public License as published by the Free Software
|
|
// Foundation, either version 3 of the License, or (at your option) any later
|
|
// version.
|
|
//
|
|
// The toolbox is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
|
// more details.
|
|
//
|
|
// Alternatively, the CookieJar toolbox may be used in accordance with the terms
|
|
// and conditions contained in a signed written agreement between you and the
|
|
// author(s).
|
|
|
|
package dfs_test
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"gopkg.in/karalabe/cookiejar.v2/graph"
|
|
"gopkg.in/karalabe/cookiejar.v2/graph/dfs"
|
|
)
|
|
|
|
// Small API demo based on a trie graph and a few disconnected vertices.
|
|
func Example_usage() {
|
|
// Create the graph
|
|
g := graph.New(7)
|
|
g.Connect(0, 1)
|
|
g.Connect(1, 2)
|
|
g.Connect(2, 3)
|
|
g.Connect(3, 4)
|
|
g.Connect(3, 5)
|
|
|
|
// Create the depth first search algo structure for g and source node #2
|
|
d := dfs.New(g, 0)
|
|
|
|
// Get the path between #0 (source) and #2
|
|
fmt.Println("Path 0->5:", d.Path(5))
|
|
fmt.Println("Order:", d.Order())
|
|
fmt.Println("Reachable #4 #6:", d.Reachable(4), d.Reachable(6))
|
|
|
|
// Output:
|
|
// Path 0->5: [0 1 2 3 5]
|
|
// Order: [0 1 2 3 5 4]
|
|
// Reachable #4 #6: true false
|
|
}
|