In [1]:

    

using LightGraphs
using NetworkDiscovery
using POMDPs
# using TikzGraphs
rng = MersenneTwister(1);


    

In [2]:

    

nw = generate_network(rng, 10, 3, 0.5, 0.1)


    

    
Out[2]:





CommunityNetwork({10, 12} undirected graph,3,[1,2,1,1,2,1,3,3,1,3],13457424)

In [3]:

    

pomdp = generate_problem(rng, nw, 5, 1, 100.0, 4, 4)


    

    
Out[3]:





CommunityAffiliationPOMDP(5,1,100.0,CommunityNetwork({10, 12} undirected graph,3,[1,2,1,1,2,1,3,3,1,3],5),Set{Int64}({9,4,3,1}),Set{Pair{Int64,Int64}}({edge 3 - 9,edge 1 - 3,edge 1 - 9,edge 1 - 4}),[4=>1,3=>1])

In [4]:

    

policy = DiscoveryHeuristic(ProbeHighestDegree(), GuessBasedOnNeighbors(rng))


    

    
Out[4]:





DiscoveryHeuristic(ProbeHighestDegree(),GuessBasedOnNeighbors(MersenneTwister(DSFMT_state(Int32[-423222098,1072940746,1823958146,1073056597,94617959,1073021145,2081944769,1072701541,-1344696523,1073205595  …  -1005791883,1073144418,24484970,1073440808,1370926729,1336278534,-1527371338,-19485865,63,0]),Uint32[0x00000001])))

In [5]:

    

revealed = initial_belief(pomdp)


    

    
Out[5]:





RevealedGraph(Set{Pair{Int64,Int64}}({edge 3 - 9,edge 1 - 3,edge 1 - 9,edge 1 - 4}),[[3,9,4],[],[9,1],[1],[],[],[],[],[3,1],[]],Set{Int64}({9,4,3,1}),[4=>1,3=>1],Set{Int64}({}),1,5)

In [6]:

    

simulate(pomdp, policy, revealed, rng=rng, initial_state=nw)


    

    
Out[6]:





100.0

In [7]:

    




    

    
Out[7]:





CommunityNetwork({10, 12} undirected graph,3,[1,2,1,1,2,1,3,3,1,3],5)

In [ ]: